Theorem nom35 324

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

Assertion

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

Proof of Theorem nom35

Step	Hyp	Ref	Expression
1		bicom 96	. 2 ((a ∩ b) ≡ a) = (a ≡ (a ∩ b))
2		nom25 318	. 2 (a ≡ (a ∩ b)) = (a →1 b)
3	1, 2	ax-r2 36	1 ((a ∩ b) ≡ a) = (a →1 b)

Syntax hints:   = wb 1   ≡ tb 5   ∩ wa 7   →₁ wi1 12

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-b 39  df-a 40  df-t 41  df-f 42  df-i1 44

This theorem is referenced by: (None)