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 40439
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 2739 . . 3 (Atoms‘𝐾) = (Atoms‘𝐾)
2 eqid 2739 . . 3 (⊥𝑃𝐾) = (⊥𝑃𝐾)
3 pmapsubcl.c . . 3 𝐶 = (PSubCl‘𝐾)
41, 2, 3ispsubclN 40429 . 2 (𝐾 ∈ HL → (𝑋𝐶 ↔ (𝑋 ⊆ (Atoms‘𝐾) ∧ ((⊥𝑃𝐾)‘((⊥𝑃𝐾)‘𝑋)) = 𝑋)))
5 hlop 39854 . . . . . . . . 9 (𝐾 ∈ HL → 𝐾 ∈ OP)
65adantr 481 . . . . . . . 8 ((𝐾 ∈ HL ∧ 𝑋 ⊆ (Atoms‘𝐾)) → 𝐾 ∈ OP)
7 hlclat 39850 . . . . . . . . . 10 (𝐾 ∈ HL → 𝐾 ∈ CLat)
87adantr 481 . . . . . . . . 9 ((𝐾 ∈ HL ∧ 𝑋 ⊆ (Atoms‘𝐾)) → 𝐾 ∈ CLat)
91, 2polssatN 40400 . . . . . . . . . 10 ((𝐾 ∈ HL ∧ 𝑋 ⊆ (Atoms‘𝐾)) → ((⊥𝑃𝐾)‘𝑋) ⊆ (Atoms‘𝐾))
10 pmapsubcl.b . . . . . . . . . . 11 𝐵 = (Base‘𝐾)
1110, 1atssbase 39782 . . . . . . . . . 10 (Atoms‘𝐾) ⊆ 𝐵
129, 11sstrdi 3927 . . . . . . . . 9 ((𝐾 ∈ HL ∧ 𝑋 ⊆ (Atoms‘𝐾)) → ((⊥𝑃𝐾)‘𝑋) ⊆ 𝐵)
13 eqid 2739 . . . . . . . . . 10 (lub‘𝐾) = (lub‘𝐾)
1410, 13clatlubcl 18460 . . . . . . . . 9 ((𝐾 ∈ CLat ∧ ((⊥𝑃𝐾)‘𝑋) ⊆ 𝐵) → ((lub‘𝐾)‘((⊥𝑃𝐾)‘𝑋)) ∈ 𝐵)
158, 12, 14syl2anc 590 . . . . . . . 8 ((𝐾 ∈ HL ∧ 𝑋 ⊆ (Atoms‘𝐾)) → ((lub‘𝐾)‘((⊥𝑃𝐾)‘𝑋)) ∈ 𝐵)
16 eqid 2739 . . . . . . . . 9 (oc‘𝐾) = (oc‘𝐾)
1710, 16opoccl 39686 . . . . . . . 8 ((𝐾 ∈ OP ∧ ((lub‘𝐾)‘((⊥𝑃𝐾)‘𝑋)) ∈ 𝐵) → ((oc‘𝐾)‘((lub‘𝐾)‘((⊥𝑃𝐾)‘𝑋))) ∈ 𝐵)
186, 15, 17syl2anc 590 . . . . . . 7 ((𝐾 ∈ HL ∧ 𝑋 ⊆ (Atoms‘𝐾)) → ((oc‘𝐾)‘((lub‘𝐾)‘((⊥𝑃𝐾)‘𝑋))) ∈ 𝐵)
1918ex 413 . . . . . 6 (𝐾 ∈ HL → (𝑋 ⊆ (Atoms‘𝐾) → ((oc‘𝐾)‘((lub‘𝐾)‘((⊥𝑃𝐾)‘𝑋))) ∈ 𝐵))
2019adantrd 492 . . . . 5 (𝐾 ∈ HL → ((𝑋 ⊆ (Atoms‘𝐾) ∧ ((⊥𝑃𝐾)‘((⊥𝑃𝐾)‘𝑋)) = 𝑋) → ((oc‘𝐾)‘((lub‘𝐾)‘((⊥𝑃𝐾)‘𝑋))) ∈ 𝐵))
21 pmapsubcl.m . . . . . . . . . 10 𝑀 = (pmap‘𝐾)
2213, 16, 1, 21, 2polval2N 40398 . . . . . . . . 9 ((𝐾 ∈ HL ∧ ((⊥𝑃𝐾)‘𝑋) ⊆ (Atoms‘𝐾)) → ((⊥𝑃𝐾)‘((⊥𝑃𝐾)‘𝑋)) = (𝑀‘((oc‘𝐾)‘((lub‘𝐾)‘((⊥𝑃𝐾)‘𝑋)))))
239, 22syldan 597 . . . . . . . 8 ((𝐾 ∈ HL ∧ 𝑋 ⊆ (Atoms‘𝐾)) → ((⊥𝑃𝐾)‘((⊥𝑃𝐾)‘𝑋)) = (𝑀‘((oc‘𝐾)‘((lub‘𝐾)‘((⊥𝑃𝐾)‘𝑋)))))
2423ex 413 . . . . . . 7 (𝐾 ∈ HL → (𝑋 ⊆ (Atoms‘𝐾) → ((⊥𝑃𝐾)‘((⊥𝑃𝐾)‘𝑋)) = (𝑀‘((oc‘𝐾)‘((lub‘𝐾)‘((⊥𝑃𝐾)‘𝑋))))))
25 eqeq1 2743 . . . . . . . 8 (((⊥𝑃𝐾)‘((⊥𝑃𝐾)‘𝑋)) = 𝑋 → (((⊥𝑃𝐾)‘((⊥𝑃𝐾)‘𝑋)) = (𝑀‘((oc‘𝐾)‘((lub‘𝐾)‘((⊥𝑃𝐾)‘𝑋)))) ↔ 𝑋 = (𝑀‘((oc‘𝐾)‘((lub‘𝐾)‘((⊥𝑃𝐾)‘𝑋))))))
2625biimpcd 250 . . . . . . 7 (((⊥𝑃𝐾)‘((⊥𝑃𝐾)‘𝑋)) = (𝑀‘((oc‘𝐾)‘((lub‘𝐾)‘((⊥𝑃𝐾)‘𝑋)))) → (((⊥𝑃𝐾)‘((⊥𝑃𝐾)‘𝑋)) = 𝑋𝑋 = (𝑀‘((oc‘𝐾)‘((lub‘𝐾)‘((⊥𝑃𝐾)‘𝑋))))))
2724, 26syl6 35 . . . . . 6 (𝐾 ∈ HL → (𝑋 ⊆ (Atoms‘𝐾) → (((⊥𝑃𝐾)‘((⊥𝑃𝐾)‘𝑋)) = 𝑋𝑋 = (𝑀‘((oc‘𝐾)‘((lub‘𝐾)‘((⊥𝑃𝐾)‘𝑋)))))))
2827impd 411 . . . . 5 (𝐾 ∈ HL → ((𝑋 ⊆ (Atoms‘𝐾) ∧ ((⊥𝑃𝐾)‘((⊥𝑃𝐾)‘𝑋)) = 𝑋) → 𝑋 = (𝑀‘((oc‘𝐾)‘((lub‘𝐾)‘((⊥𝑃𝐾)‘𝑋))))))
2920, 28jcad 517 . . . 4 (𝐾 ∈ HL → ((𝑋 ⊆ (Atoms‘𝐾) ∧ ((⊥𝑃𝐾)‘((⊥𝑃𝐾)‘𝑋)) = 𝑋) → (((oc‘𝐾)‘((lub‘𝐾)‘((⊥𝑃𝐾)‘𝑋))) ∈ 𝐵𝑋 = (𝑀‘((oc‘𝐾)‘((lub‘𝐾)‘((⊥𝑃𝐾)‘𝑋)))))))
30 fveq2 6827 . . . . 5 (𝑦 = ((oc‘𝐾)‘((lub‘𝐾)‘((⊥𝑃𝐾)‘𝑋))) → (𝑀𝑦) = (𝑀‘((oc‘𝐾)‘((lub‘𝐾)‘((⊥𝑃𝐾)‘𝑋)))))
3130rspceeqv 3583 . . . 4 ((((oc‘𝐾)‘((lub‘𝐾)‘((⊥𝑃𝐾)‘𝑋))) ∈ 𝐵𝑋 = (𝑀‘((oc‘𝐾)‘((lub‘𝐾)‘((⊥𝑃𝐾)‘𝑋))))) → ∃𝑦𝐵 𝑋 = (𝑀𝑦))
3229, 31syl6 35 . . 3 (𝐾 ∈ HL → ((𝑋 ⊆ (Atoms‘𝐾) ∧ ((⊥𝑃𝐾)‘((⊥𝑃𝐾)‘𝑋)) = 𝑋) → ∃𝑦𝐵 𝑋 = (𝑀𝑦)))
3310, 1, 21pmapssat 40251 . . . . 5 ((𝐾 ∈ HL ∧ 𝑦𝐵) → (𝑀𝑦) ⊆ (Atoms‘𝐾))
3410, 21, 22polpmapN 40405 . . . . 5 ((𝐾 ∈ HL ∧ 𝑦𝐵) → ((⊥𝑃𝐾)‘((⊥𝑃𝐾)‘(𝑀𝑦))) = (𝑀𝑦))
35 sseq1 3940 . . . . . . 7 (𝑋 = (𝑀𝑦) → (𝑋 ⊆ (Atoms‘𝐾) ↔ (𝑀𝑦) ⊆ (Atoms‘𝐾)))
36 2fveq3 6832 . . . . . . . 8 (𝑋 = (𝑀𝑦) → ((⊥𝑃𝐾)‘((⊥𝑃𝐾)‘𝑋)) = ((⊥𝑃𝐾)‘((⊥𝑃𝐾)‘(𝑀𝑦))))
37 id 22 . . . . . . . 8 (𝑋 = (𝑀𝑦) → 𝑋 = (𝑀𝑦))
3836, 37eqeq12d 2755 . . . . . . 7 (𝑋 = (𝑀𝑦) → (((⊥𝑃𝐾)‘((⊥𝑃𝐾)‘𝑋)) = 𝑋 ↔ ((⊥𝑃𝐾)‘((⊥𝑃𝐾)‘(𝑀𝑦))) = (𝑀𝑦)))
3935, 38anbi12d 638 . . . . . 6 (𝑋 = (𝑀𝑦) → ((𝑋 ⊆ (Atoms‘𝐾) ∧ ((⊥𝑃𝐾)‘((⊥𝑃𝐾)‘𝑋)) = 𝑋) ↔ ((𝑀𝑦) ⊆ (Atoms‘𝐾) ∧ ((⊥𝑃𝐾)‘((⊥𝑃𝐾)‘(𝑀𝑦))) = (𝑀𝑦))))
4039biimprcd 251 . . . . 5 (((𝑀𝑦) ⊆ (Atoms‘𝐾) ∧ ((⊥𝑃𝐾)‘((⊥𝑃𝐾)‘(𝑀𝑦))) = (𝑀𝑦)) → (𝑋 = (𝑀𝑦) → (𝑋 ⊆ (Atoms‘𝐾) ∧ ((⊥𝑃𝐾)‘((⊥𝑃𝐾)‘𝑋)) = 𝑋)))
4133, 34, 40syl2anc 590 . . . 4 ((𝐾 ∈ HL ∧ 𝑦𝐵) → (𝑋 = (𝑀𝑦) → (𝑋 ⊆ (Atoms‘𝐾) ∧ ((⊥𝑃𝐾)‘((⊥𝑃𝐾)‘𝑋)) = 𝑋)))
4241rexlimdva 3140 . . 3 (𝐾 ∈ HL → (∃𝑦𝐵 𝑋 = (𝑀𝑦) → (𝑋 ⊆ (Atoms‘𝐾) ∧ ((⊥𝑃𝐾)‘((⊥𝑃𝐾)‘𝑋)) = 𝑋)))
4332, 42impbid 213 . 2 (𝐾 ∈ HL → ((𝑋 ⊆ (Atoms‘𝐾) ∧ ((⊥𝑃𝐾)‘((⊥𝑃𝐾)‘𝑋)) = 𝑋) ↔ ∃𝑦𝐵 𝑋 = (𝑀𝑦)))
444, 43bitrd 280 1 (𝐾 ∈ HL → (𝑋𝐶 ↔ ∃𝑦𝐵 𝑋 = (𝑀𝑦)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 207  wa 396   = wceq 1547  wcel 2119  wrex 3063  wss 3883  cfv 6485  Basecbs 17170  occoc 17219  lubclub 18266  CLatccla 18455  OPcops 39664  Atomscatm 39755  HLchlt 39842  pmapcpmap 39989  𝑃cpolN 40394  PSubClcpscN 40426
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1974  ax-7 2015  ax-8 2121  ax-9 2129  ax-10 2152  ax-11 2168  ax-12 2189  ax-ext 2711  ax-rep 5199  ax-sep 5218  ax-nul 5228  ax-pow 5294  ax-pr 5362  ax-un 7678
This theorem depends on definitions:  df-bi 208  df-an 397  df-or 854  df-3an 1094  df-tru 1550  df-fal 1560  df-ex 1787  df-nf 1791  df-sb 2074  df-mo 2543  df-eu 2573  df-clab 2718  df-cleq 2731  df-clel 2814  df-nfc 2888  df-ne 2935  df-ral 3054  df-rex 3064  df-rmo 3344  df-reu 3345  df-rab 3392  df-v 3433  df-sbc 3724  df-csb 3832  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-nul 4262  df-if 4455  df-pw 4531  df-sn 4556  df-pr 4558  df-op 4562  df-uni 4839  df-iun 4923  df-iin 4924  df-br 5073  df-opab 5135  df-mpt 5154  df-id 5513  df-xp 5624  df-rel 5625  df-cnv 5626  df-co 5627  df-dm 5628  df-rn 5629  df-res 5630  df-ima 5631  df-iota 6441  df-fun 6487  df-fn 6488  df-f 6489  df-f1 6490  df-fo 6491  df-f1o 6492  df-fv 6493  df-riota 7313  df-ov 7359  df-oprab 7360  df-proset 18251  df-poset 18270  df-plt 18285  df-lub 18301  df-glb 18302  df-join 18303  df-meet 18304  df-p0 18380  df-p1 18381  df-lat 18389  df-clat 18456  df-oposet 39668  df-ol 39670  df-oml 39671  df-covers 39758  df-ats 39759  df-atl 39790  df-cvlat 39814  df-hlat 39843  df-psubsp 39995  df-pmap 39996  df-polarityN 40395  df-psubclN 40427
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator