Step
*
of Lemma
Sierpinski-equal2
∀[x,y:Sierpinski]. uiff(x = y ∈ Sierpinski;x = ⊤ ∈ Sierpinski
⇐⇒ y = ⊤ ∈ Sierpinski)
BY
{ (Auto
THEN BLemma `Sierpinski-equal`
THEN Auto
THEN BLemma `not-Sierpinski-top`
THEN Auto
THEN D 0
THEN Auto
THEN ThinTrivial
THEN InstLemma `Sierpinski-unequal` []
THEN Auto) }
Latex:
Latex:
\mforall{}[x,y:Sierpinski]. uiff(x = y;x = \mtop{} \mLeftarrow{}{}\mRightarrow{} y = \mtop{})
By
Latex:
(Auto
THEN BLemma `Sierpinski-equal`
THEN Auto
THEN BLemma `not-Sierpinski-top`
THEN Auto
THEN D 0
THEN Auto
THEN ThinTrivial
THEN InstLemma `Sierpinski-unequal` []
THEN Auto)
Home
Index