Theorem llnmod2i2 39845

Description: Version of modular law pmod1i 39830 that holds in a Hilbert lattice, when one element is a lattice line (expressed as the join 𝑃 ∨ 𝑄). (Contributed by NM, 16-Sep-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
llnmod2i2	⊢ (((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴) ∧ 𝑌 ≤ 𝑋) → ((𝑋 ∧ (𝑃 ∨ 𝑄)) ∨ 𝑌) = (𝑋 ∧ ((𝑃 ∨ 𝑄) ∨ 𝑌)))

Proof of Theorem llnmod2i2

Step	Hyp	Ref	Expression
1		simp11 1204	. . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴) ∧ 𝑌 ≤ 𝑋) → 𝐾 ∈ HL)
2	1	hllatd 39345	. . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴) ∧ 𝑌 ≤ 𝑋) → 𝐾 ∈ Lat)
3		simp13 1206	. . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴) ∧ 𝑌 ≤ 𝑋) → 𝑌 ∈ 𝐵)
4		simp2l 1200	. . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴) ∧ 𝑌 ≤ 𝑋) → 𝑃 ∈ 𝐴)
5		simp2r 1201	. . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴) ∧ 𝑌 ≤ 𝑋) → 𝑄 ∈ 𝐴)
6		atmod.b	. . . . . 6 ⊢ 𝐵 = (Base‘𝐾)
7		atmod.j	. . . . . 6 ⊢ ∨ = (join‘𝐾)
8		atmod.a	. . . . . 6 ⊢ 𝐴 = (Atoms‘𝐾)
9	6, 7, 8	hlatjcl 39348	. . . . 5 ⊢ ((𝐾 ∈ HL ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴) → (𝑃 ∨ 𝑄) ∈ 𝐵)
10	1, 4, 5, 9	syl3anc 1373	. . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴) ∧ 𝑌 ≤ 𝑋) → (𝑃 ∨ 𝑄) ∈ 𝐵)
11		simp12 1205	. . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴) ∧ 𝑌 ≤ 𝑋) → 𝑋 ∈ 𝐵)
12		atmod.m	. . . . 5 ⊢ ∧ = (meet‘𝐾)
13	6, 12	latmcl 18364	. . . 4 ⊢ ((𝐾 ∈ Lat ∧ (𝑃 ∨ 𝑄) ∈ 𝐵 ∧ 𝑋 ∈ 𝐵) → ((𝑃 ∨ 𝑄) ∧ 𝑋) ∈ 𝐵)
14	2, 10, 11, 13	syl3anc 1373	. . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴) ∧ 𝑌 ≤ 𝑋) → ((𝑃 ∨ 𝑄) ∧ 𝑋) ∈ 𝐵)
15	6, 7	latjcom 18371	. . 3 ⊢ ((𝐾 ∈ Lat ∧ 𝑌 ∈ 𝐵 ∧ ((𝑃 ∨ 𝑄) ∧ 𝑋) ∈ 𝐵) → (𝑌 ∨ ((𝑃 ∨ 𝑄) ∧ 𝑋)) = (((𝑃 ∨ 𝑄) ∧ 𝑋) ∨ 𝑌))
16	2, 3, 14, 15	syl3anc 1373	. 2 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴) ∧ 𝑌 ≤ 𝑋) → (𝑌 ∨ ((𝑃 ∨ 𝑄) ∧ 𝑋)) = (((𝑃 ∨ 𝑄) ∧ 𝑋) ∨ 𝑌))
17	6, 7	latjcl 18363	. . . . 5 ⊢ ((𝐾 ∈ Lat ∧ 𝑌 ∈ 𝐵 ∧ (𝑃 ∨ 𝑄) ∈ 𝐵) → (𝑌 ∨ (𝑃 ∨ 𝑄)) ∈ 𝐵)
18	2, 3, 10, 17	syl3anc 1373	. . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴) ∧ 𝑌 ≤ 𝑋) → (𝑌 ∨ (𝑃 ∨ 𝑄)) ∈ 𝐵)
19	6, 12	latmcom 18387	. . . 4 ⊢ ((𝐾 ∈ Lat ∧ 𝑋 ∈ 𝐵 ∧ (𝑌 ∨ (𝑃 ∨ 𝑄)) ∈ 𝐵) → (𝑋 ∧ (𝑌 ∨ (𝑃 ∨ 𝑄))) = ((𝑌 ∨ (𝑃 ∨ 𝑄)) ∧ 𝑋))
20	2, 11, 18, 19	syl3anc 1373	. . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴) ∧ 𝑌 ≤ 𝑋) → (𝑋 ∧ (𝑌 ∨ (𝑃 ∨ 𝑄))) = ((𝑌 ∨ (𝑃 ∨ 𝑄)) ∧ 𝑋))
21	6, 7	latjcom 18371	. . . . 5 ⊢ ((𝐾 ∈ Lat ∧ (𝑃 ∨ 𝑄) ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → ((𝑃 ∨ 𝑄) ∨ 𝑌) = (𝑌 ∨ (𝑃 ∨ 𝑄)))
22	2, 10, 3, 21	syl3anc 1373	. . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴) ∧ 𝑌 ≤ 𝑋) → ((𝑃 ∨ 𝑄) ∨ 𝑌) = (𝑌 ∨ (𝑃 ∨ 𝑄)))
23	22	oveq2d 7369	. . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴) ∧ 𝑌 ≤ 𝑋) → (𝑋 ∧ ((𝑃 ∨ 𝑄) ∨ 𝑌)) = (𝑋 ∧ (𝑌 ∨ (𝑃 ∨ 𝑄))))
24		simp3 1138	. . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴) ∧ 𝑌 ≤ 𝑋) → 𝑌 ≤ 𝑋)
25		atmod.l	. . . . 5 ⊢ ≤ = (le‘𝐾)
26	6, 25, 7, 12, 8	llnmod1i2 39842	. . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑌 ∈ 𝐵 ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴) ∧ 𝑌 ≤ 𝑋) → (𝑌 ∨ ((𝑃 ∨ 𝑄) ∧ 𝑋)) = ((𝑌 ∨ (𝑃 ∨ 𝑄)) ∧ 𝑋))
27	1, 3, 11, 4, 5, 24, 26	syl321anc 1394	. . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴) ∧ 𝑌 ≤ 𝑋) → (𝑌 ∨ ((𝑃 ∨ 𝑄) ∧ 𝑋)) = ((𝑌 ∨ (𝑃 ∨ 𝑄)) ∧ 𝑋))
28	20, 23, 27	3eqtr4d 2774	. 2 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴) ∧ 𝑌 ≤ 𝑋) → (𝑋 ∧ ((𝑃 ∨ 𝑄) ∨ 𝑌)) = (𝑌 ∨ ((𝑃 ∨ 𝑄) ∧ 𝑋)))
29	6, 12	latmcom 18387	. . . 4 ⊢ ((𝐾 ∈ Lat ∧ 𝑋 ∈ 𝐵 ∧ (𝑃 ∨ 𝑄) ∈ 𝐵) → (𝑋 ∧ (𝑃 ∨ 𝑄)) = ((𝑃 ∨ 𝑄) ∧ 𝑋))
30	2, 11, 10, 29	syl3anc 1373	. . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴) ∧ 𝑌 ≤ 𝑋) → (𝑋 ∧ (𝑃 ∨ 𝑄)) = ((𝑃 ∨ 𝑄) ∧ 𝑋))
31	30	oveq1d 7368	. 2 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴) ∧ 𝑌 ≤ 𝑋) → ((𝑋 ∧ (𝑃 ∨ 𝑄)) ∨ 𝑌) = (((𝑃 ∨ 𝑄) ∧ 𝑋) ∨ 𝑌))
32	16, 28, 31	3eqtr4rd 2775	1 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴) ∧ 𝑌 ≤ 𝑋) → ((𝑋 ∧ (𝑃 ∨ 𝑄)) ∨ 𝑌) = (𝑋 ∧ ((𝑃 ∨ 𝑄) ∨ 𝑌)))

