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

Theorem pclclN 39491
Description: Closure of the projective subspace closure function. (Contributed by NM, 8-Sep-2013.) (New usage is discouraged.)
Hypotheses
Ref Expression
pclfval.a 𝐴 = (Atoms‘𝐾)
pclfval.s 𝑆 = (PSubSp‘𝐾)
pclfval.c 𝑈 = (PCl‘𝐾)
Assertion
Ref Expression
pclclN ((𝐾𝑉𝑋𝐴) → (𝑈𝑋) ∈ 𝑆)

Proof of Theorem pclclN
Dummy variables 𝑦 𝑞 𝑝 𝑟 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 pclfval.a . . 3 𝐴 = (Atoms‘𝐾)
2 pclfval.s . . 3 𝑆 = (PSubSp‘𝐾)
3 pclfval.c . . 3 𝑈 = (PCl‘𝐾)
41, 2, 3pclvalN 39490 . 2 ((𝐾𝑉𝑋𝐴) → (𝑈𝑋) = {𝑦𝑆𝑋𝑦})
51, 2atpsubN 39353 . . . 4 (𝐾𝑉𝐴𝑆)
6 sseq2 4003 . . . . 5 (𝑦 = 𝐴 → (𝑋𝑦𝑋𝐴))
76intminss 4978 . . . 4 ((𝐴𝑆𝑋𝐴) → {𝑦𝑆𝑋𝑦} ⊆ 𝐴)
85, 7sylan 578 . . 3 ((𝐾𝑉𝑋𝐴) → {𝑦𝑆𝑋𝑦} ⊆ 𝐴)
9 r19.26 3100 . . . . . . . 8 (∀𝑦𝑆 ((𝑋𝑦𝑝𝑦) ∧ (𝑋𝑦𝑞𝑦)) ↔ (∀𝑦𝑆 (𝑋𝑦𝑝𝑦) ∧ ∀𝑦𝑆 (𝑋𝑦𝑞𝑦)))
10 jcab 516 . . . . . . . . 9 ((𝑋𝑦 → (𝑝𝑦𝑞𝑦)) ↔ ((𝑋𝑦𝑝𝑦) ∧ (𝑋𝑦𝑞𝑦)))
1110ralbii 3082 . . . . . . . 8 (∀𝑦𝑆 (𝑋𝑦 → (𝑝𝑦𝑞𝑦)) ↔ ∀𝑦𝑆 ((𝑋𝑦𝑝𝑦) ∧ (𝑋𝑦𝑞𝑦)))
12 vex 3465 . . . . . . . . . 10 𝑝 ∈ V
1312elintrab 4964 . . . . . . . . 9 (𝑝 {𝑦𝑆𝑋𝑦} ↔ ∀𝑦𝑆 (𝑋𝑦𝑝𝑦))
14 vex 3465 . . . . . . . . . 10 𝑞 ∈ V
1514elintrab 4964 . . . . . . . . 9 (𝑞 {𝑦𝑆𝑋𝑦} ↔ ∀𝑦𝑆 (𝑋𝑦𝑞𝑦))
1613, 15anbi12i 626 . . . . . . . 8 ((𝑝 {𝑦𝑆𝑋𝑦} ∧ 𝑞 {𝑦𝑆𝑋𝑦}) ↔ (∀𝑦𝑆 (𝑋𝑦𝑝𝑦) ∧ ∀𝑦𝑆 (𝑋𝑦𝑞𝑦)))
179, 11, 163bitr4ri 303 . . . . . . 7 ((𝑝 {𝑦𝑆𝑋𝑦} ∧ 𝑞 {𝑦𝑆𝑋𝑦}) ↔ ∀𝑦𝑆 (𝑋𝑦 → (𝑝𝑦𝑞𝑦)))
18 simpll1 1209 . . . . . . . . . . . . . 14 ((((𝐾𝑉𝑟(le‘𝐾)(𝑝(join‘𝐾)𝑞) ∧ 𝑟𝐴) ∧ 𝑦𝑆) ∧ (𝑝𝑦𝑞𝑦)) → 𝐾𝑉)
19 simplr 767 . . . . . . . . . . . . . 14 ((((𝐾𝑉𝑟(le‘𝐾)(𝑝(join‘𝐾)𝑞) ∧ 𝑟𝐴) ∧ 𝑦𝑆) ∧ (𝑝𝑦𝑞𝑦)) → 𝑦𝑆)
20 simpll3 1211 . . . . . . . . . . . . . 14 ((((𝐾𝑉𝑟(le‘𝐾)(𝑝(join‘𝐾)𝑞) ∧ 𝑟𝐴) ∧ 𝑦𝑆) ∧ (𝑝𝑦𝑞𝑦)) → 𝑟𝐴)
21 simprl 769 . . . . . . . . . . . . . 14 ((((𝐾𝑉𝑟(le‘𝐾)(𝑝(join‘𝐾)𝑞) ∧ 𝑟𝐴) ∧ 𝑦𝑆) ∧ (𝑝𝑦𝑞𝑦)) → 𝑝𝑦)
22 simprr 771 . . . . . . . . . . . . . 14 ((((𝐾𝑉𝑟(le‘𝐾)(𝑝(join‘𝐾)𝑞) ∧ 𝑟𝐴) ∧ 𝑦𝑆) ∧ (𝑝𝑦𝑞𝑦)) → 𝑞𝑦)
23 simpll2 1210 . . . . . . . . . . . . . 14 ((((𝐾𝑉𝑟(le‘𝐾)(𝑝(join‘𝐾)𝑞) ∧ 𝑟𝐴) ∧ 𝑦𝑆) ∧ (𝑝𝑦𝑞𝑦)) → 𝑟(le‘𝐾)(𝑝(join‘𝐾)𝑞))
24 eqid 2725 . . . . . . . . . . . . . . 15 (le‘𝐾) = (le‘𝐾)
25 eqid 2725 . . . . . . . . . . . . . . 15 (join‘𝐾) = (join‘𝐾)
2624, 25, 1, 2psubspi2N 39348 . . . . . . . . . . . . . 14 (((𝐾𝑉𝑦𝑆𝑟𝐴) ∧ (𝑝𝑦𝑞𝑦𝑟(le‘𝐾)(𝑝(join‘𝐾)𝑞))) → 𝑟𝑦)
2718, 19, 20, 21, 22, 23, 26syl33anc 1382 . . . . . . . . . . . . 13 ((((𝐾𝑉𝑟(le‘𝐾)(𝑝(join‘𝐾)𝑞) ∧ 𝑟𝐴) ∧ 𝑦𝑆) ∧ (𝑝𝑦𝑞𝑦)) → 𝑟𝑦)
2827ex 411 . . . . . . . . . . . 12 (((𝐾𝑉𝑟(le‘𝐾)(𝑝(join‘𝐾)𝑞) ∧ 𝑟𝐴) ∧ 𝑦𝑆) → ((𝑝𝑦𝑞𝑦) → 𝑟𝑦))
2928imim2d 57 . . . . . . . . . . 11 (((𝐾𝑉𝑟(le‘𝐾)(𝑝(join‘𝐾)𝑞) ∧ 𝑟𝐴) ∧ 𝑦𝑆) → ((𝑋𝑦 → (𝑝𝑦𝑞𝑦)) → (𝑋𝑦𝑟𝑦)))
3029ralimdva 3156 . . . . . . . . . 10 ((𝐾𝑉𝑟(le‘𝐾)(𝑝(join‘𝐾)𝑞) ∧ 𝑟𝐴) → (∀𝑦𝑆 (𝑋𝑦 → (𝑝𝑦𝑞𝑦)) → ∀𝑦𝑆 (𝑋𝑦𝑟𝑦)))
31 vex 3465 . . . . . . . . . . 11 𝑟 ∈ V
3231elintrab 4964 . . . . . . . . . 10 (𝑟 {𝑦𝑆𝑋𝑦} ↔ ∀𝑦𝑆 (𝑋𝑦𝑟𝑦))
3330, 32imbitrrdi 251 . . . . . . . . 9 ((𝐾𝑉𝑟(le‘𝐾)(𝑝(join‘𝐾)𝑞) ∧ 𝑟𝐴) → (∀𝑦𝑆 (𝑋𝑦 → (𝑝𝑦𝑞𝑦)) → 𝑟 {𝑦𝑆𝑋𝑦}))
34333exp 1116 . . . . . . . 8 (𝐾𝑉 → (𝑟(le‘𝐾)(𝑝(join‘𝐾)𝑞) → (𝑟𝐴 → (∀𝑦𝑆 (𝑋𝑦 → (𝑝𝑦𝑞𝑦)) → 𝑟 {𝑦𝑆𝑋𝑦}))))
3534com24 95 . . . . . . 7 (𝐾𝑉 → (∀𝑦𝑆 (𝑋𝑦 → (𝑝𝑦𝑞𝑦)) → (𝑟𝐴 → (𝑟(le‘𝐾)(𝑝(join‘𝐾)𝑞) → 𝑟 {𝑦𝑆𝑋𝑦}))))
3617, 35biimtrid 241 . . . . . 6 (𝐾𝑉 → ((𝑝 {𝑦𝑆𝑋𝑦} ∧ 𝑞 {𝑦𝑆𝑋𝑦}) → (𝑟𝐴 → (𝑟(le‘𝐾)(𝑝(join‘𝐾)𝑞) → 𝑟 {𝑦𝑆𝑋𝑦}))))
3736ralrimdv 3141 . . . . 5 (𝐾𝑉 → ((𝑝 {𝑦𝑆𝑋𝑦} ∧ 𝑞 {𝑦𝑆𝑋𝑦}) → ∀𝑟𝐴 (𝑟(le‘𝐾)(𝑝(join‘𝐾)𝑞) → 𝑟 {𝑦𝑆𝑋𝑦})))
3837ralrimivv 3188 . . . 4 (𝐾𝑉 → ∀𝑝 {𝑦𝑆𝑋𝑦}∀𝑞 {𝑦𝑆𝑋𝑦}∀𝑟𝐴 (𝑟(le‘𝐾)(𝑝(join‘𝐾)𝑞) → 𝑟 {𝑦𝑆𝑋𝑦}))
3938adantr 479 . . 3 ((𝐾𝑉𝑋𝐴) → ∀𝑝 {𝑦𝑆𝑋𝑦}∀𝑞 {𝑦𝑆𝑋𝑦}∀𝑟𝐴 (𝑟(le‘𝐾)(𝑝(join‘𝐾)𝑞) → 𝑟 {𝑦𝑆𝑋𝑦}))
4024, 25, 1, 2ispsubsp 39345 . . . 4 (𝐾𝑉 → ( {𝑦𝑆𝑋𝑦} ∈ 𝑆 ↔ ( {𝑦𝑆𝑋𝑦} ⊆ 𝐴 ∧ ∀𝑝 {𝑦𝑆𝑋𝑦}∀𝑞 {𝑦𝑆𝑋𝑦}∀𝑟𝐴 (𝑟(le‘𝐾)(𝑝(join‘𝐾)𝑞) → 𝑟 {𝑦𝑆𝑋𝑦}))))
4140adantr 479 . . 3 ((𝐾𝑉𝑋𝐴) → ( {𝑦𝑆𝑋𝑦} ∈ 𝑆 ↔ ( {𝑦𝑆𝑋𝑦} ⊆ 𝐴 ∧ ∀𝑝 {𝑦𝑆𝑋𝑦}∀𝑞 {𝑦𝑆𝑋𝑦}∀𝑟𝐴 (𝑟(le‘𝐾)(𝑝(join‘𝐾)𝑞) → 𝑟 {𝑦𝑆𝑋𝑦}))))
428, 39, 41mpbir2and 711 . 2 ((𝐾𝑉𝑋𝐴) → {𝑦𝑆𝑋𝑦} ∈ 𝑆)
434, 42eqeltrd 2825 1 ((𝐾𝑉𝑋𝐴) → (𝑈𝑋) ∈ 𝑆)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 205  wa 394  w3a 1084   = wceq 1533  wcel 2098  wral 3050  {crab 3418  wss 3944   cint 4950   class class class wbr 5149  cfv 6549  (class class class)co 7419  lecple 17243  joincjn 18306  Atomscatm 38862  PSubSpcpsubsp 39096  PClcpclN 39487
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1789  ax-4 1803  ax-5 1905  ax-6 1963  ax-7 2003  ax-8 2100  ax-9 2108  ax-10 2129  ax-11 2146  ax-12 2166  ax-ext 2696  ax-rep 5286  ax-sep 5300  ax-nul 5307  ax-pow 5365  ax-pr 5429
This theorem depends on definitions:  df-bi 206  df-an 395  df-or 846  df-3an 1086  df-tru 1536  df-fal 1546  df-ex 1774  df-nf 1778  df-sb 2060  df-mo 2528  df-eu 2557  df-clab 2703  df-cleq 2717  df-clel 2802  df-nfc 2877  df-ne 2930  df-ral 3051  df-rex 3060  df-reu 3364  df-rab 3419  df-v 3463  df-sbc 3774  df-csb 3890  df-dif 3947  df-un 3949  df-in 3951  df-ss 3961  df-nul 4323  df-if 4531  df-pw 4606  df-sn 4631  df-pr 4633  df-op 4637  df-uni 4910  df-int 4951  df-iun 4999  df-br 5150  df-opab 5212  df-mpt 5233  df-id 5576  df-xp 5684  df-rel 5685  df-cnv 5686  df-co 5687  df-dm 5688  df-rn 5689  df-res 5690  df-ima 5691  df-iota 6501  df-fun 6551  df-fn 6552  df-f 6553  df-f1 6554  df-fo 6555  df-f1o 6556  df-fv 6557  df-ov 7422  df-psubsp 39103  df-pclN 39488
This theorem is referenced by:  pclunN  39498  pclfinN  39500
  Copyright terms: Public domain W3C validator