Theorem omllaw4 37260

Description: Orthomodular law equivalent. Remark in [Holland95] p. 223. (Contributed by NM, 19-Oct-2011.)

Hypotheses

Ref	Expression
omllaw4.b	⊢ 𝐵 = (Base‘𝐾)
omllaw4.l	⊢ ≤ = (le‘𝐾)
omllaw4.m	⊢ ∧ = (meet‘𝐾)
omllaw4.o	⊢ ⊥ = (oc‘𝐾)

Assertion

Ref	Expression
omllaw4	⊢ ((𝐾 ∈ OML ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 ≤ 𝑌 → (( ⊥ ‘(( ⊥ ‘𝑋) ∧ 𝑌)) ∧ 𝑌) = 𝑋))

Proof of Theorem omllaw4

Step	Hyp	Ref	Expression
1		simp1 1135	. . 3 ⊢ ((𝐾 ∈ OML ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → 𝐾 ∈ OML)
2		omlop 37255	. . . . 5 ⊢ (𝐾 ∈ OML → 𝐾 ∈ OP)
3	2	3ad2ant1 1132	. . . 4 ⊢ ((𝐾 ∈ OML ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → 𝐾 ∈ OP)
4		simp3 1137	. . . 4 ⊢ ((𝐾 ∈ OML ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → 𝑌 ∈ 𝐵)
5		omllaw4.b	. . . . 5 ⊢ 𝐵 = (Base‘𝐾)
6		omllaw4.o	. . . . 5 ⊢ ⊥ = (oc‘𝐾)
7	5, 6	opoccl 37208	. . . 4 ⊢ ((𝐾 ∈ OP ∧ 𝑌 ∈ 𝐵) → ( ⊥ ‘𝑌) ∈ 𝐵)
8	3, 4, 7	syl2anc 584	. . 3 ⊢ ((𝐾 ∈ OML ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → ( ⊥ ‘𝑌) ∈ 𝐵)
9		simp2 1136	. . . 4 ⊢ ((𝐾 ∈ OML ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → 𝑋 ∈ 𝐵)
10	5, 6	opoccl 37208	. . . 4 ⊢ ((𝐾 ∈ OP ∧ 𝑋 ∈ 𝐵) → ( ⊥ ‘𝑋) ∈ 𝐵)
11	3, 9, 10	syl2anc 584	. . 3 ⊢ ((𝐾 ∈ OML ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → ( ⊥ ‘𝑋) ∈ 𝐵)
12		omllaw4.l	. . . 4 ⊢ ≤ = (le‘𝐾)
13		eqid 2738	. . . 4 ⊢ (join‘𝐾) = (join‘𝐾)
14		omllaw4.m	. . . 4 ⊢ ∧ = (meet‘𝐾)
15	5, 12, 13, 14, 6	omllaw 37257	. . 3 ⊢ ((𝐾 ∈ OML ∧ ( ⊥ ‘𝑌) ∈ 𝐵 ∧ ( ⊥ ‘𝑋) ∈ 𝐵) → (( ⊥ ‘𝑌) ≤ ( ⊥ ‘𝑋) → ( ⊥ ‘𝑋) = (( ⊥ ‘𝑌)(join‘𝐾)(( ⊥ ‘𝑋) ∧ ( ⊥ ‘( ⊥ ‘𝑌))))))
16	1, 8, 11, 15	syl3anc 1370	. 2 ⊢ ((𝐾 ∈ OML ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (( ⊥ ‘𝑌) ≤ ( ⊥ ‘𝑋) → ( ⊥ ‘𝑋) = (( ⊥ ‘𝑌)(join‘𝐾)(( ⊥ ‘𝑋) ∧ ( ⊥ ‘( ⊥ ‘𝑌))))))
17	5, 12, 6	oplecon3b 37214	. . 3 ⊢ ((𝐾 ∈ OP ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 ≤ 𝑌 ↔ ( ⊥ ‘𝑌) ≤ ( ⊥ ‘𝑋)))
18	2, 17	syl3an1 1162	. 2 ⊢ ((𝐾 ∈ OML ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 ≤ 𝑌 ↔ ( ⊥ ‘𝑌) ≤ ( ⊥ ‘𝑋)))
19		omllat 37256	. . . . . 6 ⊢ (𝐾 ∈ OML → 𝐾 ∈ Lat)
20	19	3ad2ant1 1132	. . . . 5 ⊢ ((𝐾 ∈ OML ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → 𝐾 ∈ Lat)
21	5, 14	latmcl 18158	. . . . . . 7 ⊢ ((𝐾 ∈ Lat ∧ ( ⊥ ‘𝑋) ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (( ⊥ ‘𝑋) ∧ 𝑌) ∈ 𝐵)
22	20, 11, 4, 21	syl3anc 1370	. . . . . 6 ⊢ ((𝐾 ∈ OML ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (( ⊥ ‘𝑋) ∧ 𝑌) ∈ 𝐵)
23	5, 6	opoccl 37208	. . . . . 6 ⊢ ((𝐾 ∈ OP ∧ (( ⊥ ‘𝑋) ∧ 𝑌) ∈ 𝐵) → ( ⊥ ‘(( ⊥ ‘𝑋) ∧ 𝑌)) ∈ 𝐵)
24	3, 22, 23	syl2anc 584	. . . . 5 ⊢ ((𝐾 ∈ OML ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → ( ⊥ ‘(( ⊥ ‘𝑋) ∧ 𝑌)) ∈ 𝐵)
25	5, 14	latmcl 18158	. . . . 5 ⊢ ((𝐾 ∈ Lat ∧ ( ⊥ ‘(( ⊥ ‘𝑋) ∧ 𝑌)) ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (( ⊥ ‘(( ⊥ ‘𝑋) ∧ 𝑌)) ∧ 𝑌) ∈ 𝐵)
26	20, 24, 4, 25	syl3anc 1370	. . . 4 ⊢ ((𝐾 ∈ OML ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (( ⊥ ‘(( ⊥ ‘𝑋) ∧ 𝑌)) ∧ 𝑌) ∈ 𝐵)
27	5, 6	opcon3b 37210	. . . 4 ⊢ ((𝐾 ∈ OP ∧ (( ⊥ ‘(( ⊥ ‘𝑋) ∧ 𝑌)) ∧ 𝑌) ∈ 𝐵 ∧ 𝑋 ∈ 𝐵) → ((( ⊥ ‘(( ⊥ ‘𝑋) ∧ 𝑌)) ∧ 𝑌) = 𝑋 ↔ ( ⊥ ‘𝑋) = ( ⊥ ‘(( ⊥ ‘(( ⊥ ‘𝑋) ∧ 𝑌)) ∧ 𝑌))))
28	3, 26, 9, 27	syl3anc 1370	. . 3 ⊢ ((𝐾 ∈ OML ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → ((( ⊥ ‘(( ⊥ ‘𝑋) ∧ 𝑌)) ∧ 𝑌) = 𝑋 ↔ ( ⊥ ‘𝑋) = ( ⊥ ‘(( ⊥ ‘(( ⊥ ‘𝑋) ∧ 𝑌)) ∧ 𝑌))))
29	5, 13	latjcom 18165	. . . . . 6 ⊢ ((𝐾 ∈ Lat ∧ (( ⊥ ‘𝑋) ∧ 𝑌) ∈ 𝐵 ∧ ( ⊥ ‘𝑌) ∈ 𝐵) → ((( ⊥ ‘𝑋) ∧ 𝑌)(join‘𝐾)( ⊥ ‘𝑌)) = (( ⊥ ‘𝑌)(join‘𝐾)(( ⊥ ‘𝑋) ∧ 𝑌)))
30	20, 22, 8, 29	syl3anc 1370	. . . . 5 ⊢ ((𝐾 ∈ OML ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → ((( ⊥ ‘𝑋) ∧ 𝑌)(join‘𝐾)( ⊥ ‘𝑌)) = (( ⊥ ‘𝑌)(join‘𝐾)(( ⊥ ‘𝑋) ∧ 𝑌)))
31		omlol 37254	. . . . . . 7 ⊢ (𝐾 ∈ OML → 𝐾 ∈ OL)
32	31	3ad2ant1 1132	. . . . . 6 ⊢ ((𝐾 ∈ OML ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → 𝐾 ∈ OL)
33	5, 13, 14, 6	oldmm2 37232	. . . . . 6 ⊢ ((𝐾 ∈ OL ∧ (( ⊥ ‘𝑋) ∧ 𝑌) ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → ( ⊥ ‘(( ⊥ ‘(( ⊥ ‘𝑋) ∧ 𝑌)) ∧ 𝑌)) = ((( ⊥ ‘𝑋) ∧ 𝑌)(join‘𝐾)( ⊥ ‘𝑌)))
34	32, 22, 4, 33	syl3anc 1370	. . . . 5 ⊢ ((𝐾 ∈ OML ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → ( ⊥ ‘(( ⊥ ‘(( ⊥ ‘𝑋) ∧ 𝑌)) ∧ 𝑌)) = ((( ⊥ ‘𝑋) ∧ 𝑌)(join‘𝐾)( ⊥ ‘𝑌)))
35	5, 6	opococ 37209	. . . . . . . 8 ⊢ ((𝐾 ∈ OP ∧ 𝑌 ∈ 𝐵) → ( ⊥ ‘( ⊥ ‘𝑌)) = 𝑌)
36	3, 4, 35	syl2anc 584	. . . . . . 7 ⊢ ((𝐾 ∈ OML ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → ( ⊥ ‘( ⊥ ‘𝑌)) = 𝑌)
37	36	oveq2d 7291	. . . . . 6 ⊢ ((𝐾 ∈ OML ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (( ⊥ ‘𝑋) ∧ ( ⊥ ‘( ⊥ ‘𝑌))) = (( ⊥ ‘𝑋) ∧ 𝑌))
38	37	oveq2d 7291	. . . . 5 ⊢ ((𝐾 ∈ OML ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (( ⊥ ‘𝑌)(join‘𝐾)(( ⊥ ‘𝑋) ∧ ( ⊥ ‘( ⊥ ‘𝑌)))) = (( ⊥ ‘𝑌)(join‘𝐾)(( ⊥ ‘𝑋) ∧ 𝑌)))
39	30, 34, 38	3eqtr4d 2788	. . . 4 ⊢ ((𝐾 ∈ OML ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → ( ⊥ ‘(( ⊥ ‘(( ⊥ ‘𝑋) ∧ 𝑌)) ∧ 𝑌)) = (( ⊥ ‘𝑌)(join‘𝐾)(( ⊥ ‘𝑋) ∧ ( ⊥ ‘( ⊥ ‘𝑌)))))
40	39	eqeq2d 2749	. . 3 ⊢ ((𝐾 ∈ OML ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (( ⊥ ‘𝑋) = ( ⊥ ‘(( ⊥ ‘(( ⊥ ‘𝑋) ∧ 𝑌)) ∧ 𝑌)) ↔ ( ⊥ ‘𝑋) = (( ⊥ ‘𝑌)(join‘𝐾)(( ⊥ ‘𝑋) ∧ ( ⊥ ‘( ⊥ ‘𝑌))))))
41	28, 40	bitrd 278	. 2 ⊢ ((𝐾 ∈ OML ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → ((( ⊥ ‘(( ⊥ ‘𝑋) ∧ 𝑌)) ∧ 𝑌) = 𝑋 ↔ ( ⊥ ‘𝑋) = (( ⊥ ‘𝑌)(join‘𝐾)(( ⊥ ‘𝑋) ∧ ( ⊥ ‘( ⊥ ‘𝑌))))))
42	16, 18, 41	3imtr4d 294	1 ⊢ ((𝐾 ∈ OML ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 ≤ 𝑌 → (( ⊥ ‘(( ⊥ ‘𝑋) ∧ 𝑌)) ∧ 𝑌) = 𝑋))

Syntax hints:   → wi 4   ↔ wb 205   ∧ w3a 1086   = wceq 1539   ∈ wcel 2106   class class class wbr 5074  ‘cfv 6433  (class class class)co 7275  Basecbs 16912  lecple 16969  occoc 16970  joincjn 18029  meetcmee 18030  Latclat 18149  OPcops 37186  OLcol 37188  OMLcoml 37189

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2709  ax-rep 5209  ax-sep 5223  ax-nul 5230  ax-pow 5288  ax-pr 5352  ax-un 7588

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-3an 1088  df-tru 1542  df-fal 1552  df-ex 1783  df-nf 1787  df-sb 2068  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2816  df-nfc 2889  df-ne 2944  df-ral 3069  df-rex 3070  df-reu 3072  df-rab 3073  df-v 3434  df-sbc 3717  df-csb 3833  df-dif 3890  df-un 3892  df-in 3894  df-ss 3904  df-nul 4257  df-if 4460  df-pw 4535  df-sn 4562  df-pr 4564  df-op 4568  df-uni 4840  df-iun 4926  df-br 5075  df-opab 5137  df-mpt 5158  df-id 5489  df-xp 5595  df-rel 5596  df-cnv 5597  df-co 5598  df-dm 5599  df-rn 5600  df-res 5601  df-ima 5602  df-iota 6391  df-fun 6435  df-fn 6436  df-f 6437  df-f1 6438  df-fo 6439  df-f1o 6440  df-fv 6441  df-riota 7232  df-ov 7278  df-oprab 7279  df-proset 18013  df-poset 18031  df-lub 18064  df-glb 18065  df-join 18066  df-meet 18067  df-lat 18150  df-oposet 37190  df-ol 37192  df-oml 37193

This theorem is referenced by:  poml4N  37967  dihoml4c  39390