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

Theorem pmapsub 40793
Description: The projective map of a Hilbert lattice maps to projective subspaces. Part of Theorem 15.5 of [MaedaMaeda] p. 62. (Contributed by NM, 17-Oct-2011.)
Hypotheses
Ref Expression
pmapsub.b 𝐵 = (Base‘𝐾)
pmapsub.s 𝑆 = (PSubSp‘𝐾)
pmapsub.m 𝑀 = (pmap‘𝐾)
Assertion
Ref Expression
pmapsub ((𝐾 ∈ Lat ∧ 𝑋 ∈ 𝐵) → (𝑀‘𝑋) ∈ 𝑆)

Proof of Theorem pmapsub
Dummy variables 𝑞 𝑝 𝑟 𝑐 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 pmapsub.b . . 3 𝐵 = (Base‘𝐾)
2 eqid 2761 . . 3 (le‘𝐾) = (le‘𝐾)
3 eqid 2761 . . 3 (Atoms‘𝐾) = (Atoms‘𝐾)
4 pmapsub.m . . 3 𝑀 = (pmap‘𝐾)
51, 2, 3, 4pmapval 40782 . 2 ((𝐾 ∈ Lat ∧ 𝑋 ∈ 𝐵) → (𝑀‘𝑋) = {𝑐 ∈ (Atoms‘𝐾) ∣ 𝑐(le‘𝐾)𝑋})
6 breq1 5106 . . . . . . . . . . . . . 14 (𝑐 = 𝑝 → (𝑐(le‘𝐾)𝑋 ↔ 𝑝(le‘𝐾)𝑋))
76elrab 3645 . . . . . . . . . . . . 13 (𝑝 ∈ {𝑐 ∈ (Atoms‘𝐾) ∣ 𝑐(le‘𝐾)𝑋} ↔ (𝑝 ∈ (Atoms‘𝐾) ∧ 𝑝(le‘𝐾)𝑋))
81, 3atbase 40314 . . . . . . . . . . . . . 14 (𝑝 ∈ (Atoms‘𝐾) → 𝑝 ∈ 𝐵)
98anim1i 627 . . . . . . . . . . . . 13 ((𝑝 ∈ (Atoms‘𝐾) ∧ 𝑝(le‘𝐾)𝑋) → (𝑝 ∈ 𝐵 ∧ 𝑝(le‘𝐾)𝑋))
107, 9sylbi 220 . . . . . . . . . . . 12 (𝑝 ∈ {𝑐 ∈ (Atoms‘𝐾) ∣ 𝑐(le‘𝐾)𝑋} → (𝑝 ∈ 𝐵 ∧ 𝑝(le‘𝐾)𝑋))
11 breq1 5106 . . . . . . . . . . . . . 14 (𝑐 = 𝑞 → (𝑐(le‘𝐾)𝑋 ↔ 𝑞(le‘𝐾)𝑋))
1211elrab 3645 . . . . . . . . . . . . 13 (𝑞 ∈ {𝑐 ∈ (Atoms‘𝐾) ∣ 𝑐(le‘𝐾)𝑋} ↔ (𝑞 ∈ (Atoms‘𝐾) ∧ 𝑞(le‘𝐾)𝑋))
131, 3atbase 40314 . . . . . . . . . . . . . 14 (𝑞 ∈ (Atoms‘𝐾) → 𝑞 ∈ 𝐵)
1413anim1i 627 . . . . . . . . . . . . 13 ((𝑞 ∈ (Atoms‘𝐾) ∧ 𝑞(le‘𝐾)𝑋) → (𝑞 ∈ 𝐵 ∧ 𝑞(le‘𝐾)𝑋))
1512, 14sylbi 220 . . . . . . . . . . . 12 (𝑞 ∈ {𝑐 ∈ (Atoms‘𝐾) ∣ 𝑐(le‘𝐾)𝑋} → (𝑞 ∈ 𝐵 ∧ 𝑞(le‘𝐾)𝑋))
1610, 15anim12i 625 . . . . . . . . . . 11 ((𝑝 ∈ {𝑐 ∈ (Atoms‘𝐾) ∣ 𝑐(le‘𝐾)𝑋} ∧ 𝑞 ∈ {𝑐 ∈ (Atoms‘𝐾) ∣ 𝑐(le‘𝐾)𝑋}) → ((𝑝 ∈ 𝐵 ∧ 𝑝(le‘𝐾)𝑋) ∧ (𝑞 ∈ 𝐵 ∧ 𝑞(le‘𝐾)𝑋)))
17 an4 669 . . . . . . . . . . 11 (((𝑝 ∈ 𝐵 ∧ 𝑝(le‘𝐾)𝑋) ∧ (𝑞 ∈ 𝐵 ∧ 𝑞(le‘𝐾)𝑋)) ↔ ((𝑝 ∈ 𝐵 ∧ 𝑞 ∈ 𝐵) ∧ (𝑝(le‘𝐾)𝑋 ∧ 𝑞(le‘𝐾)𝑋)))
1816, 17sylib 221 . . . . . . . . . 10 ((𝑝 ∈ {𝑐 ∈ (Atoms‘𝐾) ∣ 𝑐(le‘𝐾)𝑋} ∧ 𝑞 ∈ {𝑐 ∈ (Atoms‘𝐾) ∣ 𝑐(le‘𝐾)𝑋}) → ((𝑝 ∈ 𝐵 ∧ 𝑞 ∈ 𝐵) ∧ (𝑝(le‘𝐾)𝑋 ∧ 𝑞(le‘𝐾)𝑋)))
1918anim2i 629 . . . . . . . . 9 (((𝐾 ∈ Lat ∧ 𝑋 ∈ 𝐵) ∧ (𝑝 ∈ {𝑐 ∈ (Atoms‘𝐾) ∣ 𝑐(le‘𝐾)𝑋} ∧ 𝑞 ∈ {𝑐 ∈ (Atoms‘𝐾) ∣ 𝑐(le‘𝐾)𝑋})) → ((𝐾 ∈ Lat ∧ 𝑋 ∈ 𝐵) ∧ ((𝑝 ∈ 𝐵 ∧ 𝑞 ∈ 𝐵) ∧ (𝑝(le‘𝐾)𝑋 ∧ 𝑞(le‘𝐾)𝑋))))
201, 3atbase 40314 . . . . . . . . 9 (𝑟 ∈ (Atoms‘𝐾) → 𝑟 ∈ 𝐵)
21 eqid 2761 . . . . . . . . . . . . . . . . 17 (join‘𝐾) = (join‘𝐾)
221, 2, 21latjle12 18604 . . . . . . . . . . . . . . . 16 ((𝐾 ∈ Lat ∧ (𝑝 ∈ 𝐵 ∧ 𝑞 ∈ 𝐵 ∧ 𝑋 ∈ 𝐵)) → ((𝑝(le‘𝐾)𝑋 ∧ 𝑞(le‘𝐾)𝑋) ↔ (𝑝(join‘𝐾)𝑞)(le‘𝐾)𝑋))
2322biimpd 232 . . . . . . . . . . . . . . 15 ((𝐾 ∈ Lat ∧ (𝑝 ∈ 𝐵 ∧ 𝑞 ∈ 𝐵 ∧ 𝑋 ∈ 𝐵)) → ((𝑝(le‘𝐾)𝑋 ∧ 𝑞(le‘𝐾)𝑋) → (𝑝(join‘𝐾)𝑞)(le‘𝐾)𝑋))
24233exp2 1373 . . . . . . . . . . . . . 14 (𝐾 ∈ Lat → (𝑝 ∈ 𝐵 → (𝑞 ∈ 𝐵 → (𝑋 ∈ 𝐵 → ((𝑝(le‘𝐾)𝑋 ∧ 𝑞(le‘𝐾)𝑋) → (𝑝(join‘𝐾)𝑞)(le‘𝐾)𝑋)))))
2524impd 416 . . . . . . . . . . . . 13 (𝐾 ∈ Lat → ((𝑝 ∈ 𝐵 ∧ 𝑞 ∈ 𝐵) → (𝑋 ∈ 𝐵 → ((𝑝(le‘𝐾)𝑋 ∧ 𝑞(le‘𝐾)𝑋) → (𝑝(join‘𝐾)𝑞)(le‘𝐾)𝑋))))
2625com23 87 . . . . . . . . . . . 12 (𝐾 ∈ Lat → (𝑋 ∈ 𝐵 → ((𝑝 ∈ 𝐵 ∧ 𝑞 ∈ 𝐵) → ((𝑝(le‘𝐾)𝑋 ∧ 𝑞(le‘𝐾)𝑋) → (𝑝(join‘𝐾)𝑞)(le‘𝐾)𝑋))))
2726imp43 433 . . . . . . . . . . 11 (((𝐾 ∈ Lat ∧ 𝑋 ∈ 𝐵) ∧ ((𝑝 ∈ 𝐵 ∧ 𝑞 ∈ 𝐵) ∧ (𝑝(le‘𝐾)𝑋 ∧ 𝑞(le‘𝐾)𝑋))) → (𝑝(join‘𝐾)𝑞)(le‘𝐾)𝑋)
2827adantr 486 . . . . . . . . . 10 ((((𝐾 ∈ Lat ∧ 𝑋 ∈ 𝐵) ∧ ((𝑝 ∈ 𝐵 ∧ 𝑞 ∈ 𝐵) ∧ (𝑝(le‘𝐾)𝑋 ∧ 𝑞(le‘𝐾)𝑋))) ∧ 𝑟 ∈ 𝐵) → (𝑝(join‘𝐾)𝑞)(le‘𝐾)𝑋)
291, 21latjcl 18593 . . . . . . . . . . . . . 14 ((𝐾 ∈ Lat ∧ 𝑝 ∈ 𝐵 ∧ 𝑞 ∈ 𝐵) → (𝑝(join‘𝐾)𝑞) ∈ 𝐵)
30293expib 1140 . . . . . . . . . . . . 13 (𝐾 ∈ Lat → ((𝑝 ∈ 𝐵 ∧ 𝑞 ∈ 𝐵) → (𝑝(join‘𝐾)𝑞) ∈ 𝐵))
311, 2lattr 18598 . . . . . . . . . . . . . . 15 ((𝐾 ∈ Lat ∧ (𝑟 ∈ 𝐵 ∧ (𝑝(join‘𝐾)𝑞) ∈ 𝐵 ∧ 𝑋 ∈ 𝐵)) → ((𝑟(le‘𝐾)(𝑝(join‘𝐾)𝑞) ∧ (𝑝(join‘𝐾)𝑞)(le‘𝐾)𝑋) → 𝑟(le‘𝐾)𝑋))
32313exp2 1373 . . . . . . . . . . . . . 14 (𝐾 ∈ Lat → (𝑟 ∈ 𝐵 → ((𝑝(join‘𝐾)𝑞) ∈ 𝐵 → (𝑋 ∈ 𝐵 → ((𝑟(le‘𝐾)(𝑝(join‘𝐾)𝑞) ∧ (𝑝(join‘𝐾)𝑞)(le‘𝐾)𝑋) → 𝑟(le‘𝐾)𝑋)))))
3332com24 96 . . . . . . . . . . . . 13 (𝐾 ∈ Lat → (𝑋 ∈ 𝐵 → ((𝑝(join‘𝐾)𝑞) ∈ 𝐵 → (𝑟 ∈ 𝐵 → ((𝑟(le‘𝐾)(𝑝(join‘𝐾)𝑞) ∧ (𝑝(join‘𝐾)𝑞)(le‘𝐾)𝑋) → 𝑟(le‘𝐾)𝑋)))))
3430, 33syl5d 74 . . . . . . . . . . . 12 (𝐾 ∈ Lat → (𝑋 ∈ 𝐵 → ((𝑝 ∈ 𝐵 ∧ 𝑞 ∈ 𝐵) → (𝑟 ∈ 𝐵 → ((𝑟(le‘𝐾)(𝑝(join‘𝐾)𝑞) ∧ (𝑝(join‘𝐾)𝑞)(le‘𝐾)𝑋) → 𝑟(le‘𝐾)𝑋)))))
3534imp41 431 . . . . . . . . . . 11 ((((𝐾 ∈ Lat ∧ 𝑋 ∈ 𝐵) ∧ (𝑝 ∈ 𝐵 ∧ 𝑞 ∈ 𝐵)) ∧ 𝑟 ∈ 𝐵) → ((𝑟(le‘𝐾)(𝑝(join‘𝐾)𝑞) ∧ (𝑝(join‘𝐾)𝑞)(le‘𝐾)𝑋) → 𝑟(le‘𝐾)𝑋))
3635adantlrr 734 . . . . . . . . . 10 ((((𝐾 ∈ Lat ∧ 𝑋 ∈ 𝐵) ∧ ((𝑝 ∈ 𝐵 ∧ 𝑞 ∈ 𝐵) ∧ (𝑝(le‘𝐾)𝑋 ∧ 𝑞(le‘𝐾)𝑋))) ∧ 𝑟 ∈ 𝐵) → ((𝑟(le‘𝐾)(𝑝(join‘𝐾)𝑞) ∧ (𝑝(join‘𝐾)𝑞)(le‘𝐾)𝑋) → 𝑟(le‘𝐾)𝑋))
3728, 36mpan2d 707 . . . . . . . . 9 ((((𝐾 ∈ Lat ∧ 𝑋 ∈ 𝐵) ∧ ((𝑝 ∈ 𝐵 ∧ 𝑞 ∈ 𝐵) ∧ (𝑝(le‘𝐾)𝑋 ∧ 𝑞(le‘𝐾)𝑋))) ∧ 𝑟 ∈ 𝐵) → (𝑟(le‘𝐾)(𝑝(join‘𝐾)𝑞) → 𝑟(le‘𝐾)𝑋))
3819, 20, 37syl2an 608 . . . . . . . 8 ((((𝐾 ∈ Lat ∧ 𝑋 ∈ 𝐵) ∧ (𝑝 ∈ {𝑐 ∈ (Atoms‘𝐾) ∣ 𝑐(le‘𝐾)𝑋} ∧ 𝑞 ∈ {𝑐 ∈ (Atoms‘𝐾) ∣ 𝑐(le‘𝐾)𝑋})) ∧ 𝑟 ∈ (Atoms‘𝐾)) → (𝑟(le‘𝐾)(𝑝(join‘𝐾)𝑞) → 𝑟(le‘𝐾)𝑋))
39 simpr 490 . . . . . . . 8 ((((𝐾 ∈ Lat ∧ 𝑋 ∈ 𝐵) ∧ (𝑝 ∈ {𝑐 ∈ (Atoms‘𝐾) ∣ 𝑐(le‘𝐾)𝑋} ∧ 𝑞 ∈ {𝑐 ∈ (Atoms‘𝐾) ∣ 𝑐(le‘𝐾)𝑋})) ∧ 𝑟 ∈ (Atoms‘𝐾)) → 𝑟 ∈ (Atoms‘𝐾))
4038, 39jctild 535 . . . . . . 7 ((((𝐾 ∈ Lat ∧ 𝑋 ∈ 𝐵) ∧ (𝑝 ∈ {𝑐 ∈ (Atoms‘𝐾) ∣ 𝑐(le‘𝐾)𝑋} ∧ 𝑞 ∈ {𝑐 ∈ (Atoms‘𝐾) ∣ 𝑐(le‘𝐾)𝑋})) ∧ 𝑟 ∈ (Atoms‘𝐾)) → (𝑟(le‘𝐾)(𝑝(join‘𝐾)𝑞) → (𝑟 ∈ (Atoms‘𝐾) ∧ 𝑟(le‘𝐾)𝑋)))
41 breq1 5106 . . . . . . . 8 (𝑐 = 𝑟 → (𝑐(le‘𝐾)𝑋 ↔ 𝑟(le‘𝐾)𝑋))
4241elrab 3645 . . . . . . 7 (𝑟 ∈ {𝑐 ∈ (Atoms‘𝐾) ∣ 𝑐(le‘𝐾)𝑋} ↔ (𝑟 ∈ (Atoms‘𝐾) ∧ 𝑟(le‘𝐾)𝑋))
4340, 42imbitrrdi 255 . . . . . 6 ((((𝐾 ∈ Lat ∧ 𝑋 ∈ 𝐵) ∧ (𝑝 ∈ {𝑐 ∈ (Atoms‘𝐾) ∣ 𝑐(le‘𝐾)𝑋} ∧ 𝑞 ∈ {𝑐 ∈ (Atoms‘𝐾) ∣ 𝑐(le‘𝐾)𝑋})) ∧ 𝑟 ∈ (Atoms‘𝐾)) → (𝑟(le‘𝐾)(𝑝(join‘𝐾)𝑞) → 𝑟 ∈ {𝑐 ∈ (Atoms‘𝐾) ∣ 𝑐(le‘𝐾)𝑋}))
4443ralrimiva 3155 . . . . 5 (((𝐾 ∈ Lat ∧ 𝑋 ∈ 𝐵) ∧ (𝑝 ∈ {𝑐 ∈ (Atoms‘𝐾) ∣ 𝑐(le‘𝐾)𝑋} ∧ 𝑞 ∈ {𝑐 ∈ (Atoms‘𝐾) ∣ 𝑐(le‘𝐾)𝑋})) → ∀𝑟 ∈ (Atoms‘𝐾)(𝑟(le‘𝐾)(𝑝(join‘𝐾)𝑞) → 𝑟 ∈ {𝑐 ∈ (Atoms‘𝐾) ∣ 𝑐(le‘𝐾)𝑋}))
4544ralrimivva 3206 . . . 4 ((𝐾 ∈ Lat ∧ 𝑋 ∈ 𝐵) → ∀𝑝 ∈ {𝑐 ∈ (Atoms‘𝐾) ∣ 𝑐(le‘𝐾)𝑋}∀𝑞 ∈ {𝑐 ∈ (Atoms‘𝐾) ∣ 𝑐(le‘𝐾)𝑋}∀𝑟 ∈ (Atoms‘𝐾)(𝑟(le‘𝐾)(𝑝(join‘𝐾)𝑞) → 𝑟 ∈ {𝑐 ∈ (Atoms‘𝐾) ∣ 𝑐(le‘𝐾)𝑋}))
46 ssrab2 4028 . . . 4 {𝑐 ∈ (Atoms‘𝐾) ∣ 𝑐(le‘𝐾)𝑋} ⊆ (Atoms‘𝐾)
4745, 46jctil 529 . . 3 ((𝐾 ∈ Lat ∧ 𝑋 ∈ 𝐵) → ({𝑐 ∈ (Atoms‘𝐾) ∣ 𝑐(le‘𝐾)𝑋} ⊆ (Atoms‘𝐾) ∧ ∀𝑝 ∈ {𝑐 ∈ (Atoms‘𝐾) ∣ 𝑐(le‘𝐾)𝑋}∀𝑞 ∈ {𝑐 ∈ (Atoms‘𝐾) ∣ 𝑐(le‘𝐾)𝑋}∀𝑟 ∈ (Atoms‘𝐾)(𝑟(le‘𝐾)(𝑝(join‘𝐾)𝑞) → 𝑟 ∈ {𝑐 ∈ (Atoms‘𝐾) ∣ 𝑐(le‘𝐾)𝑋})))
48 pmapsub.s . . . . 5 𝑆 = (PSubSp‘𝐾)
492, 21, 3, 48ispsubsp 40770 . . . 4 (𝐾 ∈ Lat → ({𝑐 ∈ (Atoms‘𝐾) ∣ 𝑐(le‘𝐾)𝑋} ∈ 𝑆 ↔ ({𝑐 ∈ (Atoms‘𝐾) ∣ 𝑐(le‘𝐾)𝑋} ⊆ (Atoms‘𝐾) ∧ ∀𝑝 ∈ {𝑐 ∈ (Atoms‘𝐾) ∣ 𝑐(le‘𝐾)𝑋}∀𝑞 ∈ {𝑐 ∈ (Atoms‘𝐾) ∣ 𝑐(le‘𝐾)𝑋}∀𝑟 ∈ (Atoms‘𝐾)(𝑟(le‘𝐾)(𝑝(join‘𝐾)𝑞) → 𝑟 ∈ {𝑐 ∈ (Atoms‘𝐾) ∣ 𝑐(le‘𝐾)𝑋}))))
5049adantr 486 . . 3 ((𝐾 ∈ Lat ∧ 𝑋 ∈ 𝐵) → ({𝑐 ∈ (Atoms‘𝐾) ∣ 𝑐(le‘𝐾)𝑋} ∈ 𝑆 ↔ ({𝑐 ∈ (Atoms‘𝐾) ∣ 𝑐(le‘𝐾)𝑋} ⊆ (Atoms‘𝐾) ∧ ∀𝑝 ∈ {𝑐 ∈ (Atoms‘𝐾) ∣ 𝑐(le‘𝐾)𝑋}∀𝑞 ∈ {𝑐 ∈ (Atoms‘𝐾) ∣ 𝑐(le‘𝐾)𝑋}∀𝑟 ∈ (Atoms‘𝐾)(𝑟(le‘𝐾)(𝑝(join‘𝐾)𝑞) → 𝑟 ∈ {𝑐 ∈ (Atoms‘𝐾) ∣ 𝑐(le‘𝐾)𝑋}))))
5147, 50mpbird 260 . 2 ((𝐾 ∈ Lat ∧ 𝑋 ∈ 𝐵) → {𝑐 ∈ (Atoms‘𝐾) ∣ 𝑐(le‘𝐾)𝑋} ∈ 𝑆)
525, 51eqeltrd 2861 1 ((𝐾 ∈ Lat ∧ 𝑋 ∈ 𝐵) → (𝑀‘𝑋) ∈ 𝑆)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2145  ∀wral 3077  {crab 3413   ⊆ wss 3899   class class class wbr 5103  ‘cfv 6531  (class class class)co 7412  Basecbs 17367  lecple 17415  joincjn 18465  Latclat 18585  Atomscatm 40288  PSubSpcpsubsp 40521  pmapcpmap 40522
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 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-rep 5232  ax-sep 5249  ax-nul 5260  ax-pow 5327  ax-pr 5391  ax-un 7740
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 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-rmo 3366  df-reu 3367  df-rab 3414  df-v 3453  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-iota 6487  df-fun 6533  df-fn 6534  df-f 6535  df-f1 6536  df-fo 6537  df-f1o 6538  df-fv 6539  df-riota 7369  df-ov 7415  df-oprab 7416  df-poset 18467  df-lub 18498  df-glb 18499  df-join 18500  df-meet 18501  df-lat 18586  df-ats 40292  df-psubsp 40528  df-pmap 40529
This theorem is used by:  hlmod1i  40881  polsubN  40932  pl42lem4N  41007
  Copyright terms: Public domain W3C validator