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 34996
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 34995 . 2 ((𝐾𝑉𝑋𝐴) → (𝑈𝑋) = {𝑦𝑆𝑋𝑦})
51, 2atpsubN 34858 . . . 4 (𝐾𝑉𝐴𝑆)
6 sseq2 3619 . . . . 5 (𝑦 = 𝐴 → (𝑋𝑦𝑋𝐴))
76intminss 4494 . . . 4 ((𝐴𝑆𝑋𝐴) → {𝑦𝑆𝑋𝑦} ⊆ 𝐴)
85, 7sylan 488 . . 3 ((𝐾𝑉𝑋𝐴) → {𝑦𝑆𝑋𝑦} ⊆ 𝐴)
9 r19.26 3060 . . . . . . . 8 (∀𝑦𝑆 ((𝑋𝑦𝑝𝑦) ∧ (𝑋𝑦𝑞𝑦)) ↔ (∀𝑦𝑆 (𝑋𝑦𝑝𝑦) ∧ ∀𝑦𝑆 (𝑋𝑦𝑞𝑦)))
10 jcab 906 . . . . . . . . 9 ((𝑋𝑦 → (𝑝𝑦𝑞𝑦)) ↔ ((𝑋𝑦𝑝𝑦) ∧ (𝑋𝑦𝑞𝑦)))
1110ralbii 2977 . . . . . . . 8 (∀𝑦𝑆 (𝑋𝑦 → (𝑝𝑦𝑞𝑦)) ↔ ∀𝑦𝑆 ((𝑋𝑦𝑝𝑦) ∧ (𝑋𝑦𝑞𝑦)))
12 vex 3198 . . . . . . . . . 10 𝑝 ∈ V
1312elintrab 4479 . . . . . . . . 9 (𝑝 {𝑦𝑆𝑋𝑦} ↔ ∀𝑦𝑆 (𝑋𝑦𝑝𝑦))
14 vex 3198 . . . . . . . . . 10 𝑞 ∈ V
1514elintrab 4479 . . . . . . . . 9 (𝑞 {𝑦𝑆𝑋𝑦} ↔ ∀𝑦𝑆 (𝑋𝑦𝑞𝑦))
1613, 15anbi12i 732 . . . . . . . 8 ((𝑝 {𝑦𝑆𝑋𝑦} ∧ 𝑞 {𝑦𝑆𝑋𝑦}) ↔ (∀𝑦𝑆 (𝑋𝑦𝑝𝑦) ∧ ∀𝑦𝑆 (𝑋𝑦𝑞𝑦)))
179, 11, 163bitr4ri 293 . . . . . . 7 ((𝑝 {𝑦𝑆𝑋𝑦} ∧ 𝑞 {𝑦𝑆𝑋𝑦}) ↔ ∀𝑦𝑆 (𝑋𝑦 → (𝑝𝑦𝑞𝑦)))
18 simpll1 1098 . . . . . . . . . . . . . 14 ((((𝐾𝑉𝑟(le‘𝐾)(𝑝(join‘𝐾)𝑞) ∧ 𝑟𝐴) ∧ 𝑦𝑆) ∧ (𝑝𝑦𝑞𝑦)) → 𝐾𝑉)
19 simplr 791 . . . . . . . . . . . . . 14 ((((𝐾𝑉𝑟(le‘𝐾)(𝑝(join‘𝐾)𝑞) ∧ 𝑟𝐴) ∧ 𝑦𝑆) ∧ (𝑝𝑦𝑞𝑦)) → 𝑦𝑆)
20 simpll3 1100 . . . . . . . . . . . . . 14 ((((𝐾𝑉𝑟(le‘𝐾)(𝑝(join‘𝐾)𝑞) ∧ 𝑟𝐴) ∧ 𝑦𝑆) ∧ (𝑝𝑦𝑞𝑦)) → 𝑟𝐴)
21 simprl 793 . . . . . . . . . . . . . 14 ((((𝐾𝑉𝑟(le‘𝐾)(𝑝(join‘𝐾)𝑞) ∧ 𝑟𝐴) ∧ 𝑦𝑆) ∧ (𝑝𝑦𝑞𝑦)) → 𝑝𝑦)
22 simprr 795 . . . . . . . . . . . . . 14 ((((𝐾𝑉𝑟(le‘𝐾)(𝑝(join‘𝐾)𝑞) ∧ 𝑟𝐴) ∧ 𝑦𝑆) ∧ (𝑝𝑦𝑞𝑦)) → 𝑞𝑦)
23 simpll2 1099 . . . . . . . . . . . . . 14 ((((𝐾𝑉𝑟(le‘𝐾)(𝑝(join‘𝐾)𝑞) ∧ 𝑟𝐴) ∧ 𝑦𝑆) ∧ (𝑝𝑦𝑞𝑦)) → 𝑟(le‘𝐾)(𝑝(join‘𝐾)𝑞))
24 eqid 2620 . . . . . . . . . . . . . . 15 (le‘𝐾) = (le‘𝐾)
25 eqid 2620 . . . . . . . . . . . . . . 15 (join‘𝐾) = (join‘𝐾)
2624, 25, 1, 2psubspi2N 34853 . . . . . . . . . . . . . 14 (((𝐾𝑉𝑦𝑆𝑟𝐴) ∧ (𝑝𝑦𝑞𝑦𝑟(le‘𝐾)(𝑝(join‘𝐾)𝑞))) → 𝑟𝑦)
2718, 19, 20, 21, 22, 23, 26syl33anc 1339 . . . . . . . . . . . . 13 ((((𝐾𝑉𝑟(le‘𝐾)(𝑝(join‘𝐾)𝑞) ∧ 𝑟𝐴) ∧ 𝑦𝑆) ∧ (𝑝𝑦𝑞𝑦)) → 𝑟𝑦)
2827ex 450 . . . . . . . . . . . 12 (((𝐾𝑉𝑟(le‘𝐾)(𝑝(join‘𝐾)𝑞) ∧ 𝑟𝐴) ∧ 𝑦𝑆) → ((𝑝𝑦𝑞𝑦) → 𝑟𝑦))
2928imim2d 57 . . . . . . . . . . 11 (((𝐾𝑉𝑟(le‘𝐾)(𝑝(join‘𝐾)𝑞) ∧ 𝑟𝐴) ∧ 𝑦𝑆) → ((𝑋𝑦 → (𝑝𝑦𝑞𝑦)) → (𝑋𝑦𝑟𝑦)))
3029ralimdva 2959 . . . . . . . . . 10 ((𝐾𝑉𝑟(le‘𝐾)(𝑝(join‘𝐾)𝑞) ∧ 𝑟𝐴) → (∀𝑦𝑆 (𝑋𝑦 → (𝑝𝑦𝑞𝑦)) → ∀𝑦𝑆 (𝑋𝑦𝑟𝑦)))
31 vex 3198 . . . . . . . . . . 11 𝑟 ∈ V
3231elintrab 4479 . . . . . . . . . 10 (𝑟 {𝑦𝑆𝑋𝑦} ↔ ∀𝑦𝑆 (𝑋𝑦𝑟𝑦))
3330, 32syl6ibr 242 . . . . . . . . 9 ((𝐾𝑉𝑟(le‘𝐾)(𝑝(join‘𝐾)𝑞) ∧ 𝑟𝐴) → (∀𝑦𝑆 (𝑋𝑦 → (𝑝𝑦𝑞𝑦)) → 𝑟 {𝑦𝑆𝑋𝑦}))
34333exp 1262 . . . . . . . 8 (𝐾𝑉 → (𝑟(le‘𝐾)(𝑝(join‘𝐾)𝑞) → (𝑟𝐴 → (∀𝑦𝑆 (𝑋𝑦 → (𝑝𝑦𝑞𝑦)) → 𝑟 {𝑦𝑆𝑋𝑦}))))
3534com24 95 . . . . . . 7 (𝐾𝑉 → (∀𝑦𝑆 (𝑋𝑦 → (𝑝𝑦𝑞𝑦)) → (𝑟𝐴 → (𝑟(le‘𝐾)(𝑝(join‘𝐾)𝑞) → 𝑟 {𝑦𝑆𝑋𝑦}))))
3617, 35syl5bi 232 . . . . . 6 (𝐾𝑉 → ((𝑝 {𝑦𝑆𝑋𝑦} ∧ 𝑞 {𝑦𝑆𝑋𝑦}) → (𝑟𝐴 → (𝑟(le‘𝐾)(𝑝(join‘𝐾)𝑞) → 𝑟 {𝑦𝑆𝑋𝑦}))))
3736ralrimdv 2965 . . . . 5 (𝐾𝑉 → ((𝑝 {𝑦𝑆𝑋𝑦} ∧ 𝑞 {𝑦𝑆𝑋𝑦}) → ∀𝑟𝐴 (𝑟(le‘𝐾)(𝑝(join‘𝐾)𝑞) → 𝑟 {𝑦𝑆𝑋𝑦})))
3837ralrimivv 2967 . . . 4 (𝐾𝑉 → ∀𝑝 {𝑦𝑆𝑋𝑦}∀𝑞 {𝑦𝑆𝑋𝑦}∀𝑟𝐴 (𝑟(le‘𝐾)(𝑝(join‘𝐾)𝑞) → 𝑟 {𝑦𝑆𝑋𝑦}))
3938adantr 481 . . 3 ((𝐾𝑉𝑋𝐴) → ∀𝑝 {𝑦𝑆𝑋𝑦}∀𝑞 {𝑦𝑆𝑋𝑦}∀𝑟𝐴 (𝑟(le‘𝐾)(𝑝(join‘𝐾)𝑞) → 𝑟 {𝑦𝑆𝑋𝑦}))
4024, 25, 1, 2ispsubsp 34850 . . . 4 (𝐾𝑉 → ( {𝑦𝑆𝑋𝑦} ∈ 𝑆 ↔ ( {𝑦𝑆𝑋𝑦} ⊆ 𝐴 ∧ ∀𝑝 {𝑦𝑆𝑋𝑦}∀𝑞 {𝑦𝑆𝑋𝑦}∀𝑟𝐴 (𝑟(le‘𝐾)(𝑝(join‘𝐾)𝑞) → 𝑟 {𝑦𝑆𝑋𝑦}))))
4140adantr 481 . . 3 ((𝐾𝑉𝑋𝐴) → ( {𝑦𝑆𝑋𝑦} ∈ 𝑆 ↔ ( {𝑦𝑆𝑋𝑦} ⊆ 𝐴 ∧ ∀𝑝 {𝑦𝑆𝑋𝑦}∀𝑞 {𝑦𝑆𝑋𝑦}∀𝑟𝐴 (𝑟(le‘𝐾)(𝑝(join‘𝐾)𝑞) → 𝑟 {𝑦𝑆𝑋𝑦}))))
428, 39, 41mpbir2and 956 . 2 ((𝐾𝑉𝑋𝐴) → {𝑦𝑆𝑋𝑦} ∈ 𝑆)
434, 42eqeltrd 2699 1 ((𝐾𝑉𝑋𝐴) → (𝑈𝑋) ∈ 𝑆)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 196  wa 384  w3a 1036   = wceq 1481  wcel 1988  wral 2909  {crab 2913  wss 3567   cint 4466   class class class wbr 4644  cfv 5876  (class class class)co 6635  lecple 15929  joincjn 16925  Atomscatm 34369  PSubSpcpsubsp 34601  PClcpclN 34992
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1720  ax-4 1735  ax-5 1837  ax-6 1886  ax-7 1933  ax-8 1990  ax-9 1997  ax-10 2017  ax-11 2032  ax-12 2045  ax-13 2244  ax-ext 2600  ax-rep 4762  ax-sep 4772  ax-nul 4780  ax-pow 4834  ax-pr 4897
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1038  df-tru 1484  df-ex 1703  df-nf 1708  df-sb 1879  df-eu 2472  df-mo 2473  df-clab 2607  df-cleq 2613  df-clel 2616  df-nfc 2751  df-ne 2792  df-ral 2914  df-rex 2915  df-reu 2916  df-rab 2918  df-v 3197  df-sbc 3430  df-csb 3527  df-dif 3570  df-un 3572  df-in 3574  df-ss 3581  df-nul 3908  df-if 4078  df-pw 4151  df-sn 4169  df-pr 4171  df-op 4175  df-uni 4428  df-int 4467  df-iun 4513  df-br 4645  df-opab 4704  df-mpt 4721  df-id 5014  df-xp 5110  df-rel 5111  df-cnv 5112  df-co 5113  df-dm 5114  df-rn 5115  df-res 5116  df-ima 5117  df-iota 5839  df-fun 5878  df-fn 5879  df-f 5880  df-f1 5881  df-fo 5882  df-f1o 5883  df-fv 5884  df-ov 6638  df-psubsp 34608  df-pclN 34993
This theorem is referenced by:  pclunN  35003  pclfinN  35005
  Copyright terms: Public domain W3C validator