Theorem atmod2i2 40677

Description: Version of modular law pmod2iN 40664 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
atmod2i2	⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ 𝑌 ≤ 𝑋) → ((𝑋 ∧ 𝑃) ∨ 𝑌) = (𝑋 ∧ (𝑃 ∨ 𝑌)))

Proof of Theorem atmod2i2

Step	Hyp	Ref	Expression
1		hllat 40178	. . . . . 6 ⊢ (𝐾 ∈ HL → 𝐾 ∈ Lat)
2	1	3ad2ant1 1151	. . . . 5 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ 𝑌 ≤ 𝑋) → 𝐾 ∈ Lat)
3		simp21 1225	. . . . . 6 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ 𝑌 ≤ 𝑋) → 𝑃 ∈ 𝐴)
4		atmod.b	. . . . . . 7 ⊢ 𝐵 = (Base‘𝐾)
5		atmod.a	. . . . . . 7 ⊢ 𝐴 = (Atoms‘𝐾)
6	4, 5	atbase 40104	. . . . . 6 ⊢ (𝑃 ∈ 𝐴 → 𝑃 ∈ 𝐵)
7	3, 6	syl 18	. . . . 5 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ 𝑌 ≤ 𝑋) → 𝑃 ∈ 𝐵)
8		simp23 1227	. . . . 5 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ 𝑌 ≤ 𝑋) → 𝑌 ∈ 𝐵)
9		atmod.j	. . . . . 6 ⊢ ∨ = (join‘𝐾)
10	4, 9	latjcom 18528	. . . . 5 ⊢ ((𝐾 ∈ Lat ∧ 𝑃 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑃 ∨ 𝑌) = (𝑌 ∨ 𝑃))
11	2, 7, 8, 10	syl3anc 1398	. . . 4 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ 𝑌 ≤ 𝑋) → (𝑃 ∨ 𝑌) = (𝑌 ∨ 𝑃))
12	11	oveq1d 7438	. . 3 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ 𝑌 ≤ 𝑋) → ((𝑃 ∨ 𝑌) ∧ 𝑋) = ((𝑌 ∨ 𝑃) ∧ 𝑋))
13		simp22 1226	. . . 4 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ 𝑌 ≤ 𝑋) → 𝑋 ∈ 𝐵)
14	4, 9	latjcl 18520	. . . . 5 ⊢ ((𝐾 ∈ Lat ∧ 𝑃 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑃 ∨ 𝑌) ∈ 𝐵)
15	2, 7, 8, 14	syl3anc 1398	. . . 4 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ 𝑌 ≤ 𝑋) → (𝑃 ∨ 𝑌) ∈ 𝐵)
16		atmod.m	. . . . 5 ⊢ ∧ = (meet‘𝐾)
17	4, 16	latmcom 18544	. . . 4 ⊢ ((𝐾 ∈ Lat ∧ 𝑋 ∈ 𝐵 ∧ (𝑃 ∨ 𝑌) ∈ 𝐵) → (𝑋 ∧ (𝑃 ∨ 𝑌)) = ((𝑃 ∨ 𝑌) ∧ 𝑋))
18	2, 13, 15, 17	syl3anc 1398	. . 3 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ 𝑌 ≤ 𝑋) → (𝑋 ∧ (𝑃 ∨ 𝑌)) = ((𝑃 ∨ 𝑌) ∧ 𝑋))
19		simp1 1154	. . . 4 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ 𝑌 ≤ 𝑋) → 𝐾 ∈ HL)
20		simp3 1156	. . . 4 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ 𝑌 ≤ 𝑋) → 𝑌 ≤ 𝑋)
21		atmod.l	. . . . 5 ⊢ ≤ = (le‘𝐾)
22	4, 21, 9, 16, 5	atmod1i2 40674	. . . 4 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑌 ∈ 𝐵 ∧ 𝑋 ∈ 𝐵) ∧ 𝑌 ≤ 𝑋) → (𝑌 ∨ (𝑃 ∧ 𝑋)) = ((𝑌 ∨ 𝑃) ∧ 𝑋))
23	19, 3, 8, 13, 20, 22	syl131anc 1410	. . 3 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ 𝑌 ≤ 𝑋) → (𝑌 ∨ (𝑃 ∧ 𝑋)) = ((𝑌 ∨ 𝑃) ∧ 𝑋))
24	12, 18, 23	3eqtr4d 2811	. 2 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ 𝑌 ≤ 𝑋) → (𝑋 ∧ (𝑃 ∨ 𝑌)) = (𝑌 ∨ (𝑃 ∧ 𝑋)))
25	4, 16	latmcl 18521	. . . 4 ⊢ ((𝐾 ∈ Lat ∧ 𝑃 ∈ 𝐵 ∧ 𝑋 ∈ 𝐵) → (𝑃 ∧ 𝑋) ∈ 𝐵)
26	2, 7, 13, 25	syl3anc 1398	. . 3 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ 𝑌 ≤ 𝑋) → (𝑃 ∧ 𝑋) ∈ 𝐵)
27	4, 9	latjcom 18528	. . 3 ⊢ ((𝐾 ∈ Lat ∧ 𝑌 ∈ 𝐵 ∧ (𝑃 ∧ 𝑋) ∈ 𝐵) → (𝑌 ∨ (𝑃 ∧ 𝑋)) = ((𝑃 ∧ 𝑋) ∨ 𝑌))
28	2, 8, 26, 27	syl3anc 1398	. 2 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ 𝑌 ≤ 𝑋) → (𝑌 ∨ (𝑃 ∧ 𝑋)) = ((𝑃 ∧ 𝑋) ∨ 𝑌))
29	4, 16	latmcom 18544	. . . 4 ⊢ ((𝐾 ∈ Lat ∧ 𝑃 ∈ 𝐵 ∧ 𝑋 ∈ 𝐵) → (𝑃 ∧ 𝑋) = (𝑋 ∧ 𝑃))
30	2, 7, 13, 29	syl3anc 1398	. . 3 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ 𝑌 ≤ 𝑋) → (𝑃 ∧ 𝑋) = (𝑋 ∧ 𝑃))
31	30	oveq1d 7438	. 2 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ 𝑌 ≤ 𝑋) → ((𝑃 ∧ 𝑋) ∨ 𝑌) = ((𝑋 ∧ 𝑃) ∨ 𝑌))
32	24, 28, 31	3eqtrrd 2806	1 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ 𝑌 ≤ 𝑋) → ((𝑋 ∧ 𝑃) ∨ 𝑌) = (𝑋 ∧ (𝑃 ∨ 𝑌)))

