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 41017
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 2763 . . 3 (le‘𝐾) = (le‘𝐾)
3 eqid 2763 . . 3 (Atoms‘𝐾) = (Atoms‘𝐾)
4 pmapsub.m . . 3 𝑀 = (pmap‘𝐾)
51, 2, 3, 4pmapval 41006 . 2 ((𝐾 ∈ Lat ∧ 𝑋 ∈ 𝐵) → (𝑀‘𝑋) = {𝑐 ∈ (Atoms‘𝐾) ∣ 𝑐(le‘𝐾)𝑋})
6 breq1 5109 . . . . . . . . . . . . . 14 (𝑐 = 𝑝 → (𝑐(le‘𝐾)𝑋 ↔ 𝑝(le‘𝐾)𝑋))
76elrab 3648 . . . . . . . . . . . . 13 (𝑝 ∈ {𝑐 ∈ (Atoms‘𝐾) ∣ 𝑐(le‘𝐾)𝑋} ↔ (𝑝 ∈ (Atoms‘𝐾) ∧ 𝑝(le‘𝐾)𝑋))
81, 3atbase 40538 . . . . . . . . . . . . . 14 (𝑝 ∈ (Atoms‘𝐾) → 𝑝 ∈ 𝐵)
98anim1i 627 . . . . . . . . . . . . 13 ((𝑝 ∈ (Atoms‘𝐾) ∧ 𝑝(le‘𝐾)𝑋) → (𝑝 ∈ 𝐵 ∧ 𝑝(le‘𝐾)𝑋))
107, 9sylbi 220 . . . . . . . . . . . 12 (𝑝 ∈ {𝑐 ∈ (Atoms‘𝐾) ∣ 𝑐(le‘𝐾)𝑋} → (𝑝 ∈ 𝐵 ∧ 𝑝(le‘𝐾)𝑋))
11 breq1 5109 . . . . . . . . . . . . . 14 (𝑐 = 𝑞 → (𝑐(le‘𝐾)𝑋 ↔ 𝑞(le‘𝐾)𝑋))
1211elrab 3648 . . . . . . . . . . . . 13 (𝑞 ∈ {𝑐 ∈ (Atoms‘𝐾) ∣ 𝑐(le‘𝐾)𝑋} ↔ (𝑞 ∈ (Atoms‘𝐾) ∧ 𝑞(le‘𝐾)𝑋))
131, 3atbase 40538 . . . . . . . . . . . . . 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 40538 . . . . . . . . 9 (𝑟 ∈ (Atoms‘𝐾) → 𝑟 ∈ 𝐵)
21 eqid 2763 . . . . . . . . . . . . . . . . 17 (join‘𝐾) = (join‘𝐾)
221, 2, 21latjle12 18653 . . . . . . . . . . . . . . . 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 18642 . . . . . . . . . . . . . 14 ((𝐾 ∈ Lat ∧ 𝑝 ∈ 𝐵 ∧ 𝑞 ∈ 𝐵) → (𝑝(join‘𝐾)𝑞) ∈ 𝐵)
30293expib 1140 . . . . . . . . . . . . 13 (𝐾 ∈ Lat → ((𝑝 ∈ 𝐵 ∧ 𝑞 ∈ 𝐵) → (𝑝(join‘𝐾)𝑞) ∈ 𝐵))
311, 2lattr 18647 . . . . . . . . . . . . . . 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 5109 . . . . . . . 8 (𝑐 = 𝑟 → (𝑐(le‘𝐾)𝑋 ↔ 𝑟(le‘𝐾)𝑋))
4241elrab 3648 . . . . . . 7 (𝑟 ∈ {𝑐 ∈ (Atoms‘𝐾) ∣ 𝑐(le‘𝐾)𝑋} ↔ (𝑟 ∈ (Atoms‘𝐾) ∧ 𝑟(le‘𝐾)𝑋))
4340, 42imbitrrdi 255 . . . . . 6 ((((𝐾 ∈ Lat ∧ 𝑋 ∈ 𝐵) ∧ (𝑝 ∈ {𝑐 ∈ (Atoms‘𝐾) ∣ 𝑐(le‘𝐾)𝑋} ∧ 𝑞 ∈ {𝑐 ∈ (Atoms‘𝐾) ∣ 𝑐(le‘𝐾)𝑋})) ∧ 𝑟 ∈ (Atoms‘𝐾)) → (𝑟(le‘𝐾)(𝑝(join‘𝐾)𝑞) → 𝑟 ∈ {𝑐 ∈ (Atoms‘𝐾) ∣ 𝑐(le‘𝐾)𝑋}))
4443ralrimiva 3158 . . . . 5 (((𝐾 ∈ Lat ∧ 𝑋 ∈ 𝐵) ∧ (𝑝 ∈ {𝑐 ∈ (Atoms‘𝐾) ∣ 𝑐(le‘𝐾)𝑋} ∧ 𝑞 ∈ {𝑐 ∈ (Atoms‘𝐾) ∣ 𝑐(le‘𝐾)𝑋})) → ∀𝑟 ∈ (Atoms‘𝐾)(𝑟(le‘𝐾)(𝑝(join‘𝐾)𝑞) → 𝑟 ∈ {𝑐 ∈ (Atoms‘𝐾) ∣ 𝑐(le‘𝐾)𝑋}))
4544ralrimivva 3209 . . . 4 ((𝐾 ∈ Lat ∧ 𝑋 ∈ 𝐵) → ∀𝑝 ∈ {𝑐 ∈ (Atoms‘𝐾) ∣ 𝑐(le‘𝐾)𝑋}∀𝑞 ∈ {𝑐 ∈ (Atoms‘𝐾) ∣ 𝑐(le‘𝐾)𝑋}∀𝑟 ∈ (Atoms‘𝐾)(𝑟(le‘𝐾)(𝑝(join‘𝐾)𝑞) → 𝑟 ∈ {𝑐 ∈ (Atoms‘𝐾) ∣ 𝑐(le‘𝐾)𝑋}))
46 ssrab2 4008 . . . 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 40994 . . . 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 2864 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 2147  ∀wral 3080  {crab 3416   ⊆ wss 3900   class class class wbr 5106  ‘cfv 6558  (class class class)co 7443  Basecbs 17416  lecple 17464  joincjn 18514  Latclat 18634  Atomscatm 40512  PSubSpcpsubsp 40745  pmapcpmap 40746
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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-rep 5235  ax-sep 5252  ax-nul 5263  ax-pow 5331  ax-pr 5395  ax-un 7775
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 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rmo 3369  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-iun 4956  df-br 5107  df-opab 5171  df-mpt 5190  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-iota 6512  df-fun 6560  df-fn 6561  df-f 6562  df-f1 6563  df-fo 6564  df-f1o 6565  df-fv 6566  df-riota 7400  df-ov 7446  df-oprab 7447  df-poset 18516  df-lub 18547  df-glb 18548  df-join 18549  df-meet 18550  df-lat 18635  df-ats 40516  df-psubsp 40752  df-pmap 40753
This theorem is used by:  hlmod1i  41105  polsubN  41156  pl42lem4N  41231
  Copyright terms: Public domain W3C validator