Theorem pmaple 39726

Description: The projective map of a Hilbert lattice preserves ordering. Part of Theorem 15.5 of [MaedaMaeda] p. 62. (Contributed by NM, 22-Oct-2011.)

Hypotheses

Ref	Expression
pmaple.b	⊢ 𝐵 = (Base‘𝐾)
pmaple.l	⊢ ≤ = (le‘𝐾)
pmaple.m	⊢ 𝑀 = (pmap‘𝐾)

Assertion

Ref	Expression
pmaple	⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 ≤ 𝑌 ↔ (𝑀‘𝑋) ⊆ (𝑀‘𝑌)))

Proof of Theorem pmaple

Dummy variable 𝑝 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		hlpos 39330	. . . . 5 ⊢ (𝐾 ∈ HL → 𝐾 ∈ Poset)
2		pmaple.b	. . . . . . . . . 10 ⊢ 𝐵 = (Base‘𝐾)
3		eqid 2735	. . . . . . . . . 10 ⊢ (Atoms‘𝐾) = (Atoms‘𝐾)
4	2, 3	atbase 39253	. . . . . . . . 9 ⊢ (𝑝 ∈ (Atoms‘𝐾) → 𝑝 ∈ 𝐵)
5		pmaple.l	. . . . . . . . . . . . . . 15 ⊢ ≤ = (le‘𝐾)
6	2, 5	postr 18330	. . . . . . . . . . . . . 14 ⊢ ((𝐾 ∈ Poset ∧ (𝑝 ∈ 𝐵 ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → ((𝑝 ≤ 𝑋 ∧ 𝑋 ≤ 𝑌) → 𝑝 ≤ 𝑌))
7	6	exp4b 430	. . . . . . . . . . . . 13 ⊢ (𝐾 ∈ Poset → ((𝑝 ∈ 𝐵 ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑝 ≤ 𝑋 → (𝑋 ≤ 𝑌 → 𝑝 ≤ 𝑌))))
8	7	3expd 1354	. . . . . . . . . . . 12 ⊢ (𝐾 ∈ Poset → (𝑝 ∈ 𝐵 → (𝑋 ∈ 𝐵 → (𝑌 ∈ 𝐵 → (𝑝 ≤ 𝑋 → (𝑋 ≤ 𝑌 → 𝑝 ≤ 𝑌))))))
9	8	com23 86	. . . . . . . . . . 11 ⊢ (𝐾 ∈ Poset → (𝑋 ∈ 𝐵 → (𝑝 ∈ 𝐵 → (𝑌 ∈ 𝐵 → (𝑝 ≤ 𝑋 → (𝑋 ≤ 𝑌 → 𝑝 ≤ 𝑌))))))
10	9	com34 91	. . . . . . . . . 10 ⊢ (𝐾 ∈ Poset → (𝑋 ∈ 𝐵 → (𝑌 ∈ 𝐵 → (𝑝 ∈ 𝐵 → (𝑝 ≤ 𝑋 → (𝑋 ≤ 𝑌 → 𝑝 ≤ 𝑌))))))
11	10	3imp 1110	. . . . . . . . 9 ⊢ ((𝐾 ∈ Poset ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑝 ∈ 𝐵 → (𝑝 ≤ 𝑋 → (𝑋 ≤ 𝑌 → 𝑝 ≤ 𝑌))))
12	4, 11	syl5 34	. . . . . . . 8 ⊢ ((𝐾 ∈ Poset ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑝 ∈ (Atoms‘𝐾) → (𝑝 ≤ 𝑋 → (𝑋 ≤ 𝑌 → 𝑝 ≤ 𝑌))))
13	12	com34 91	. . . . . . 7 ⊢ ((𝐾 ∈ Poset ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑝 ∈ (Atoms‘𝐾) → (𝑋 ≤ 𝑌 → (𝑝 ≤ 𝑋 → 𝑝 ≤ 𝑌))))
14	13	com23 86	. . . . . 6 ⊢ ((𝐾 ∈ Poset ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 ≤ 𝑌 → (𝑝 ∈ (Atoms‘𝐾) → (𝑝 ≤ 𝑋 → 𝑝 ≤ 𝑌))))
15	14	ralrimdv 3138	. . . . 5 ⊢ ((𝐾 ∈ Poset ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 ≤ 𝑌 → ∀𝑝 ∈ (Atoms‘𝐾)(𝑝 ≤ 𝑋 → 𝑝 ≤ 𝑌)))
16	1, 15	syl3an1 1163	. . . 4 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 ≤ 𝑌 → ∀𝑝 ∈ (Atoms‘𝐾)(𝑝 ≤ 𝑋 → 𝑝 ≤ 𝑌)))
17		ss2rab 4046	. . . 4 ⊢ ({𝑝 ∈ (Atoms‘𝐾) ∣ 𝑝 ≤ 𝑋} ⊆ {𝑝 ∈ (Atoms‘𝐾) ∣ 𝑝 ≤ 𝑌} ↔ ∀𝑝 ∈ (Atoms‘𝐾)(𝑝 ≤ 𝑋 → 𝑝 ≤ 𝑌))
18	16, 17	imbitrrdi 252	. . 3 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 ≤ 𝑌 → {𝑝 ∈ (Atoms‘𝐾) ∣ 𝑝 ≤ 𝑋} ⊆ {𝑝 ∈ (Atoms‘𝐾) ∣ 𝑝 ≤ 𝑌}))
19		hlclat 39322	. . . . . 6 ⊢ (𝐾 ∈ HL → 𝐾 ∈ CLat)
20		ssrab2 4055	. . . . . . . . 9 ⊢ {𝑝 ∈ (Atoms‘𝐾) ∣ 𝑝 ≤ 𝑌} ⊆ (Atoms‘𝐾)
21	2, 3	atssbase 39254	. . . . . . . . 9 ⊢ (Atoms‘𝐾) ⊆ 𝐵
22	20, 21	sstri 3968	. . . . . . . 8 ⊢ {𝑝 ∈ (Atoms‘𝐾) ∣ 𝑝 ≤ 𝑌} ⊆ 𝐵
23		eqid 2735	. . . . . . . . 9 ⊢ (lub‘𝐾) = (lub‘𝐾)
24	2, 5, 23	lubss 18521	. . . . . . . 8 ⊢ ((𝐾 ∈ CLat ∧ {𝑝 ∈ (Atoms‘𝐾) ∣ 𝑝 ≤ 𝑌} ⊆ 𝐵 ∧ {𝑝 ∈ (Atoms‘𝐾) ∣ 𝑝 ≤ 𝑋} ⊆ {𝑝 ∈ (Atoms‘𝐾) ∣ 𝑝 ≤ 𝑌}) → ((lub‘𝐾)‘{𝑝 ∈ (Atoms‘𝐾) ∣ 𝑝 ≤ 𝑋}) ≤ ((lub‘𝐾)‘{𝑝 ∈ (Atoms‘𝐾) ∣ 𝑝 ≤ 𝑌}))
25	22, 24	mp3an2 1451	. . . . . . 7 ⊢ ((𝐾 ∈ CLat ∧ {𝑝 ∈ (Atoms‘𝐾) ∣ 𝑝 ≤ 𝑋} ⊆ {𝑝 ∈ (Atoms‘𝐾) ∣ 𝑝 ≤ 𝑌}) → ((lub‘𝐾)‘{𝑝 ∈ (Atoms‘𝐾) ∣ 𝑝 ≤ 𝑋}) ≤ ((lub‘𝐾)‘{𝑝 ∈ (Atoms‘𝐾) ∣ 𝑝 ≤ 𝑌}))
26	25	ex 412	. . . . . 6 ⊢ (𝐾 ∈ CLat → ({𝑝 ∈ (Atoms‘𝐾) ∣ 𝑝 ≤ 𝑋} ⊆ {𝑝 ∈ (Atoms‘𝐾) ∣ 𝑝 ≤ 𝑌} → ((lub‘𝐾)‘{𝑝 ∈ (Atoms‘𝐾) ∣ 𝑝 ≤ 𝑋}) ≤ ((lub‘𝐾)‘{𝑝 ∈ (Atoms‘𝐾) ∣ 𝑝 ≤ 𝑌})))
27	19, 26	syl 17	. . . . 5 ⊢ (𝐾 ∈ HL → ({𝑝 ∈ (Atoms‘𝐾) ∣ 𝑝 ≤ 𝑋} ⊆ {𝑝 ∈ (Atoms‘𝐾) ∣ 𝑝 ≤ 𝑌} → ((lub‘𝐾)‘{𝑝 ∈ (Atoms‘𝐾) ∣ 𝑝 ≤ 𝑋}) ≤ ((lub‘𝐾)‘{𝑝 ∈ (Atoms‘𝐾) ∣ 𝑝 ≤ 𝑌})))
28	27	3ad2ant1 1133	. . . 4 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → ({𝑝 ∈ (Atoms‘𝐾) ∣ 𝑝 ≤ 𝑋} ⊆ {𝑝 ∈ (Atoms‘𝐾) ∣ 𝑝 ≤ 𝑌} → ((lub‘𝐾)‘{𝑝 ∈ (Atoms‘𝐾) ∣ 𝑝 ≤ 𝑋}) ≤ ((lub‘𝐾)‘{𝑝 ∈ (Atoms‘𝐾) ∣ 𝑝 ≤ 𝑌})))
29		hlomcmat 39329	. . . . . . 7 ⊢ (𝐾 ∈ HL → (𝐾 ∈ OML ∧ 𝐾 ∈ CLat ∧ 𝐾 ∈ AtLat))
30	29	3ad2ant1 1133	. . . . . 6 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝐾 ∈ OML ∧ 𝐾 ∈ CLat ∧ 𝐾 ∈ AtLat))
31		simp2 1137	. . . . . 6 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → 𝑋 ∈ 𝐵)
32	2, 5, 23, 3	atlatmstc 39283	. . . . . 6 ⊢ (((𝐾 ∈ OML ∧ 𝐾 ∈ CLat ∧ 𝐾 ∈ AtLat) ∧ 𝑋 ∈ 𝐵) → ((lub‘𝐾)‘{𝑝 ∈ (Atoms‘𝐾) ∣ 𝑝 ≤ 𝑋}) = 𝑋)
33	30, 31, 32	syl2anc 584	. . . . 5 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → ((lub‘𝐾)‘{𝑝 ∈ (Atoms‘𝐾) ∣ 𝑝 ≤ 𝑋}) = 𝑋)
34		simp3 1138	. . . . . 6 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → 𝑌 ∈ 𝐵)
35	2, 5, 23, 3	atlatmstc 39283	. . . . . 6 ⊢ (((𝐾 ∈ OML ∧ 𝐾 ∈ CLat ∧ 𝐾 ∈ AtLat) ∧ 𝑌 ∈ 𝐵) → ((lub‘𝐾)‘{𝑝 ∈ (Atoms‘𝐾) ∣ 𝑝 ≤ 𝑌}) = 𝑌)
36	30, 34, 35	syl2anc 584	. . . . 5 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → ((lub‘𝐾)‘{𝑝 ∈ (Atoms‘𝐾) ∣ 𝑝 ≤ 𝑌}) = 𝑌)
37	33, 36	breq12d 5132	. . . 4 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (((lub‘𝐾)‘{𝑝 ∈ (Atoms‘𝐾) ∣ 𝑝 ≤ 𝑋}) ≤ ((lub‘𝐾)‘{𝑝 ∈ (Atoms‘𝐾) ∣ 𝑝 ≤ 𝑌}) ↔ 𝑋 ≤ 𝑌))
38	28, 37	sylibd 239	. . 3 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → ({𝑝 ∈ (Atoms‘𝐾) ∣ 𝑝 ≤ 𝑋} ⊆ {𝑝 ∈ (Atoms‘𝐾) ∣ 𝑝 ≤ 𝑌} → 𝑋 ≤ 𝑌))
39	18, 38	impbid 212	. 2 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 ≤ 𝑌 ↔ {𝑝 ∈ (Atoms‘𝐾) ∣ 𝑝 ≤ 𝑋} ⊆ {𝑝 ∈ (Atoms‘𝐾) ∣ 𝑝 ≤ 𝑌}))
40		pmaple.m	. . . . 5 ⊢ 𝑀 = (pmap‘𝐾)
41	2, 5, 3, 40	pmapval 39722	. . . 4 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵) → (𝑀‘𝑋) = {𝑝 ∈ (Atoms‘𝐾) ∣ 𝑝 ≤ 𝑋})
42	41	3adant3 1132	. . 3 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑀‘𝑋) = {𝑝 ∈ (Atoms‘𝐾) ∣ 𝑝 ≤ 𝑋})
43	2, 5, 3, 40	pmapval 39722	. . . 4 ⊢ ((𝐾 ∈ HL ∧ 𝑌 ∈ 𝐵) → (𝑀‘𝑌) = {𝑝 ∈ (Atoms‘𝐾) ∣ 𝑝 ≤ 𝑌})
44	43	3adant2 1131	. . 3 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑀‘𝑌) = {𝑝 ∈ (Atoms‘𝐾) ∣ 𝑝 ≤ 𝑌})
45	42, 44	sseq12d 3992	. 2 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → ((𝑀‘𝑋) ⊆ (𝑀‘𝑌) ↔ {𝑝 ∈ (Atoms‘𝐾) ∣ 𝑝 ≤ 𝑋} ⊆ {𝑝 ∈ (Atoms‘𝐾) ∣ 𝑝 ≤ 𝑌}))
46	39, 45	bitr4d 282	1 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 ≤ 𝑌 ↔ (𝑀‘𝑋) ⊆ (𝑀‘𝑌)))

Syntax hints:   → wi 4   ↔ wb 206   ∧ w3a 1086   = wceq 1540   ∈ wcel 2108  ∀wral 3051  {crab 3415   ⊆ wss 3926   class class class wbr 5119  ‘cfv 6530  Basecbs 17226  lecple 17276  Posetcpo 18317  lubclub 18319  CLatccla 18506  OMLcoml 39139  Atomscatm 39227  AtLatcal 39228  HLchlt 39314  pmapcpmap 39462

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-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

This theorem is referenced by:  pmap11  39727  hlmod1i  39821  paddunN  39892  pmapojoinN  39933  pl42N  39948