This proof depends on syntax axioms:   → wi 4   ∧ w3a 1103   = wceq 1570   ∈ wcel 2146   class class class wbr 5114  ‘cfv 6543  (class class class)co 7423  Basecbs 17294  lecple 17342  joincjn 18392  meetcmee 18393  Latclat 18512  Atomscatm 40078  HLchlt 40165

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2738  ax-rep 5243  ax-sep 5262  ax-nul 5274  ax-pow 5341  ax-pr 5409  ax-un 7745

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2570  df-eu 2600  df-clab 2745  df-cleq 2758  df-clel 2841  df-nfc 2915  df-ne 2962  df-ral 3083  df-rex 3093  df-rmo 3372  df-reu 3373  df-rab 3420  df-v 3460  df-sbc 3748  df-csb 3857  df-dif 3911  df-un 3913  df-in 3915  df-ss 3925  df-nul 4290  df-if 4493  df-pw 4569  df-sn 4595  df-pr 4597  df-op 4601  df-uni 4878  df-iun 4963  df-iin 4964  df-br 5115  df-opab 5179  df-mpt 5198  df-id 5561  df-xp 5672  df-rel 5673  df-cnv 5674  df-co 5675  df-dm 5676  df-rn 5677  df-res 5678  df-ima 5679  df-iota 6499  df-fun 6545  df-fn 6546  df-f 6547  df-f1 6548  df-fo 6549  df-f1o 6550  df-fv 6551  df-riota 7380  df-ov 7426  df-oprab 7427  df-mpo 7428  df-1st 7995  df-2nd 7996  df-proset 18375  df-poset 18394  df-plt 18409  df-lub 18425  df-glb 18426  df-join 18427  df-meet 18428  df-p0 18504  df-lat 18513  df-clat 18580  df-oposet 39991  df-ol 39993  df-oml 39994  df-covers 40081  df-ats 40082  df-atl 40113  df-cvlat 40137  df-hlat 40166  df-psubsp 40318  df-pmap 40319  df-padd 40611

This theorem is used by:  llnexchb2lem  40683  dalawlem2  40687  dalawlem3  40688  dalawlem11  40696  dalawlem12  40697  cdleme15b  41090