Theorem wom5 363

Description: Orthomodular law. Kalmbach 83 p. 22.

Hypotheses

Ref	Expression
wom5.1	(a ≤2 b) = 1
wom5.2	((b ∩ a⊥ ) ≡ 0) = 1

Assertion

Ref	Expression
wom5	(a ≡ b) = 1

Proof of Theorem wom5

Step	Hyp	Ref	Expression
1		wom5.2	. . . . 5 ((b ∩ a⊥ ) ≡ 0) = 1
2	1	wr1 189	. . . 4 (0 ≡ (b ∩ a⊥ )) = 1
3		ancom 68	. . . . 5 (b ∩ a⊥ ) = (a⊥ ∩ b)
4	3	bi1 110	. . . 4 ((b ∩ a⊥ ) ≡ (a⊥ ∩ b)) = 1
5	2, 4	wr2 353	. . 3 (0 ≡ (a⊥ ∩ b)) = 1
6	5	wlor 350	. 2 ((a ∪ 0) ≡ (a ∪ (a⊥ ∩ b))) = 1
7		or0 94	. . 3 (a ∪ 0) = a
8	7	bi1 110	. 2 ((a ∪ 0) ≡ a) = 1
9		wom5.1	. . 3 (a ≤2 b) = 1
10	9	wom4 362	. 2 ((a ∪ (a⊥ ∩ b)) ≡ b) = 1
11	6, 8, 10	w3tr2 357	1 (a ≡ b) = 1

Syntax hints:   = wb 1  ^⊥ wn 4   ≡ tb 5   ∪ wo 6   ∩ wa 7  1wt 9  0wf 10   ≤₂ wle2 11

This theorem is referenced by:  wfh1 405  wfh2 406

This theorem was proved from axioms:  ax-a1 29  ax-a2 30  ax-a3 31  ax-a4 32  ax-a5 33  ax-r1 34  ax-r2 35  ax-r4 36  ax-r5 37  ax-wom 343

This theorem depends on definitions:  df-b 38  df-a 39  df-t 40  df-f 41  df-i1 43  df-i2 44  df-le 121  df-le1 122  df-le2 123

metamath.org