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

Theorem pclbtwnN 41220
Description: A projective subspace sandwiched between a set of atoms and the set's projective subspace closure equals the closure. (Contributed by NM, 8-Sep-2013.) (New usage is discouraged.)
Hypotheses
Ref Expression
pclid.s 𝑆 = (PSubSp‘𝐾)
pclid.c 𝑈 = (PCl‘𝐾)
Assertion
Ref Expression
pclbtwnN (((𝐾 ∈ 𝑉 ∧ 𝑋 ∈ 𝑆) ∧ (𝑌 ⊆ 𝑋 ∧ 𝑋 ⊆ (𝑈‘𝑌))) → 𝑋 = (𝑈‘𝑌))

Proof of Theorem pclbtwnN
StepHypRef Expression
1 simprr 785 . 2 (((𝐾 ∈ 𝑉 ∧ 𝑋 ∈ 𝑆) ∧ (𝑌 ⊆ 𝑋 ∧ 𝑋 ⊆ (𝑈‘𝑌))) → 𝑋 ⊆ (𝑈‘𝑌))
2 simpll 779 . . . 4 (((𝐾 ∈ 𝑉 ∧ 𝑋 ∈ 𝑆) ∧ (𝑌 ⊆ 𝑋 ∧ 𝑋 ⊆ (𝑈‘𝑌))) → 𝐾 ∈ 𝑉)
3 simprl 783 . . . 4 (((𝐾 ∈ 𝑉 ∧ 𝑋 ∈ 𝑆) ∧ (𝑌 ⊆ 𝑋 ∧ 𝑋 ⊆ (𝑈‘𝑌))) → 𝑌 ⊆ 𝑋)
4 eqid 2763 . . . . . 6 (Atoms‘𝐾) = (Atoms‘𝐾)
5 pclid.s . . . . . 6 𝑆 = (PSubSp‘𝐾)
64, 5psubssat 41077 . . . . 5 ((𝐾 ∈ 𝑉 ∧ 𝑋 ∈ 𝑆) → 𝑋 ⊆ (Atoms‘𝐾))
76adantr 486 . . . 4 (((𝐾 ∈ 𝑉 ∧ 𝑋 ∈ 𝑆) ∧ (𝑌 ⊆ 𝑋 ∧ 𝑋 ⊆ (𝑈‘𝑌))) → 𝑋 ⊆ (Atoms‘𝐾))
8 pclid.c . . . . 5 𝑈 = (PCl‘𝐾)
94, 8pclssN 41217 . . . 4 ((𝐾 ∈ 𝑉 ∧ 𝑌 ⊆ 𝑋 ∧ 𝑋 ⊆ (Atoms‘𝐾)) → (𝑈‘𝑌) ⊆ (𝑈‘𝑋))
102, 3, 7, 9syl3anc 1399 . . 3 (((𝐾 ∈ 𝑉 ∧ 𝑋 ∈ 𝑆) ∧ (𝑌 ⊆ 𝑋 ∧ 𝑋 ⊆ (𝑈‘𝑌))) → (𝑈‘𝑌) ⊆ (𝑈‘𝑋))
115, 8pclidN 41219 . . . 4 ((𝐾 ∈ 𝑉 ∧ 𝑋 ∈ 𝑆) → (𝑈‘𝑋) = 𝑋)
1211adantr 486 . . 3 (((𝐾 ∈ 𝑉 ∧ 𝑋 ∈ 𝑆) ∧ (𝑌 ⊆ 𝑋 ∧ 𝑋 ⊆ (𝑈‘𝑌))) → (𝑈‘𝑋) = 𝑋)
1310, 12sseqtrd 3949 . 2 (((𝐾 ∈ 𝑉 ∧ 𝑋 ∈ 𝑆) ∧ (𝑌 ⊆ 𝑋 ∧ 𝑋 ⊆ (𝑈‘𝑌))) → (𝑈‘𝑌) ⊆ 𝑋)
141, 13eqssd 3930 1 (((𝐾 ∈ 𝑉 ∧ 𝑋 ∈ 𝑆) ∧ (𝑌 ⊆ 𝑋 ∧ 𝑋 ⊆ (𝑈‘𝑌))) → 𝑋 = (𝑈‘𝑌))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2147   ⊆ wss 3900  ‘cfv 6566  Atomscatm 40586  PSubSpcpsubsp 40819  PClcpclN 41210
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-rep 5238  ax-sep 5255  ax-nul 5266  ax-pow 5334  ax-pr 5398
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-int 4913  df-iun 4958  df-br 5109  df-opab 5174  df-mpt 5193  df-id 5553  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-f1 6571  df-fo 6572  df-f1o 6573  df-fv 6574  df-ov 7454  df-psubsp 40826  df-pclN 41211
This theorem is used by:  pclfinN  41223
  Copyright terms: Public domain W3C validator