Theorem pmaple 37057

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 36662	. . . . 5 ⊢ (𝐾 ∈ HL → 𝐾 ∈ Poset)
2		pmaple.b	. . . . . . . . . 10 ⊢ 𝐵 = (Base‘𝐾)
3		eqid 2798	. . . . . . . . . 10 ⊢ (Atoms‘𝐾) = (Atoms‘𝐾)
4	2, 3	atbase 36585	. . . . . . . . 9 ⊢ (𝑝 ∈ (Atoms‘𝐾) → 𝑝 ∈ 𝐵)
5		pmaple.l	. . . . . . . . . . . . . . 15 ⊢ ≤ = (le‘𝐾)
6	2, 5	postr 17555	. . . . . . . . . . . . . 14 ⊢ ((𝐾 ∈ Poset ∧ (𝑝 ∈ 𝐵 ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → ((𝑝 ≤ 𝑋 ∧ 𝑋 ≤ 𝑌) → 𝑝 ≤ 𝑌))
7	6	exp4b 434	. . . . . . . . . . . . 13 ⊢ (𝐾 ∈ Poset → ((𝑝 ∈ 𝐵 ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑝 ≤ 𝑋 → (𝑋 ≤ 𝑌 → 𝑝 ≤ 𝑌))))
8	7	3expd 1350	. . . . . . . . . . . 12 ⊢ (𝐾 ∈ Poset → (𝑝 ∈ 𝐵 → (𝑋 ∈ 𝐵 → (𝑌 ∈ 𝐵 → (𝑝 ≤ 𝑋 → (𝑋 ≤ 𝑌 → 𝑝 ≤ 𝑌))))))
9	8	com23 86	. . . . . . . . . . 11 ⊢ (𝐾 ∈ Poset → (𝑋 ∈ 𝐵 → (𝑝 ∈ 𝐵 → (𝑌 ∈ 𝐵 → (𝑝 ≤ 𝑋 → (𝑋 ≤ 𝑌 → 𝑝 ≤ 𝑌))))))
10	9	com34 91	. . . . . . . . . 10 ⊢ (𝐾 ∈ Poset → (𝑋 ∈ 𝐵 → (𝑌 ∈ 𝐵 → (𝑝 ∈ 𝐵 → (𝑝 ≤ 𝑋 → (𝑋 ≤ 𝑌 → 𝑝 ≤ 𝑌))))))
11	10	3imp 1108	. . . . . . . . 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 3153	. . . . 5 ⊢ ((𝐾 ∈ Poset ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 ≤ 𝑌 → ∀𝑝 ∈ (Atoms‘𝐾)(𝑝 ≤ 𝑋 → 𝑝 ≤ 𝑌)))
16	1, 15	syl3an1 1160	. . . 4 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 ≤ 𝑌 → ∀𝑝 ∈ (Atoms‘𝐾)(𝑝 ≤ 𝑋 → 𝑝 ≤ 𝑌)))
17		ss2rab 3998	. . . 4 ⊢ ({𝑝 ∈ (Atoms‘𝐾) ∣ 𝑝 ≤ 𝑋} ⊆ {𝑝 ∈ (Atoms‘𝐾) ∣ 𝑝 ≤ 𝑌} ↔ ∀𝑝 ∈ (Atoms‘𝐾)(𝑝 ≤ 𝑋 → 𝑝 ≤ 𝑌))
18	16, 17	syl6ibr 255	. . 3 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 ≤ 𝑌 → {𝑝 ∈ (Atoms‘𝐾) ∣ 𝑝 ≤ 𝑋} ⊆ {𝑝 ∈ (Atoms‘𝐾) ∣ 𝑝 ≤ 𝑌}))
19		hlclat 36654	. . . . . 6 ⊢ (𝐾 ∈ HL → 𝐾 ∈ CLat)
20		ssrab2 4007	. . . . . . . . 9 ⊢ {𝑝 ∈ (Atoms‘𝐾) ∣ 𝑝 ≤ 𝑌} ⊆ (Atoms‘𝐾)
21	2, 3	atssbase 36586	. . . . . . . . 9 ⊢ (Atoms‘𝐾) ⊆ 𝐵
22	20, 21	sstri 3924	. . . . . . . 8 ⊢ {𝑝 ∈ (Atoms‘𝐾) ∣ 𝑝 ≤ 𝑌} ⊆ 𝐵
23		eqid 2798	. . . . . . . . 9 ⊢ (lub‘𝐾) = (lub‘𝐾)
24	2, 5, 23	lubss 17723	. . . . . . . 8 ⊢ ((𝐾 ∈ CLat ∧ {𝑝 ∈ (Atoms‘𝐾) ∣ 𝑝 ≤ 𝑌} ⊆ 𝐵 ∧ {𝑝 ∈ (Atoms‘𝐾) ∣ 𝑝 ≤ 𝑋} ⊆ {𝑝 ∈ (Atoms‘𝐾) ∣ 𝑝 ≤ 𝑌}) → ((lub‘𝐾)‘{𝑝 ∈ (Atoms‘𝐾) ∣ 𝑝 ≤ 𝑋}) ≤ ((lub‘𝐾)‘{𝑝 ∈ (Atoms‘𝐾) ∣ 𝑝 ≤ 𝑌}))
25	22, 24	mp3an2 1446	. . . . . . 7 ⊢ ((𝐾 ∈ CLat ∧ {𝑝 ∈ (Atoms‘𝐾) ∣ 𝑝 ≤ 𝑋} ⊆ {𝑝 ∈ (Atoms‘𝐾) ∣ 𝑝 ≤ 𝑌}) → ((lub‘𝐾)‘{𝑝 ∈ (Atoms‘𝐾) ∣ 𝑝 ≤ 𝑋}) ≤ ((lub‘𝐾)‘{𝑝 ∈ (Atoms‘𝐾) ∣ 𝑝 ≤ 𝑌}))
26	25	ex 416	. . . . . 6 ⊢ (𝐾 ∈ CLat → ({𝑝 ∈ (Atoms‘𝐾) ∣ 𝑝 ≤ 𝑋} ⊆ {𝑝 ∈ (Atoms‘𝐾) ∣ 𝑝 ≤ 𝑌} → ((lub‘𝐾)‘{𝑝 ∈ (Atoms‘𝐾) ∣ 𝑝 ≤ 𝑋}) ≤ ((lub‘𝐾)‘{𝑝 ∈ (Atoms‘𝐾) ∣ 𝑝 ≤ 𝑌})))
27	19, 26	syl 17	. . . . 5 ⊢ (𝐾 ∈ HL → ({𝑝 ∈ (Atoms‘𝐾) ∣ 𝑝 ≤ 𝑋} ⊆ {𝑝 ∈ (Atoms‘𝐾) ∣ 𝑝 ≤ 𝑌} → ((lub‘𝐾)‘{𝑝 ∈ (Atoms‘𝐾) ∣ 𝑝 ≤ 𝑋}) ≤ ((lub‘𝐾)‘{𝑝 ∈ (Atoms‘𝐾) ∣ 𝑝 ≤ 𝑌})))
28	27	3ad2ant1 1130	. . . 4 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → ({𝑝 ∈ (Atoms‘𝐾) ∣ 𝑝 ≤ 𝑋} ⊆ {𝑝 ∈ (Atoms‘𝐾) ∣ 𝑝 ≤ 𝑌} → ((lub‘𝐾)‘{𝑝 ∈ (Atoms‘𝐾) ∣ 𝑝 ≤ 𝑋}) ≤ ((lub‘𝐾)‘{𝑝 ∈ (Atoms‘𝐾) ∣ 𝑝 ≤ 𝑌})))
29		hlomcmat 36661	. . . . . . 7 ⊢ (𝐾 ∈ HL → (𝐾 ∈ OML ∧ 𝐾 ∈ CLat ∧ 𝐾 ∈ AtLat))
30	29	3ad2ant1 1130	. . . . . 6 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝐾 ∈ OML ∧ 𝐾 ∈ CLat ∧ 𝐾 ∈ AtLat))
31		simp2 1134	. . . . . 6 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → 𝑋 ∈ 𝐵)
32	2, 5, 23, 3	atlatmstc 36615	. . . . . 6 ⊢ (((𝐾 ∈ OML ∧ 𝐾 ∈ CLat ∧ 𝐾 ∈ AtLat) ∧ 𝑋 ∈ 𝐵) → ((lub‘𝐾)‘{𝑝 ∈ (Atoms‘𝐾) ∣ 𝑝 ≤ 𝑋}) = 𝑋)
33	30, 31, 32	syl2anc 587	. . . . 5 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → ((lub‘𝐾)‘{𝑝 ∈ (Atoms‘𝐾) ∣ 𝑝 ≤ 𝑋}) = 𝑋)
34		simp3 1135	. . . . . 6 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → 𝑌 ∈ 𝐵)
35	2, 5, 23, 3	atlatmstc 36615	. . . . . 6 ⊢ (((𝐾 ∈ OML ∧ 𝐾 ∈ CLat ∧ 𝐾 ∈ AtLat) ∧ 𝑌 ∈ 𝐵) → ((lub‘𝐾)‘{𝑝 ∈ (Atoms‘𝐾) ∣ 𝑝 ≤ 𝑌}) = 𝑌)
36	30, 34, 35	syl2anc 587	. . . . 5 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → ((lub‘𝐾)‘{𝑝 ∈ (Atoms‘𝐾) ∣ 𝑝 ≤ 𝑌}) = 𝑌)
37	33, 36	breq12d 5043	. . . 4 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (((lub‘𝐾)‘{𝑝 ∈ (Atoms‘𝐾) ∣ 𝑝 ≤ 𝑋}) ≤ ((lub‘𝐾)‘{𝑝 ∈ (Atoms‘𝐾) ∣ 𝑝 ≤ 𝑌}) ↔ 𝑋 ≤ 𝑌))
38	28, 37	sylibd 242	. . 3 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → ({𝑝 ∈ (Atoms‘𝐾) ∣ 𝑝 ≤ 𝑋} ⊆ {𝑝 ∈ (Atoms‘𝐾) ∣ 𝑝 ≤ 𝑌} → 𝑋 ≤ 𝑌))
39	18, 38	impbid 215	. 2 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 ≤ 𝑌 ↔ {𝑝 ∈ (Atoms‘𝐾) ∣ 𝑝 ≤ 𝑋} ⊆ {𝑝 ∈ (Atoms‘𝐾) ∣ 𝑝 ≤ 𝑌}))
40		pmaple.m	. . . . 5 ⊢ 𝑀 = (pmap‘𝐾)
41	2, 5, 3, 40	pmapval 37053	. . . 4 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵) → (𝑀‘𝑋) = {𝑝 ∈ (Atoms‘𝐾) ∣ 𝑝 ≤ 𝑋})
42	41	3adant3 1129	. . 3 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑀‘𝑋) = {𝑝 ∈ (Atoms‘𝐾) ∣ 𝑝 ≤ 𝑋})
43	2, 5, 3, 40	pmapval 37053	. . . 4 ⊢ ((𝐾 ∈ HL ∧ 𝑌 ∈ 𝐵) → (𝑀‘𝑌) = {𝑝 ∈ (Atoms‘𝐾) ∣ 𝑝 ≤ 𝑌})
44	43	3adant2 1128	. . 3 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑀‘𝑌) = {𝑝 ∈ (Atoms‘𝐾) ∣ 𝑝 ≤ 𝑌})
45	42, 44	sseq12d 3948	. 2 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → ((𝑀‘𝑋) ⊆ (𝑀‘𝑌) ↔ {𝑝 ∈ (Atoms‘𝐾) ∣ 𝑝 ≤ 𝑋} ⊆ {𝑝 ∈ (Atoms‘𝐾) ∣ 𝑝 ≤ 𝑌}))
46	39, 45	bitr4d 285	1 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 ≤ 𝑌 ↔ (𝑀‘𝑋) ⊆ (𝑀‘𝑌)))

