Theorem nom11 300

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

Assertion

Ref	Expression
nom11	(a →1 (a ∩ b)) = (a →1 b)

Proof of Theorem nom11

Step	Hyp	Ref	Expression
1		anass 69	. . . . 5 ((a ∩ a) ∩ b) = (a ∩ (a ∩ b))
2	1	ax-r1 34	. . . 4 (a ∩ (a ∩ b)) = ((a ∩ a) ∩ b)
3		anidm 103	. . . . 5 (a ∩ a) = a
4	3	ran 71	. . . 4 ((a ∩ a) ∩ b) = (a ∩ b)
5	2, 4	ax-r2 35	. . 3 (a ∩ (a ∩ b)) = (a ∩ b)
6	5	lor 66	. 2 (a⊥ ∪ (a ∩ (a ∩ b))) = (a⊥ ∪ (a ∩ b))
7		df-i1 43	. 2 (a →1 (a ∩ b)) = (a⊥ ∪ (a ∩ (a ∩ b)))
8		df-i1 43	. 2 (a →1 b) = (a⊥ ∪ (a ∩ b))
9	6, 7, 8	3tr1 60	1 (a →1 (a ∩ b)) = (a →1 b)

Syntax hints:   = wb 1  ^⊥ wn 4   ∪ wo 6   ∩ wa 7   →₁ wi1 13

This theorem is referenced by:  nom42 319

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

metamath.org