Theorem nom31 320

Description: Part of Lemma 3.3(14) from "Non-Orthomodular Models..." paper. (Contributed by NM, 7-Feb-1999.)

Assertion

Ref	Expression
nom31	((a ∩ b) ≡1 a) = (a →1 b)

Proof of Theorem nom31

Step	Hyp	Ref	Expression
1		nomb41 299	. . 3 (a ≡4 (a ∩ b)) = ((a ∩ b) ≡1 a)
2	1	ax-r1 35	. 2 ((a ∩ b) ≡1 a) = (a ≡4 (a ∩ b))
3		nom24 317	. 2 (a ≡4 (a ∩ b)) = (a →1 b)
4	2, 3	ax-r2 36	1 ((a ∩ b) ≡1 a) = (a →1 b)

Syntax hints:   = wb 1   ∩ wa 7   →₁ wi1 12   ≡₁ wid1 18   ≡₄ wid4 21

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

This theorem depends on definitions:  df-a 40  df-t 41  df-f 42  df-i1 44  df-id1 50  df-id4 53  df-le1 130  df-le2 131

This theorem is referenced by: (None)