Theorem nom35 316

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

Assertion

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

Proof of Theorem nom35

Step	Hyp	Ref	Expression
1		bicom 88	. 2 ((a ∩ b) ≡ a) = (a ≡ (a ∩ b))
2		nom25 310	. 2 (a ≡ (a ∩ b)) = (a →1 b)
3	1, 2	ax-r2 35	1 ((a ∩ b) ≡ a) = (a →1 b)

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

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

metamath.org