Theorem nomcon5 298

Description: Lemma for "Non-Orthomodular Models..." paper.

Assertion

Ref	Expression
nomcon5	(a ≡ b) = (b⊥ ≡ a⊥ )

Proof of Theorem nomcon5

Step	Hyp	Ref	Expression
1		bicom 88	. 2 (a ≡ b) = (b ≡ a)
2		conb 114	. 2 (b ≡ a) = (b⊥ ≡ a⊥ )
3	1, 2	ax-r2 35	1 (a ≡ b) = (b⊥ ≡ a⊥ )

Syntax hints:   = wb 1  ^⊥ wn 4   ≡ tb 5

This theorem was proved from axioms:  ax-a1 29  ax-a2 30  ax-r1 34  ax-r2 35  ax-r4 36  ax-r5 37

This theorem depends on definitions:  df-b 38  df-a 39

metamath.org