Syntax hints:   → wi 4   ↔ wb 209   ∧ w3a 1084   = wceq 1538   ∈ wcel 2111  ∀wral 3106  {crab 3110   ⊆ wss 3881   class class class wbr 5030  ‘cfv 6324  Basecbs 16475  lecple 16564  Posetcpo 17542  lubclub 17544  CLatccla 17709  OMLcoml 36471  Atomscatm 36559  AtLatcal 36560  HLchlt 36646  pmapcpmap 36793

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2113  ax-9 2121  ax-10 2142  ax-11 2158  ax-12 2175  ax-ext 2770  ax-rep 5154  ax-sep 5167  ax-nul 5174  ax-pow 5231  ax-pr 5295  ax-un 7441

This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3an 1086  df-tru 1541  df-ex 1782  df-nf 1786  df-sb 2070  df-mo 2598  df-eu 2629  df-clab 2777  df-cleq 2791  df-clel 2870  df-nfc 2938  df-ne 2988  df-ral 3111  df-rex 3112  df-reu 3113  df-rab 3115  df-v 3443  df-sbc 3721  df-csb 3829  df-dif 3884  df-un 3886  df-in 3888  df-ss 3898  df-nul 4244  df-if 4426  df-pw 4499  df-sn 4526  df-pr 4528  df-op 4532  df-uni 4801  df-iun 4883  df-br 5031  df-opab 5093  df-mpt 5111  df-id 5425  df-xp 5525  df-rel 5526  df-cnv 5527  df-co 5528  df-dm 5529  df-rn 5530  df-res 5531  df-ima 5532  df-iota 6283  df-fun 6326  df-fn 6327  df-f 6328  df-f1 6329  df-fo 6330  df-f1o 6331  df-fv 6332  df-riota 7093  df-ov 7138  df-oprab 7139  df-proset 17530  df-poset 17548  df-plt 17560  df-lub 17576  df-glb 17577  df-join 17578  df-meet 17579  df-p0 17641  df-lat 17648  df-clat 17710  df-oposet 36472  df-ol 36474  df-oml 36475  df-covers 36562  df-ats 36563  df-atl 36594  df-cvlat 36618  df-hlat 36647  df-pmap 36800

This theorem is referenced by:  pmap11  37058  hlmod1i  37152  paddunN  37223  pmapojoinN  37264  pl42N  37279