Theorem wcomd 418

Description: Commutation dual. Kalmbach 83 p. 23. (Contributed by NM, 13-Oct-1997.)

Hypothesis

Ref	Expression
wcomcom.1	C (a, b) = 1

Assertion

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

Proof of Theorem wcomd

Step	Hyp	Ref	Expression
1		wcomcom.1	. . . . 5 C (a, b) = 1
2	1	wcomcom4 417	. . . 4 C (a⊥ , b⊥ ) = 1
3	2	wdf-c2 384	. . 3 (a⊥ ≡ ((a⊥ ∩ b⊥ ) ∪ (a⊥ ∩ b⊥ ⊥ ))) = 1
4	3	wcon3 209	. 2 (a ≡ ((a⊥ ∩ b⊥ ) ∪ (a⊥ ∩ b⊥ ⊥ ))⊥ ) = 1
5		oran 87	. . . . 5 ((a⊥ ∩ b⊥ ) ∪ (a⊥ ∩ b⊥ ⊥ )) = ((a⊥ ∩ b⊥ )⊥ ∩ (a⊥ ∩ b⊥ ⊥ )⊥ )⊥
6	5	bi1 118	. . . 4 (((a⊥ ∩ b⊥ ) ∪ (a⊥ ∩ b⊥ ⊥ )) ≡ ((a⊥ ∩ b⊥ )⊥ ∩ (a⊥ ∩ b⊥ ⊥ )⊥ )⊥ ) = 1
7	6	wcon2 208	. . 3 (((a⊥ ∩ b⊥ ) ∪ (a⊥ ∩ b⊥ ⊥ ))⊥ ≡ ((a⊥ ∩ b⊥ )⊥ ∩ (a⊥ ∩ b⊥ ⊥ )⊥ )) = 1
8		oran 87	. . . . . 6 (a ∪ b) = (a⊥ ∩ b⊥ )⊥
9	8	bi1 118	. . . . 5 ((a ∪ b) ≡ (a⊥ ∩ b⊥ )⊥ ) = 1
10		oran 87	. . . . . 6 (a ∪ b⊥ ) = (a⊥ ∩ b⊥ ⊥ )⊥
11	10	bi1 118	. . . . 5 ((a ∪ b⊥ ) ≡ (a⊥ ∩ b⊥ ⊥ )⊥ ) = 1
12	9, 11	w2an 373	. . . 4 (((a ∪ b) ∩ (a ∪ b⊥ )) ≡ ((a⊥ ∩ b⊥ )⊥ ∩ (a⊥ ∩ b⊥ ⊥ )⊥ )) = 1
13	12	wr1 197	. . 3 (((a⊥ ∩ b⊥ )⊥ ∩ (a⊥ ∩ b⊥ ⊥ )⊥ ) ≡ ((a ∪ b) ∩ (a ∪ b⊥ ))) = 1
14	7, 13	wr2 371	. 2 (((a⊥ ∩ b⊥ ) ∪ (a⊥ ∩ b⊥ ⊥ ))⊥ ≡ ((a ∪ b) ∩ (a ∪ b⊥ ))) = 1
15	4, 14	wr2 371	1 (a ≡ ((a ∪ b) ∩ (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:  wcom3ii  419