| Mathbox for Norm Megill |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > pclbtwnN | Structured version Visualization version GIF version | ||
| 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.) |
| Ref | Expression |
|---|---|
| pclid.s | ⊢ 𝑆 = (PSubSp‘𝐾) |
| pclid.c | ⊢ 𝑈 = (PCl‘𝐾) |
| Ref | Expression |
|---|---|
| pclbtwnN | ⊢ (((𝐾 ∈ 𝑉 ∧ 𝑋 ∈ 𝑆) ∧ (𝑌 ⊆ 𝑋 ∧ 𝑋 ⊆ (𝑈‘𝑌))) → 𝑋 = (𝑈‘𝑌)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | simprr 785 | . 2 ⊢ (((𝐾 ∈ 𝑉 ∧ 𝑋 ∈ 𝑆) ∧ (𝑌 ⊆ 𝑋 ∧ 𝑋 ⊆ (𝑈‘𝑌))) → 𝑋 ⊆ (𝑈‘𝑌)) | |
| 2 | simpll 779 | . . . 4 ⊢ (((𝐾 ∈ 𝑉 ∧ 𝑋 ∈ 𝑆) ∧ (𝑌 ⊆ 𝑋 ∧ 𝑋 ⊆ (𝑈‘𝑌))) → 𝐾 ∈ 𝑉) | |
| 3 | simprl 783 | . . . 4 ⊢ (((𝐾 ∈ 𝑉 ∧ 𝑋 ∈ 𝑆) ∧ (𝑌 ⊆ 𝑋 ∧ 𝑋 ⊆ (𝑈‘𝑌))) → 𝑌 ⊆ 𝑋) | |
| 4 | eqid 2763 | . . . . . 6 ⊢ (Atoms‘𝐾) = (Atoms‘𝐾) | |
| 5 | pclid.s | . . . . . 6 ⊢ 𝑆 = (PSubSp‘𝐾) | |
| 6 | 4, 5 | psubssat 40951 | . . . . 5 ⊢ ((𝐾 ∈ 𝑉 ∧ 𝑋 ∈ 𝑆) → 𝑋 ⊆ (Atoms‘𝐾)) |
| 7 | 6 | adantr 486 | . . . 4 ⊢ (((𝐾 ∈ 𝑉 ∧ 𝑋 ∈ 𝑆) ∧ (𝑌 ⊆ 𝑋 ∧ 𝑋 ⊆ (𝑈‘𝑌))) → 𝑋 ⊆ (Atoms‘𝐾)) |
| 8 | pclid.c | . . . . 5 ⊢ 𝑈 = (PCl‘𝐾) | |
| 9 | 4, 8 | pclssN 41091 | . . . 4 ⊢ ((𝐾 ∈ 𝑉 ∧ 𝑌 ⊆ 𝑋 ∧ 𝑋 ⊆ (Atoms‘𝐾)) → (𝑈‘𝑌) ⊆ (𝑈‘𝑋)) |
| 10 | 2, 3, 7, 9 | syl3anc 1398 | . . 3 ⊢ (((𝐾 ∈ 𝑉 ∧ 𝑋 ∈ 𝑆) ∧ (𝑌 ⊆ 𝑋 ∧ 𝑋 ⊆ (𝑈‘𝑌))) → (𝑈‘𝑌) ⊆ (𝑈‘𝑋)) |
| 11 | 5, 8 | pclidN 41093 | . . . 4 ⊢ ((𝐾 ∈ 𝑉 ∧ 𝑋 ∈ 𝑆) → (𝑈‘𝑋) = 𝑋) |
| 12 | 11 | adantr 486 | . . 3 ⊢ (((𝐾 ∈ 𝑉 ∧ 𝑋 ∈ 𝑆) ∧ (𝑌 ⊆ 𝑋 ∧ 𝑋 ⊆ (𝑈‘𝑌))) → (𝑈‘𝑋) = 𝑋) |
| 13 | 10, 12 | sseqtrd 3948 | . 2 ⊢ (((𝐾 ∈ 𝑉 ∧ 𝑋 ∈ 𝑆) ∧ (𝑌 ⊆ 𝑋 ∧ 𝑋 ⊆ (𝑈‘𝑌))) → (𝑈‘𝑌) ⊆ 𝑋) |
| 14 | 1, 13 | eqssd 3929 | 1 ⊢ (((𝐾 ∈ 𝑉 ∧ 𝑋 ∈ 𝑆) ∧ (𝑌 ⊆ 𝑋 ∧ 𝑋 ⊆ (𝑈‘𝑌))) → 𝑋 = (𝑈‘𝑌)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1569 ∈ wcel 2146 ⊆ wss 3899 ‘cfv 6546 Atomscatm 40460 PSubSpcpsubsp 40693 PClcpclN 41084 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1944 ax-6 2001 ax-7 2042 ax-8 2148 ax-9 2156 ax-10 2179 ax-11 2196 ax-12 2215 ax-ext 2735 ax-rep 5234 ax-sep 5251 ax-nul 5262 ax-pow 5330 ax-pr 5394 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2101 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2838 df-nfc 2912 df-ne 2959 df-ral 3080 df-rex 3090 df-reu 3369 df-rab 3416 df-v 3455 df-sbc 3742 df-csb 3851 df-ss 3900 df-dif 4049 df-in 4093 df-un 4153 df-nul 4281 df-if 4485 df-pw 4561 df-sn 4588 df-pr 4590 df-op 4838 df-uni 4870 df-int 4910 df-iun 4955 df-br 5106 df-opab 5170 df-mpt 5189 df-id 5549 df-xp 5660 df-rel 5661 df-cnv 5662 df-co 5663 df-dm 5664 df-rn 5665 df-res 5666 df-ima 5667 df-iota 6500 df-fun 6548 df-fn 6549 df-f 6550 df-f1 6551 df-fo 6552 df-f1o 6553 df-fv 6554 df-ov 7430 df-psubsp 40700 df-pclN 41085 |
| This theorem is used by: pclfinN 41097 |
| Copyright terms: Public domain | W3C validator |