pmapjat2 - Mathbox for Norm Megill

	Mathbox for Norm Megill		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > Mathboxes > pmapjat2		Structured version Visualization version GIF version

Theorem pmapjat2 39819

Description: The projective map of the join of an atom with a lattice element. (Contributed by NM, 12-May-2012.)

**Hypotheses**
Ref	Expression
pmapjat.b	⊢ 𝐵 = (Base‘𝐾)
pmapjat.j	⊢ ∨ = (join‘𝐾)
pmapjat.a	⊢ 𝐴 = (Atoms‘𝐾)
pmapjat.m	⊢ 𝑀 = (pmap‘𝐾)
pmapjat.p	⊢ + = (+_𝑃‘𝐾)

**Assertion**
Ref	Expression
pmapjat2	⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑄 ∈ 𝐴) → (𝑀‘(𝑄 ∨ 𝑋)) = ((𝑀‘𝑄) + (𝑀‘𝑋)))

**Proof of Theorem pmapjat2**
Step	Hyp	Ref	Expression
1		pmapjat.b	. . 3 ⊢ 𝐵 = (Base‘𝐾)
2		pmapjat.j	. . 3 ⊢ ∨ = (join‘𝐾)
3		pmapjat.a	. . 3 ⊢ 𝐴 = (Atoms‘𝐾)
4		pmapjat.m	. . 3 ⊢ 𝑀 = (pmap‘𝐾)
5		pmapjat.p	. . 3 ⊢ + = (+_𝑃‘𝐾)
6	1, 2, 3, 4, 5	pmapjat1 39818	. 2 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑄 ∈ 𝐴) → (𝑀‘(𝑋 ∨ 𝑄)) = ((𝑀‘𝑋) + (𝑀‘𝑄)))
7		hllat 39327	. . . . 5 ⊢ (𝐾 ∈ HL → 𝐾 ∈ Lat)
8	7	3ad2ant1 1133	. . . 4 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑄 ∈ 𝐴) → 𝐾 ∈ Lat)
9	1, 3	atbase 39253	. . . . 5 ⊢ (𝑄 ∈ 𝐴 → 𝑄 ∈ 𝐵)
10	9	3ad2ant3 1135	. . . 4 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑄 ∈ 𝐴) → 𝑄 ∈ 𝐵)
11		simp2 1137	. . . 4 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑄 ∈ 𝐴) → 𝑋 ∈ 𝐵)
12	1, 2	latjcom 18455	. . . 4 ⊢ ((𝐾 ∈ Lat ∧ 𝑄 ∈ 𝐵 ∧ 𝑋 ∈ 𝐵) → (𝑄 ∨ 𝑋) = (𝑋 ∨ 𝑄))
13	8, 10, 11, 12	syl3anc 1373	. . 3 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑄 ∈ 𝐴) → (𝑄 ∨ 𝑋) = (𝑋 ∨ 𝑄))
14	13	fveq2d 6879	. 2 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑄 ∈ 𝐴) → (𝑀‘(𝑄 ∨ 𝑋)) = (𝑀‘(𝑋 ∨ 𝑄)))
15		simp1 1136	. . . 4 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑄 ∈ 𝐴) → 𝐾 ∈ HL)
16	1, 3, 4	pmapssat 39724	. . . 4 ⊢ ((𝐾 ∈ HL ∧ 𝑄 ∈ 𝐵) → (𝑀‘𝑄) ⊆ 𝐴)
17	15, 10, 16	syl2anc 584	. . 3 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑄 ∈ 𝐴) → (𝑀‘𝑄) ⊆ 𝐴)
18	1, 3, 4	pmapssat 39724	. . . 4 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵) → (𝑀‘𝑋) ⊆ 𝐴)
19	18	3adant3 1132	. . 3 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑄 ∈ 𝐴) → (𝑀‘𝑋) ⊆ 𝐴)
20	3, 5	paddcom 39778	. . 3 ⊢ ((𝐾 ∈ Lat ∧ (𝑀‘𝑄) ⊆ 𝐴 ∧ (𝑀‘𝑋) ⊆ 𝐴) → ((𝑀‘𝑄) + (𝑀‘𝑋)) = ((𝑀‘𝑋) + (𝑀‘𝑄)))
21	8, 17, 19, 20	syl3anc 1373	. 2 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑄 ∈ 𝐴) → ((𝑀‘𝑄) + (𝑀‘𝑋)) = ((𝑀‘𝑋) + (𝑀‘𝑄)))
22	6, 14, 21	3eqtr4d 2780	1 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑄 ∈ 𝐴) → (𝑀‘(𝑄 ∨ 𝑋)) = ((𝑀‘𝑄) + (𝑀‘𝑋)))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ w3a 1086 = wceq 1540 ∈ wcel 2108 ⊆ wss 3926 ‘cfv 6530 (class class class)co 7403 Basecbs 17226 joincjn 18321 Latclat 18439 Atomscatm 39227 HLchlt 39314 pmapcpmap 39462 +_𝑃cpadd 39760

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 2007 ax-8 2110 ax-9 2118 ax-10 2141 ax-11 2157 ax-12 2177 ax-ext 2707 ax-rep 5249 ax-sep 5266 ax-nul 5276 ax-pow 5335 ax-pr 5402 ax-un 7727

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 2065 df-mo 2539 df-eu 2568 df-clab 2714 df-cleq 2727 df-clel 2809 df-nfc 2885 df-ne 2933 df-ral 3052 df-rex 3061 df-rmo 3359 df-reu 3360 df-rab 3416 df-v 3461 df-sbc 3766 df-csb 3875 df-dif 3929 df-un 3931 df-in 3933 df-ss 3943 df-nul 4309 df-if 4501 df-pw 4577 df-sn 4602 df-pr 4604 df-op 4608 df-uni 4884 df-iun 4969 df-br 5120 df-opab 5182 df-mpt 5202 df-id 5548 df-xp 5660 df-rel 5661 df-cnv 5662 df-co 5663 df-dm 5664 df-rn 5665 df-res 5666 df-ima 5667 df-iota 6483 df-fun 6532 df-fn 6533 df-f 6534 df-f1 6535 df-fo 6536 df-f1o 6537 df-fv 6538 df-riota 7360 df-ov 7406 df-oprab 7407 df-mpo 7408 df-1st 7986 df-2nd 7987 df-proset 18304 df-poset 18323 df-plt 18338 df-lub 18354 df-glb 18355 df-join 18356 df-meet 18357 df-p0 18433 df-lat 18440 df-clat 18507 df-oposet 39140 df-ol 39142 df-oml 39143 df-covers 39230 df-ats 39231 df-atl 39262 df-cvlat 39286 df-hlat 39315 df-pmap 39469 df-padd 39761

This theorem is referenced by: atmod1i1 39822

W3C validator