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

Theorem pclssN 37835
Description: Ordering is preserved by subspace closure. (Contributed by NM, 8-Sep-2013.) (New usage is discouraged.)
Hypotheses
Ref Expression
pclss.a 𝐴 = (Atoms‘𝐾)
pclss.c 𝑈 = (PCl‘𝐾)
Assertion
Ref Expression
pclssN ((𝐾𝑉𝑋𝑌𝑌𝐴) → (𝑈𝑋) ⊆ (𝑈𝑌))

Proof of Theorem pclssN
Dummy variable 𝑦 is distinct from all other variables.
StepHypRef Expression
1 sstr2 3924 . . . . . 6 (𝑋𝑌 → (𝑌𝑦𝑋𝑦))
213ad2ant2 1132 . . . . 5 ((𝐾𝑉𝑋𝑌𝑌𝐴) → (𝑌𝑦𝑋𝑦))
32adantr 480 . . . 4 (((𝐾𝑉𝑋𝑌𝑌𝐴) ∧ 𝑦 ∈ (PSubSp‘𝐾)) → (𝑌𝑦𝑋𝑦))
43ss2rabdv 4005 . . 3 ((𝐾𝑉𝑋𝑌𝑌𝐴) → {𝑦 ∈ (PSubSp‘𝐾) ∣ 𝑌𝑦} ⊆ {𝑦 ∈ (PSubSp‘𝐾) ∣ 𝑋𝑦})
5 intss 4897 . . 3 ({𝑦 ∈ (PSubSp‘𝐾) ∣ 𝑌𝑦} ⊆ {𝑦 ∈ (PSubSp‘𝐾) ∣ 𝑋𝑦} → {𝑦 ∈ (PSubSp‘𝐾) ∣ 𝑋𝑦} ⊆ {𝑦 ∈ (PSubSp‘𝐾) ∣ 𝑌𝑦})
64, 5syl 17 . 2 ((𝐾𝑉𝑋𝑌𝑌𝐴) → {𝑦 ∈ (PSubSp‘𝐾) ∣ 𝑋𝑦} ⊆ {𝑦 ∈ (PSubSp‘𝐾) ∣ 𝑌𝑦})
7 simp1 1134 . . 3 ((𝐾𝑉𝑋𝑌𝑌𝐴) → 𝐾𝑉)
8 sstr 3925 . . . 4 ((𝑋𝑌𝑌𝐴) → 𝑋𝐴)
983adant1 1128 . . 3 ((𝐾𝑉𝑋𝑌𝑌𝐴) → 𝑋𝐴)
10 pclss.a . . . 4 𝐴 = (Atoms‘𝐾)
11 eqid 2738 . . . 4 (PSubSp‘𝐾) = (PSubSp‘𝐾)
12 pclss.c . . . 4 𝑈 = (PCl‘𝐾)
1310, 11, 12pclvalN 37831 . . 3 ((𝐾𝑉𝑋𝐴) → (𝑈𝑋) = {𝑦 ∈ (PSubSp‘𝐾) ∣ 𝑋𝑦})
147, 9, 13syl2anc 583 . 2 ((𝐾𝑉𝑋𝑌𝑌𝐴) → (𝑈𝑋) = {𝑦 ∈ (PSubSp‘𝐾) ∣ 𝑋𝑦})
1510, 11, 12pclvalN 37831 . . 3 ((𝐾𝑉𝑌𝐴) → (𝑈𝑌) = {𝑦 ∈ (PSubSp‘𝐾) ∣ 𝑌𝑦})
16153adant2 1129 . 2 ((𝐾𝑉𝑋𝑌𝑌𝐴) → (𝑈𝑌) = {𝑦 ∈ (PSubSp‘𝐾) ∣ 𝑌𝑦})
176, 14, 163sstr4d 3964 1 ((𝐾𝑉𝑋𝑌𝑌𝐴) → (𝑈𝑋) ⊆ (𝑈𝑌))
Colors of variables: wff setvar class
Syntax hints:  wi 4  w3a 1085   = wceq 1539  wcel 2108  {crab 3067  wss 3883   cint 4876  cfv 6418  Atomscatm 37204  PSubSpcpsubsp 37437  PClcpclN 37828
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1799  ax-4 1813  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2110  ax-9 2118  ax-10 2139  ax-11 2156  ax-12 2173  ax-ext 2709  ax-rep 5205  ax-sep 5218  ax-nul 5225  ax-pow 5283  ax-pr 5347
This theorem depends on definitions:  df-bi 206  df-an 396  df-or 844  df-3an 1087  df-tru 1542  df-fal 1552  df-ex 1784  df-nf 1788  df-sb 2069  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2817  df-nfc 2888  df-ne 2943  df-ral 3068  df-rex 3069  df-reu 3070  df-rab 3072  df-v 3424  df-sbc 3712  df-csb 3829  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-nul 4254  df-if 4457  df-pw 4532  df-sn 4559  df-pr 4561  df-op 4565  df-uni 4837  df-int 4877  df-iun 4923  df-br 5071  df-opab 5133  df-mpt 5154  df-id 5480  df-xp 5586  df-rel 5587  df-cnv 5588  df-co 5589  df-dm 5590  df-rn 5591  df-res 5592  df-ima 5593  df-iota 6376  df-fun 6420  df-fn 6421  df-f 6422  df-f1 6423  df-fo 6424  df-f1o 6425  df-fv 6426  df-ov 7258  df-psubsp 37444  df-pclN 37829
This theorem is referenced by:  pclbtwnN  37838  pclunN  37839  pclfinN  37841  pclss2polN  37862  pclfinclN  37891
  Copyright terms: Public domain W3C validator