Mathlib Map

Theorems · Definition · order theory

SuccAddOrder.mk.noConfusion

{α : Type u_1} →
  {inst : Preorder α} →
    {inst_1 : Add α} →
      {inst_2 : One α} →
        {P : Sort u} →
          {toSuccOrder : SuccOrder α} →
            {succ_eq_add_one : ∀ (x : α), SuccOrder.succ x = x + 1} →
              {toSuccOrder' : SuccOrder α} →
                {succ_eq_add_one' : ∀ (x : α), SuccOrder.succ x = x + 1} →
                  { toSuccOrder := toSuccOrder, succ_eq_add_one := succ_eq_add_one } =
                      { toSuccOrder := toSuccOrder', succ_eq_add_one := succ_eq_add_one' } →
                    (toSuccOrder ≍ toSuccOrder' → P) → P
Defined in
Mathlib.Algebra.Order.SuccPred
Cited by
0 results in Mathlib
Foundations
Depth 9 from the axioms · uses no axioms
Mathlib docsSourceLoogleLeanSearch

Around this declaration

Dashed lines are statement dependencies; solid lines are citations in proofs.

Preorder · cited by 7952PreorderSuccOrder · cited by 574SuccOrderSuccAddOrder · cited by 108SuccAddOrderSuccOrder.succ · cited by 13SuccOrder.succSuccAddOrder.noConfusion · cited by 0SuccAddOrder.noConfusionmk.noConfusionCITED BYCITES

Cites5

Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.

Cited by0

Results whose statement or proof uses this declaration.

Nothing cites this yet.