Theorem wcom3i 422

Description: Lemma 3(i) of Kalmbach 83 p. 23. (Contributed by NM, 13-Oct-1997.)

Hypothesis

Ref	Expression
wcom3i.1	((a ∩ (a⊥ ∪ b)) ≡ (a ∩ b)) = 1

Assertion

Ref	Expression
wcom3i	C (a, b) = 1

Proof of Theorem wcom3i

Step	Hyp	Ref	Expression
1		anor1 88	. . . . . . . . 9 (a ∩ b⊥ ) = (a⊥ ∪ b)⊥
2	1	bi1 118	. . . . . . . 8 ((a ∩ b⊥ ) ≡ (a⊥ ∪ b)⊥ ) = 1
3	2	wcon2 208	. . . . . . 7 ((a ∩ b⊥ )⊥ ≡ (a⊥ ∪ b)) = 1
4	3	wran 369	. . . . . 6 (((a ∩ b⊥ )⊥ ∩ a) ≡ ((a⊥ ∪ b) ∩ a)) = 1
5		ancom 74	. . . . . . 7 ((a⊥ ∪ b) ∩ a) = (a ∩ (a⊥ ∪ b))
6	5	bi1 118	. . . . . 6 (((a⊥ ∪ b) ∩ a) ≡ (a ∩ (a⊥ ∪ b))) = 1
7	4, 6	wr2 371	. . . . 5 (((a ∩ b⊥ )⊥ ∩ a) ≡ (a ∩ (a⊥ ∪ b))) = 1
8		wcom3i.1	. . . . 5 ((a ∩ (a⊥ ∪ b)) ≡ (a ∩ b)) = 1
9	7, 8	wr2 371	. . . 4 (((a ∩ b⊥ )⊥ ∩ a) ≡ (a ∩ b)) = 1
10	9	wlor 368	. . 3 (((a ∩ b⊥ ) ∪ ((a ∩ b⊥ )⊥ ∩ a)) ≡ ((a ∩ b⊥ ) ∪ (a ∩ b))) = 1
11		wlea 388	. . . 4 ((a ∩ b⊥ ) ≤2 a) = 1
12	11	wom4 380	. . 3 (((a ∩ b⊥ ) ∪ ((a ∩ b⊥ )⊥ ∩ a)) ≡ a) = 1
13		ax-a2 31	. . . 4 ((a ∩ b⊥ ) ∪ (a ∩ b)) = ((a ∩ b) ∪ (a ∩ b⊥ ))
14	13	bi1 118	. . 3 (((a ∩ b⊥ ) ∪ (a ∩ b)) ≡ ((a ∩ b) ∪ (a ∩ b⊥ ))) = 1
15	10, 12, 14	w3tr2 375	. 2 (a ≡ ((a ∩ b) ∪ (a ∩ b⊥ ))) = 1
16	15	wdf-c1 383	1 C (a, b) = 1

This proof depends on syntax axioms:   = wb 1  ^⊥ wn 4   ≡ tb 5   ∪ wo 6   ∩ wa 7  1wt 8   C wcmtr 29

This proof depends on axioms:  ax-a1 30  ax-a2 31  ax-a3 32  ax-a4 33  ax-a5 34  ax-r1 35  ax-r2 36  ax-r4 37  ax-r5 38  ax-wom 361

This proof depends on definitions:  df-b 39  df-a 40  df-t 41  df-f 42  df-i1 44  df-i2 45  df-le 129  df-le1 130  df-le2 131  df-cmtr 134

This theorem is used by: (None)