Theorem atmod2i1 37012

Description: Version of modular law pmod2iN 37000 that holds in a Hilbert lattice, when one element is an atom. (Contributed by NM, 14-May-2012.) (Revised by Mario Carneiro, 10-May-2013.)

Hypotheses

Ref	Expression
atmod.b	⊢ 𝐵 = (Base‘𝐾)
atmod.l	⊢ ≤ = (le‘𝐾)
atmod.j	⊢ ∨ = (join‘𝐾)
atmod.m	⊢ ∧ = (meet‘𝐾)
atmod.a	⊢ 𝐴 = (Atoms‘𝐾)

Assertion

Ref	Expression
atmod2i1	⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ 𝑃 ≤ 𝑋) → ((𝑋 ∧ 𝑌) ∨ 𝑃) = (𝑋 ∧ (𝑌 ∨ 𝑃)))

Proof of Theorem atmod2i1

Step	Hyp	Ref	Expression
1		hllat 36514	. . . . 5 ⊢ (𝐾 ∈ HL → 𝐾 ∈ Lat)
2	1	3ad2ant1 1129	. . . 4 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ 𝑃 ≤ 𝑋) → 𝐾 ∈ Lat)
3		simp22 1203	. . . 4 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ 𝑃 ≤ 𝑋) → 𝑋 ∈ 𝐵)
4		simp23 1204	. . . 4 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ 𝑃 ≤ 𝑋) → 𝑌 ∈ 𝐵)
5		atmod.b	. . . . 5 ⊢ 𝐵 = (Base‘𝐾)
6		atmod.m	. . . . 5 ⊢ ∧ = (meet‘𝐾)
7	5, 6	latmcom 17685	. . . 4 ⊢ ((𝐾 ∈ Lat ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 ∧ 𝑌) = (𝑌 ∧ 𝑋))
8	2, 3, 4, 7	syl3anc 1367	. . 3 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ 𝑃 ≤ 𝑋) → (𝑋 ∧ 𝑌) = (𝑌 ∧ 𝑋))
9	8	oveq2d 7172	. 2 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ 𝑃 ≤ 𝑋) → (𝑃 ∨ (𝑋 ∧ 𝑌)) = (𝑃 ∨ (𝑌 ∧ 𝑋)))
10		simp21 1202	. . . 4 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ 𝑃 ≤ 𝑋) → 𝑃 ∈ 𝐴)
11		atmod.a	. . . . 5 ⊢ 𝐴 = (Atoms‘𝐾)
12	5, 11	atbase 36440	. . . 4 ⊢ (𝑃 ∈ 𝐴 → 𝑃 ∈ 𝐵)
13	10, 12	syl 17	. . 3 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ 𝑃 ≤ 𝑋) → 𝑃 ∈ 𝐵)
14	5, 6	latmcl 17662	. . . 4 ⊢ ((𝐾 ∈ Lat ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 ∧ 𝑌) ∈ 𝐵)
15	2, 3, 4, 14	syl3anc 1367	. . 3 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ 𝑃 ≤ 𝑋) → (𝑋 ∧ 𝑌) ∈ 𝐵)
16		atmod.j	. . . 4 ⊢ ∨ = (join‘𝐾)
17	5, 16	latjcom 17669	. . 3 ⊢ ((𝐾 ∈ Lat ∧ 𝑃 ∈ 𝐵 ∧ (𝑋 ∧ 𝑌) ∈ 𝐵) → (𝑃 ∨ (𝑋 ∧ 𝑌)) = ((𝑋 ∧ 𝑌) ∨ 𝑃))
18	2, 13, 15, 17	syl3anc 1367	. 2 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ 𝑃 ≤ 𝑋) → (𝑃 ∨ (𝑋 ∧ 𝑌)) = ((𝑋 ∧ 𝑌) ∨ 𝑃))
19	5, 16	latjcl 17661	. . . . 5 ⊢ ((𝐾 ∈ Lat ∧ 𝑃 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑃 ∨ 𝑌) ∈ 𝐵)
20	2, 13, 4, 19	syl3anc 1367	. . . 4 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ 𝑃 ≤ 𝑋) → (𝑃 ∨ 𝑌) ∈ 𝐵)
21	5, 6	latmcom 17685	. . . 4 ⊢ ((𝐾 ∈ Lat ∧ (𝑃 ∨ 𝑌) ∈ 𝐵 ∧ 𝑋 ∈ 𝐵) → ((𝑃 ∨ 𝑌) ∧ 𝑋) = (𝑋 ∧ (𝑃 ∨ 𝑌)))
22	2, 20, 3, 21	syl3anc 1367	. . 3 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ 𝑃 ≤ 𝑋) → ((𝑃 ∨ 𝑌) ∧ 𝑋) = (𝑋 ∧ (𝑃 ∨ 𝑌)))
23		simp1 1132	. . . 4 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ 𝑃 ≤ 𝑋) → 𝐾 ∈ HL)
24		simp3 1134	. . . 4 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ 𝑃 ≤ 𝑋) → 𝑃 ≤ 𝑋)
25		atmod.l	. . . . 5 ⊢ ≤ = (le‘𝐾)
26	5, 25, 16, 6, 11	atmod1i1 37008	. . . 4 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑌 ∈ 𝐵 ∧ 𝑋 ∈ 𝐵) ∧ 𝑃 ≤ 𝑋) → (𝑃 ∨ (𝑌 ∧ 𝑋)) = ((𝑃 ∨ 𝑌) ∧ 𝑋))
27	23, 10, 4, 3, 24, 26	syl131anc 1379	. . 3 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ 𝑃 ≤ 𝑋) → (𝑃 ∨ (𝑌 ∧ 𝑋)) = ((𝑃 ∨ 𝑌) ∧ 𝑋))
28	5, 16	latjcom 17669	. . . . 5 ⊢ ((𝐾 ∈ Lat ∧ 𝑌 ∈ 𝐵 ∧ 𝑃 ∈ 𝐵) → (𝑌 ∨ 𝑃) = (𝑃 ∨ 𝑌))
29	2, 4, 13, 28	syl3anc 1367	. . . 4 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ 𝑃 ≤ 𝑋) → (𝑌 ∨ 𝑃) = (𝑃 ∨ 𝑌))
30	29	oveq2d 7172	. . 3 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ 𝑃 ≤ 𝑋) → (𝑋 ∧ (𝑌 ∨ 𝑃)) = (𝑋 ∧ (𝑃 ∨ 𝑌)))
31	22, 27, 30	3eqtr4d 2866	. 2 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ 𝑃 ≤ 𝑋) → (𝑃 ∨ (𝑌 ∧ 𝑋)) = (𝑋 ∧ (𝑌 ∨ 𝑃)))
32	9, 18, 31	3eqtr3d 2864	1 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ 𝑃 ≤ 𝑋) → ((𝑋 ∧ 𝑌) ∨ 𝑃) = (𝑋 ∧ (𝑌 ∨ 𝑃)))

