Theorem nom65 334

Description: Part of Lemma 3.3(15) from "Non-Orthomodular Models..." paper.

Assertion

Ref	Expression
nom65	(b ≡ (a ∪ b)) = (a →2 b)

Proof of Theorem nom65

Step	Hyp	Ref	Expression
1		bicom 88	. 2 (b ≡ (a ∪ b)) = ((a ∪ b) ≡ b)
2		nom55 328	. 2 ((a ∪ b) ≡ b) = (a →2 b)
3	1, 2	ax-r2 35	1 (b ≡ (a ∪ b)) = (a →2 b)

Syntax hints:   = wb 1   ≡ tb 5   ∪ wo 6   →₂ wi2 14

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

This theorem depends on definitions:  df-b 38  df-a 39  df-t 40  df-f 41  df-i1 43  df-i2 44

metamath.org