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 40918
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 2760 . . 3 (le‘𝐾) = (le‘𝐾)
3 eqid 2760 . . 3 (Atoms‘𝐾) = (Atoms‘𝐾)
4 pmapsub.m . . 3 𝑀 = (pmap‘𝐾)
51, 2, 3, 4pmapval 40907 . 2 ((𝐾 ∈ Lat ∧ 𝑋 ∈ 𝐵) → (𝑀‘𝑋) = {𝑐 ∈ (Atoms‘𝐾) ∣ 𝑐(le‘𝐾)𝑋})
6 breq1 5105 . . . . . . . . . . . . . 14 (𝑐 = 𝑝 → (𝑐(le‘𝐾)𝑋 ↔ 𝑝(le‘𝐾)𝑋))
76elrab 3644 . . . . . . . . . . . . 13 (𝑝 ∈ {𝑐 ∈ (Atoms‘𝐾) ∣ 𝑐(le‘𝐾)𝑋} ↔ (𝑝 ∈ (Atoms‘𝐾) ∧ 𝑝(le‘𝐾)𝑋))
81, 3atbase 40439 . . . . . . . . . . . . . 14 (𝑝 ∈ (Atoms‘𝐾) → 𝑝 ∈ 𝐵)
98anim1i 627 . . . . . . . . . . . . 13 ((𝑝 ∈ (Atoms‘𝐾) ∧ 𝑝(le‘𝐾)𝑋) → (𝑝 ∈ 𝐵 ∧ 𝑝(le‘𝐾)𝑋))
107, 9sylbi 220 . . . . . . . . . . . 12 (𝑝 ∈ {𝑐 ∈ (Atoms‘𝐾) ∣ 𝑐(le‘𝐾)𝑋} → (𝑝 ∈ 𝐵 ∧ 𝑝(le‘𝐾)𝑋))
11 breq1 5105 . . . . . . . . . . . . . 14 (𝑐 = 𝑞 → (𝑐(le‘𝐾)𝑋 ↔ 𝑞(le‘𝐾)𝑋))
1211elrab 3644 . . . . . . . . . . . . 13 (𝑞 ∈ {𝑐 ∈ (Atoms‘𝐾) ∣ 𝑐(le‘𝐾)𝑋} ↔ (𝑞 ∈ (Atoms‘𝐾) ∧ 𝑞(le‘𝐾)𝑋))
131, 3atbase 40439 . . . . . . . . . . . . . 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 40439 . . . . . . . . 9 (𝑟 ∈ (Atoms‘𝐾) → 𝑟 ∈ 𝐵)
21 eqid 2760 . . . . . . . . . . . . . . . . 17 (join‘𝐾) = (join‘𝐾)
221, 2, 21latjle12 18629 . . . . . . . . . . . . . . . 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 18618 . . . . . . . . . . . . . 14 ((𝐾 ∈ Lat ∧ 𝑝 ∈ 𝐵 ∧ 𝑞 ∈ 𝐵) → (𝑝(join‘𝐾)𝑞) ∈ 𝐵)
30293expib 1140 . . . . . . . . . . . . 13 (𝐾 ∈ Lat → ((𝑝 ∈ 𝐵 ∧ 𝑞 ∈ 𝐵) → (𝑝(join‘𝐾)𝑞) ∈ 𝐵))
311, 2lattr 18623 . . . . . . . . . . . . . . 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 5105 . . . . . . . 8 (𝑐 = 𝑟 → (𝑐(le‘𝐾)𝑋 ↔ 𝑟(le‘𝐾)𝑋))
4241elrab 3644 . . . . . . 7 (𝑟 ∈ {𝑐 ∈ (Atoms‘𝐾) ∣ 𝑐(le‘𝐾)𝑋} ↔ (𝑟 ∈ (Atoms‘𝐾) ∧ 𝑟(le‘𝐾)𝑋))
4340, 42imbitrrdi 255 . . . . . 6 ((((𝐾 ∈ Lat ∧ 𝑋 ∈ 𝐵) ∧ (𝑝 ∈ {𝑐 ∈ (Atoms‘𝐾) ∣ 𝑐(le‘𝐾)𝑋} ∧ 𝑞 ∈ {𝑐 ∈ (Atoms‘𝐾) ∣ 𝑐(le‘𝐾)𝑋})) ∧ 𝑟 ∈ (Atoms‘𝐾)) → (𝑟(le‘𝐾)(𝑝(join‘𝐾)𝑞) → 𝑟 ∈ {𝑐 ∈ (Atoms‘𝐾) ∣ 𝑐(le‘𝐾)𝑋}))
4443ralrimiva 3154 . . . . 5 (((𝐾 ∈ Lat ∧ 𝑋 ∈ 𝐵) ∧ (𝑝 ∈ {𝑐 ∈ (Atoms‘𝐾) ∣ 𝑐(le‘𝐾)𝑋} ∧ 𝑞 ∈ {𝑐 ∈ (Atoms‘𝐾) ∣ 𝑐(le‘𝐾)𝑋})) → ∀𝑟 ∈ (Atoms‘𝐾)(𝑟(le‘𝐾)(𝑝(join‘𝐾)𝑞) → 𝑟 ∈ {𝑐 ∈ (Atoms‘𝐾) ∣ 𝑐(le‘𝐾)𝑋}))
4544ralrimivva 3205 . . . 4 ((𝐾 ∈ Lat ∧ 𝑋 ∈ 𝐵) → ∀𝑝 ∈ {𝑐 ∈ (Atoms‘𝐾) ∣ 𝑐(le‘𝐾)𝑋}∀𝑞 ∈ {𝑐 ∈ (Atoms‘𝐾) ∣ 𝑐(le‘𝐾)𝑋}∀𝑟 ∈ (Atoms‘𝐾)(𝑟(le‘𝐾)(𝑝(join‘𝐾)𝑞) → 𝑟 ∈ {𝑐 ∈ (Atoms‘𝐾) ∣ 𝑐(le‘𝐾)𝑋}))
46 ssrab2 4005 . . . 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 40895 . . . 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 2860 1 ((𝐾 ∈ Lat ∧ 𝑋 ∈ 𝐵) → (𝑀‘𝑋) ∈ 𝑆)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1569   ∈ wcel 2144  ∀wral 3076  {crab 3412   ⊆ wss 3895   class class class wbr 5102  ‘cfv 6538  (class class class)co 7420  Basecbs 17392  lecple 17440  joincjn 18490  Latclat 18610  Atomscatm 40413  PSubSpcpsubsp 40646  pmapcpmap 40647
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-rep 5231  ax-sep 5248  ax-nul 5259  ax-pow 5326  ax-pr 5390  ax-un 7751
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-rmo 3365  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3739  df-csb 3847  df-ss 3896  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-pw 4558  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-iun 4952  df-br 5103  df-opab 5167  df-mpt 5186  df-id 5545  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-rn 5661  df-res 5662  df-ima 5663  df-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-f1 6543  df-fo 6544  df-f1o 6545  df-fv 6546  df-riota 7377  df-ov 7423  df-oprab 7424  df-poset 18492  df-lub 18523  df-glb 18524  df-join 18525  df-meet 18526  df-lat 18611  df-ats 40417  df-psubsp 40653  df-pmap 40654
This theorem is used by:  hlmod1i  41006  polsubN  41057  pl42lem4N  41132
  Copyright terms: Public domain W3C validator