Syntax hints:   → wi 4   ∧ w3a 1083   = wceq 1537   ∈ wcel 2114   class class class wbr 5066  ‘cfv 6355  (class class class)co 7156  Basecbs 16483  lecple 16572  joincjn 17554  meetcmee 17555  Latclat 17655  Atomscatm 36414  HLchlt 36501

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 1970  ax-7 2015  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2161  ax-12 2177  ax-ext 2793  ax-rep 5190  ax-sep 5203  ax-nul 5210  ax-pow 5266  ax-pr 5330  ax-un 7461

This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1085  df-tru 1540  df-ex 1781  df-nf 1785  df-sb 2070  df-mo 2622  df-eu 2654  df-clab 2800  df-cleq 2814  df-clel 2893  df-nfc 2963  df-ne 3017  df-ral 3143  df-rex 3144  df-reu 3145  df-rab 3147  df-v 3496  df-sbc 3773  df-csb 3884  df-dif 3939  df-un 3941  df-in 3943  df-ss 3952  df-nul 4292  df-if 4468  df-pw 4541  df-sn 4568  df-pr 4570  df-op 4574  df-uni 4839  df-iun 4921  df-iin 4922  df-br 5067  df-opab 5129  df-mpt 5147  df-id 5460  df-xp 5561  df-rel 5562  df-cnv 5563  df-co 5564  df-dm 5565  df-rn 5566  df-res 5567  df-ima 5568  df-iota 6314  df-fun 6357  df-fn 6358  df-f 6359  df-f1 6360  df-fo 6361  df-f1o 6362  df-fv 6363  df-riota 7114  df-ov 7159  df-oprab 7160  df-mpo 7161  df-1st 7689  df-2nd 7690  df-proset 17538  df-poset 17556  df-plt 17568  df-lub 17584  df-glb 17585  df-join 17586  df-meet 17587  df-p0 17649  df-lat 17656  df-clat 17718  df-oposet 36327  df-ol 36329  df-oml 36330  df-covers 36417  df-ats 36418  df-atl 36449  df-cvlat 36473  df-hlat 36502  df-psubsp 36654  df-pmap 36655  df-padd 36947

This theorem is referenced by:  lhpmod6i1  37190  trljat1  37317  trljat2  37318  cdlemc1  37342  cdlemc6  37347  cdleme16b  37430  cdleme20c  37462  cdleme20j  37469  cdleme22e  37495  cdleme22eALTN  37496  cdlemkid1  38073  dihmeetlem5  38459