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

Theorem ispsubcl2N 40606
Description: Alternate predicate for "is a closed projective subspace". Remark in [Holland95] p. 223. (Contributed by NM, 24-Jan-2012.) (New usage is discouraged.)
Hypotheses
Ref Expression
pmapsubcl.b 𝐵 = (Base‘𝐾)
pmapsubcl.m 𝑀 = (pmap‘𝐾)
pmapsubcl.c 𝐶 = (PSubCl‘𝐾)
Assertion
Ref Expression
ispsubcl2N (𝐾 ∈ HL → (𝑋𝐶 ↔ ∃𝑦𝐵 𝑋 = (𝑀𝑦)))
Distinct variable groups:   𝑦,𝐵   𝑦,𝐾   𝑦,𝑀   𝑦,𝑋
Allowed substitution hint:   𝐶(𝑦)

Proof of Theorem ispsubcl2N
StepHypRef Expression
1 eqid 2769 . . 3 (Atoms‘𝐾) = (Atoms‘𝐾)
2 eqid 2769 . . 3 (⊥𝑃𝐾) = (⊥𝑃𝐾)
3 pmapsubcl.c . . 3 𝐶 = (PSubCl‘𝐾)
41, 2, 3ispsubclN 40596 . 2 (𝐾 ∈ HL → (𝑋𝐶 ↔ (𝑋 ⊆ (Atoms‘𝐾) ∧ ((⊥𝑃𝐾)‘((⊥𝑃𝐾)‘𝑋)) = 𝑋)))
5 hlop 40021 . . . . . . . . 9 (𝐾 ∈ HL → 𝐾 ∈ OP)
65adantr 485 . . . . . . . 8 ((𝐾 ∈ HL ∧ 𝑋 ⊆ (Atoms‘𝐾)) → 𝐾 ∈ OP)
7 hlclat 40017 . . . . . . . . . 10 (𝐾 ∈ HL → 𝐾 ∈ CLat)
87adantr 485 . . . . . . . . 9 ((𝐾 ∈ HL ∧ 𝑋 ⊆ (Atoms‘𝐾)) → 𝐾 ∈ CLat)
91, 2polssatN 40567 . . . . . . . . . 10 ((𝐾 ∈ HL ∧ 𝑋 ⊆ (Atoms‘𝐾)) → ((⊥𝑃𝐾)‘𝑋) ⊆ (Atoms‘𝐾))
10 pmapsubcl.b . . . . . . . . . . 11 𝐵 = (Base‘𝐾)
1110, 1atssbase 39949 . . . . . . . . . 10 (Atoms‘𝐾) ⊆ 𝐵
129, 11sstrdi 3957 . . . . . . . . 9 ((𝐾 ∈ HL ∧ 𝑋 ⊆ (Atoms‘𝐾)) → ((⊥𝑃𝐾)‘𝑋) ⊆ 𝐵)
13 eqid 2769 . . . . . . . . . 10 (lub‘𝐾) = (lub‘𝐾)
1410, 13clatlubcl 18555 . . . . . . . . 9 ((𝐾 ∈ CLat ∧ ((⊥𝑃𝐾)‘𝑋) ⊆ 𝐵) → ((lub‘𝐾)‘((⊥𝑃𝐾)‘𝑋)) ∈ 𝐵)
158, 12, 14syl2anc 595 . . . . . . . 8 ((𝐾 ∈ HL ∧ 𝑋 ⊆ (Atoms‘𝐾)) → ((lub‘𝐾)‘((⊥𝑃𝐾)‘𝑋)) ∈ 𝐵)
16 eqid 2769 . . . . . . . . 9 (oc‘𝐾) = (oc‘𝐾)
1710, 16opoccl 39853 . . . . . . . 8 ((𝐾 ∈ OP ∧ ((lub‘𝐾)‘((⊥𝑃𝐾)‘𝑋)) ∈ 𝐵) → ((oc‘𝐾)‘((lub‘𝐾)‘((⊥𝑃𝐾)‘𝑋))) ∈ 𝐵)
186, 15, 17syl2anc 595 . . . . . . 7 ((𝐾 ∈ HL ∧ 𝑋 ⊆ (Atoms‘𝐾)) → ((oc‘𝐾)‘((lub‘𝐾)‘((⊥𝑃𝐾)‘𝑋))) ∈ 𝐵)
1918ex 417 . . . . . 6 (𝐾 ∈ HL → (𝑋 ⊆ (Atoms‘𝐾) → ((oc‘𝐾)‘((lub‘𝐾)‘((⊥𝑃𝐾)‘𝑋))) ∈ 𝐵))
2019adantrd 496 . . . . 5 (𝐾 ∈ HL → ((𝑋 ⊆ (Atoms‘𝐾) ∧ ((⊥𝑃𝐾)‘((⊥𝑃𝐾)‘𝑋)) = 𝑋) → ((oc‘𝐾)‘((lub‘𝐾)‘((⊥𝑃𝐾)‘𝑋))) ∈ 𝐵))
21 pmapsubcl.m . . . . . . . . . 10 𝑀 = (pmap‘𝐾)
2213, 16, 1, 21, 2polval2N 40565 . . . . . . . . 9 ((𝐾 ∈ HL ∧ ((⊥𝑃𝐾)‘𝑋) ⊆ (Atoms‘𝐾)) → ((⊥𝑃𝐾)‘((⊥𝑃𝐾)‘𝑋)) = (𝑀‘((oc‘𝐾)‘((lub‘𝐾)‘((⊥𝑃𝐾)‘𝑋)))))
239, 22syldan 602 . . . . . . . 8 ((𝐾 ∈ HL ∧ 𝑋 ⊆ (Atoms‘𝐾)) → ((⊥𝑃𝐾)‘((⊥𝑃𝐾)‘𝑋)) = (𝑀‘((oc‘𝐾)‘((lub‘𝐾)‘((⊥𝑃𝐾)‘𝑋)))))
2423ex 417 . . . . . . 7 (𝐾 ∈ HL → (𝑋 ⊆ (Atoms‘𝐾) → ((⊥𝑃𝐾)‘((⊥𝑃𝐾)‘𝑋)) = (𝑀‘((oc‘𝐾)‘((lub‘𝐾)‘((⊥𝑃𝐾)‘𝑋))))))
25 eqeq1 2773 . . . . . . . 8 (((⊥𝑃𝐾)‘((⊥𝑃𝐾)‘𝑋)) = 𝑋 → (((⊥𝑃𝐾)‘((⊥𝑃𝐾)‘𝑋)) = (𝑀‘((oc‘𝐾)‘((lub‘𝐾)‘((⊥𝑃𝐾)‘𝑋)))) ↔ 𝑋 = (𝑀‘((oc‘𝐾)‘((lub‘𝐾)‘((⊥𝑃𝐾)‘𝑋))))))
2625biimpcd 252 . . . . . . 7 (((⊥𝑃𝐾)‘((⊥𝑃𝐾)‘𝑋)) = (𝑀‘((oc‘𝐾)‘((lub‘𝐾)‘((⊥𝑃𝐾)‘𝑋)))) → (((⊥𝑃𝐾)‘((⊥𝑃𝐾)‘𝑋)) = 𝑋𝑋 = (𝑀‘((oc‘𝐾)‘((lub‘𝐾)‘((⊥𝑃𝐾)‘𝑋))))))
2724, 26syl6 36 . . . . . 6 (𝐾 ∈ HL → (𝑋 ⊆ (Atoms‘𝐾) → (((⊥𝑃𝐾)‘((⊥𝑃𝐾)‘𝑋)) = 𝑋𝑋 = (𝑀‘((oc‘𝐾)‘((lub‘𝐾)‘((⊥𝑃𝐾)‘𝑋)))))))
2827impd 415 . . . . 5 (𝐾 ∈ HL → ((𝑋 ⊆ (Atoms‘𝐾) ∧ ((⊥𝑃𝐾)‘((⊥𝑃𝐾)‘𝑋)) = 𝑋) → 𝑋 = (𝑀‘((oc‘𝐾)‘((lub‘𝐾)‘((⊥𝑃𝐾)‘𝑋))))))
2920, 28jcad 521 . . . 4 (𝐾 ∈ HL → ((𝑋 ⊆ (Atoms‘𝐾) ∧ ((⊥𝑃𝐾)‘((⊥𝑃𝐾)‘𝑋)) = 𝑋) → (((oc‘𝐾)‘((lub‘𝐾)‘((⊥𝑃𝐾)‘𝑋))) ∈ 𝐵𝑋 = (𝑀‘((oc‘𝐾)‘((lub‘𝐾)‘((⊥𝑃𝐾)‘𝑋)))))))
30 fveq2 6879 . . . . 5 (𝑦 = ((oc‘𝐾)‘((lub‘𝐾)‘((⊥𝑃𝐾)‘𝑋))) → (𝑀𝑦) = (𝑀‘((oc‘𝐾)‘((lub‘𝐾)‘((⊥𝑃𝐾)‘𝑋)))))
3130rspceeqv 3613 . . . 4 ((((oc‘𝐾)‘((lub‘𝐾)‘((⊥𝑃𝐾)‘𝑋))) ∈ 𝐵𝑋 = (𝑀‘((oc‘𝐾)‘((lub‘𝐾)‘((⊥𝑃𝐾)‘𝑋))))) → ∃𝑦𝐵 𝑋 = (𝑀𝑦))
3229, 31syl6 36 . . 3 (𝐾 ∈ HL → ((𝑋 ⊆ (Atoms‘𝐾) ∧ ((⊥𝑃𝐾)‘((⊥𝑃𝐾)‘𝑋)) = 𝑋) → ∃𝑦𝐵 𝑋 = (𝑀𝑦)))
3310, 1, 21pmapssat 40418 . . . . 5 ((𝐾 ∈ HL ∧ 𝑦𝐵) → (𝑀𝑦) ⊆ (Atoms‘𝐾))
3410, 21, 22polpmapN 40572 . . . . 5 ((𝐾 ∈ HL ∧ 𝑦𝐵) → ((⊥𝑃𝐾)‘((⊥𝑃𝐾)‘(𝑀𝑦))) = (𝑀𝑦))
35 sseq1 3970 . . . . . . 7 (𝑋 = (𝑀𝑦) → (𝑋 ⊆ (Atoms‘𝐾) ↔ (𝑀𝑦) ⊆ (Atoms‘𝐾)))
36 2fveq3 6884 . . . . . . . 8 (𝑋 = (𝑀𝑦) → ((⊥𝑃𝐾)‘((⊥𝑃𝐾)‘𝑋)) = ((⊥𝑃𝐾)‘((⊥𝑃𝐾)‘(𝑀𝑦))))
37 id 23 . . . . . . . 8 (𝑋 = (𝑀𝑦) → 𝑋 = (𝑀𝑦))
3836, 37eqeq12d 2785 . . . . . . 7 (𝑋 = (𝑀𝑦) → (((⊥𝑃𝐾)‘((⊥𝑃𝐾)‘𝑋)) = 𝑋 ↔ ((⊥𝑃𝐾)‘((⊥𝑃𝐾)‘(𝑀𝑦))) = (𝑀𝑦)))
3935, 38anbi12d 643 . . . . . 6 (𝑋 = (𝑀𝑦) → ((𝑋 ⊆ (Atoms‘𝐾) ∧ ((⊥𝑃𝐾)‘((⊥𝑃𝐾)‘𝑋)) = 𝑋) ↔ ((𝑀𝑦) ⊆ (Atoms‘𝐾) ∧ ((⊥𝑃𝐾)‘((⊥𝑃𝐾)‘(𝑀𝑦))) = (𝑀𝑦))))
4039biimprcd 253 . . . . 5 (((𝑀𝑦) ⊆ (Atoms‘𝐾) ∧ ((⊥𝑃𝐾)‘((⊥𝑃𝐾)‘(𝑀𝑦))) = (𝑀𝑦)) → (𝑋 = (𝑀𝑦) → (𝑋 ⊆ (Atoms‘𝐾) ∧ ((⊥𝑃𝐾)‘((⊥𝑃𝐾)‘𝑋)) = 𝑋)))
4133, 34, 40syl2anc 595 . . . 4 ((𝐾 ∈ HL ∧ 𝑦𝐵) → (𝑋 = (𝑀𝑦) → (𝑋 ⊆ (Atoms‘𝐾) ∧ ((⊥𝑃𝐾)‘((⊥𝑃𝐾)‘𝑋)) = 𝑋)))
4241rexlimdva 3172 . . 3 (𝐾 ∈ HL → (∃𝑦𝐵 𝑋 = (𝑀𝑦) → (𝑋 ⊆ (Atoms‘𝐾) ∧ ((⊥𝑃𝐾)‘((⊥𝑃𝐾)‘𝑋)) = 𝑋)))
4332, 42impbid 215 . 2 (𝐾 ∈ HL → ((𝑋 ⊆ (Atoms‘𝐾) ∧ ((⊥𝑃𝐾)‘((⊥𝑃𝐾)‘𝑋)) = 𝑋) ↔ ∃𝑦𝐵 𝑋 = (𝑀𝑦)))
444, 43bitrd 282 1 (𝐾 ∈ HL → (𝑋𝐶 ↔ ∃𝑦𝐵 𝑋 = (𝑀𝑦)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 209  wa 400   = wceq 1567  wcel 2149  wrex 3095  wss 3913  cfv 6533  Basecbs 17265  occoc 17314  lubclub 18361  CLatccla 18550  OPcops 39831  Atomscatm 39922  HLchlt 40009  pmapcpmap 40156  𝑃cpolN 40561  PSubClcpscN 40593
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1822  ax-4 1836  ax-5 1937  ax-6 1994  ax-7 2035  ax-8 2151  ax-9 2159  ax-10 2182  ax-11 2198  ax-12 2219  ax-ext 2741  ax-rep 5239  ax-sep 5258  ax-nul 5268  ax-pow 5334  ax-pr 5402  ax-un 7730
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1103  df-tru 1570  df-fal 1580  df-ex 1807  df-nf 1811  df-sb 2098  df-mo 2573  df-eu 2603  df-clab 2748  df-cleq 2761  df-clel 2844  df-nfc 2918  df-ne 2965  df-ral 3086  df-rex 3096  df-rmo 3376  df-reu 3377  df-rab 3424  df-v 3465  df-sbc 3754  df-csb 3862  df-dif 3916  df-un 3918  df-in 3920  df-ss 3930  df-nul 4295  df-if 4490  df-pw 4566  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4874  df-iun 4959  df-iin 4960  df-br 5111  df-opab 5175  df-mpt 5194  df-id 5554  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-res 5671  df-ima 5672  df-iota 6489  df-fun 6535  df-fn 6536  df-f 6537  df-f1 6538  df-fo 6539  df-f1o 6540  df-fv 6541  df-riota 7365  df-ov 7411  df-oprab 7412  df-proset 18346  df-poset 18365  df-plt 18380  df-lub 18396  df-glb 18397  df-join 18398  df-meet 18399  df-p0 18475  df-p1 18476  df-lat 18484  df-clat 18551  df-oposet 39835  df-ol 39837  df-oml 39838  df-covers 39925  df-ats 39926  df-atl 39957  df-cvlat 39981  df-hlat 40010  df-psubsp 40162  df-pmap 40163  df-polarityN 40562  df-psubclN 40594
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator