Theorem omllaw3 39444

Description: Orthomodular law equivalent. Theorem 2(ii) of [Kalmbach] p. 22. (pjoml 31460 analog.) (Contributed by NM, 19-Oct-2011.)

Hypotheses

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

Assertion

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

Proof of Theorem omllaw3

Step	Hyp	Ref	Expression
1		oveq2 7364	. . . . . 6 ⊢ ((𝑌 ∧ ( ⊥ ‘𝑋)) = 0 → (𝑋(join‘𝐾)(𝑌 ∧ ( ⊥ ‘𝑋))) = (𝑋(join‘𝐾) 0 ))
2	1	adantl 481	. . . . 5 ⊢ (((𝐾 ∈ OML ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ (𝑌 ∧ ( ⊥ ‘𝑋)) = 0 ) → (𝑋(join‘𝐾)(𝑌 ∧ ( ⊥ ‘𝑋))) = (𝑋(join‘𝐾) 0 ))
3		omlol 39439	. . . . . . . 8 ⊢ (𝐾 ∈ OML → 𝐾 ∈ OL)
4		omllaw3.b	. . . . . . . . 9 ⊢ 𝐵 = (Base‘𝐾)
5		eqid 2734	. . . . . . . . 9 ⊢ (join‘𝐾) = (join‘𝐾)
6		omllaw3.z	. . . . . . . . 9 ⊢ 0 = (0.‘𝐾)
7	4, 5, 6	olj01 39424	. . . . . . . 8 ⊢ ((𝐾 ∈ OL ∧ 𝑋 ∈ 𝐵) → (𝑋(join‘𝐾) 0 ) = 𝑋)
8	3, 7	sylan 580	. . . . . . 7 ⊢ ((𝐾 ∈ OML ∧ 𝑋 ∈ 𝐵) → (𝑋(join‘𝐾) 0 ) = 𝑋)
9	8	3adant3 1132	. . . . . 6 ⊢ ((𝐾 ∈ OML ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋(join‘𝐾) 0 ) = 𝑋)
10	9	adantr 480	. . . . 5 ⊢ (((𝐾 ∈ OML ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ (𝑌 ∧ ( ⊥ ‘𝑋)) = 0 ) → (𝑋(join‘𝐾) 0 ) = 𝑋)
11	2, 10	eqtr2d 2770	. . . 4 ⊢ (((𝐾 ∈ OML ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ (𝑌 ∧ ( ⊥ ‘𝑋)) = 0 ) → 𝑋 = (𝑋(join‘𝐾)(𝑌 ∧ ( ⊥ ‘𝑋))))
12	11	adantrl 716	. . 3 ⊢ (((𝐾 ∈ OML ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ (𝑋 ≤ 𝑌 ∧ (𝑌 ∧ ( ⊥ ‘𝑋)) = 0 )) → 𝑋 = (𝑋(join‘𝐾)(𝑌 ∧ ( ⊥ ‘𝑋))))
13		omllaw3.l	. . . . . 6 ⊢ ≤ = (le‘𝐾)
14		omllaw3.m	. . . . . 6 ⊢ ∧ = (meet‘𝐾)
15		omllaw3.o	. . . . . 6 ⊢ ⊥ = (oc‘𝐾)
16	4, 13, 5, 14, 15	omllaw 39442	. . . . 5 ⊢ ((𝐾 ∈ OML ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 ≤ 𝑌 → 𝑌 = (𝑋(join‘𝐾)(𝑌 ∧ ( ⊥ ‘𝑋)))))
17	16	imp 406	. . . 4 ⊢ (((𝐾 ∈ OML ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ 𝑋 ≤ 𝑌) → 𝑌 = (𝑋(join‘𝐾)(𝑌 ∧ ( ⊥ ‘𝑋))))
18	17	adantrr 717	. . 3 ⊢ (((𝐾 ∈ OML ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ (𝑋 ≤ 𝑌 ∧ (𝑌 ∧ ( ⊥ ‘𝑋)) = 0 )) → 𝑌 = (𝑋(join‘𝐾)(𝑌 ∧ ( ⊥ ‘𝑋))))
19	12, 18	eqtr4d 2772	. 2 ⊢ (((𝐾 ∈ OML ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ (𝑋 ≤ 𝑌 ∧ (𝑌 ∧ ( ⊥ ‘𝑋)) = 0 )) → 𝑋 = 𝑌)
20	19	ex 412	1 ⊢ ((𝐾 ∈ OML ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → ((𝑋 ≤ 𝑌 ∧ (𝑌 ∧ ( ⊥ ‘𝑋)) = 0 ) → 𝑋 = 𝑌))

Syntax hints:   → wi 4   ∧ wa 395   ∧ w3a 1086   = wceq 1541   ∈ wcel 2113   class class class wbr 5096  ‘cfv 6490  (class class class)co 7356  Basecbs 17134  lecple 17182  occoc 17183  joincjn 18232  meetcmee 18233  0.cp0 18342  OLcol 39373  OMLcoml 39374

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-10 2146  ax-11 2162  ax-12 2182  ax-ext 2706  ax-rep 5222  ax-sep 5239  ax-nul 5249  ax-pow 5308  ax-pr 5375  ax-un 7678

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2537  df-eu 2567  df-clab 2713  df-cleq 2726  df-clel 2809  df-nfc 2883  df-ne 2931  df-ral 3050  df-rex 3059  df-rmo 3348  df-reu 3349  df-rab 3398  df-v 3440  df-sbc 3739  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4284  df-if 4478  df-pw 4554  df-sn 4579  df-pr 4581  df-op 4585  df-uni 4862  df-iun 4946  df-br 5097  df-opab 5159  df-mpt 5178  df-id 5517  df-xp 5628  df-rel 5629  df-cnv 5630  df-co 5631  df-dm 5632  df-rn 5633  df-res 5634  df-ima 5635  df-iota 6446  df-fun 6492  df-fn 6493  df-f 6494  df-f1 6495  df-fo 6496  df-f1o 6497  df-fv 6498  df-riota 7313  df-ov 7359  df-oprab 7360  df-proset 18215  df-poset 18234  df-lub 18265  df-glb 18266  df-join 18267  df-meet 18268  df-p0 18344  df-lat 18353  df-oposet 39375  df-ol 39377  df-oml 39378

This theorem is referenced by:  omlfh1N  39457  atlatmstc  39518