Syntax hints:   → wi 4   ∧ wa 395   ∧ w3a 1086   = wceq 1540   ∈ wcel 2109   class class class wbr 5095  ‘cfv 6486  (class class class)co 7353  Basecbs 17138  lecple 17186  joincjn 18235  meetcmee 18236  Latclat 18355  Atomscatm 39244  HLchlt 39331

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2701  ax-rep 5221  ax-sep 5238  ax-nul 5248  ax-pow 5307  ax-pr 5374  ax-un 7675

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2533  df-eu 2562  df-clab 2708  df-cleq 2721  df-clel 2803  df-nfc 2878  df-ne 2926  df-ral 3045  df-rex 3054  df-rmo 3345  df-reu 3346  df-rab 3397  df-v 3440  df-sbc 3745  df-csb 3854  df-dif 3908  df-un 3910  df-in 3912  df-ss 3922  df-nul 4287  df-if 4479  df-pw 4555  df-sn 4580  df-pr 4582  df-op 4586  df-uni 4862  df-iun 4946  df-iin 4947  df-br 5096  df-opab 5158  df-mpt 5177  df-id 5518  df-xp 5629  df-rel 5630  df-cnv 5631  df-co 5632  df-dm 5633  df-rn 5634  df-res 5635  df-ima 5636  df-iota 6442  df-fun 6488  df-fn 6489  df-f 6490  df-f1 6491  df-fo 6492  df-f1o 6493  df-fv 6494  df-riota 7310  df-ov 7356  df-oprab 7357  df-mpo 7358  df-1st 7931  df-2nd 7932  df-proset 18218  df-poset 18237  df-plt 18252  df-lub 18268  df-glb 18269  df-join 18270  df-meet 18271  df-p0 18347  df-lat 18356  df-clat 18423  df-oposet 39157  df-ol 39159  df-oml 39160  df-covers 39247  df-ats 39248  df-atl 39279  df-cvlat 39303  df-hlat 39332  df-psubsp 39485  df-pmap 39486  df-padd 39778

This theorem is referenced by:  dalawlem11  39863