| 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 2760 | . . . . . 6 ⊢ (Atoms‘𝐾) = (Atoms‘𝐾) | |
| 5 | pclid.s | . . . . . 6 ⊢ 𝑆 = (PSubSp‘𝐾) | |
| 6 | 4, 5 | psubssat 40630 | . . . . 5 ⊢ ((𝐾 ∈ 𝑉 ∧ 𝑋 ∈ 𝑆) → 𝑋 ⊆ (Atoms‘𝐾)) |
| 7 | 6 | adantr 486 | . . . 4 ⊢ (((𝐾 ∈ 𝑉 ∧ 𝑋 ∈ 𝑆) ∧ (𝑌 ⊆ 𝑋 ∧ 𝑋 ⊆ (𝑈‘𝑌))) → 𝑋 ⊆ (Atoms‘𝐾)) |
| 8 | pclid.c | . . . . 5 ⊢ 𝑈 = (PCl‘𝐾) | |
| 9 | 4, 8 | pclssN 40770 | . . . 4 ⊢ ((𝐾 ∈ 𝑉 ∧ 𝑌 ⊆ 𝑋 ∧ 𝑋 ⊆ (Atoms‘𝐾)) → (𝑈‘𝑌) ⊆ (𝑈‘𝑋)) |
| 10 | 2, 3, 7, 9 | syl3anc 1398 | . . 3 ⊢ (((𝐾 ∈ 𝑉 ∧ 𝑋 ∈ 𝑆) ∧ (𝑌 ⊆ 𝑋 ∧ 𝑋 ⊆ (𝑈‘𝑌))) → (𝑈‘𝑌) ⊆ (𝑈‘𝑋)) |
| 11 | 5, 8 | pclidN 40772 | . . . 4 ⊢ ((𝐾 ∈ 𝑉 ∧ 𝑋 ∈ 𝑆) → (𝑈‘𝑋) = 𝑋) |
| 12 | 11 | adantr 486 | . . 3 ⊢ (((𝐾 ∈ 𝑉 ∧ 𝑋 ∈ 𝑆) ∧ (𝑌 ⊆ 𝑋 ∧ 𝑋 ⊆ (𝑈‘𝑌))) → (𝑈‘𝑋) = 𝑋) |
| 13 | 10, 12 | sseqtrd 3967 | . 2 ⊢ (((𝐾 ∈ 𝑉 ∧ 𝑋 ∈ 𝑆) ∧ (𝑌 ⊆ 𝑋 ∧ 𝑋 ⊆ (𝑈‘𝑌))) → (𝑈‘𝑌) ⊆ 𝑋) |
| 14 | 1, 13 | eqssd 3948 | 1 ⊢ (((𝐾 ∈ 𝑉 ∧ 𝑋 ∈ 𝑆) ∧ (𝑌 ⊆ 𝑋 ∧ 𝑋 ⊆ (𝑈‘𝑌))) → 𝑋 = (𝑈‘𝑌)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1570 ∈ wcel 2145 ⊆ wss 3899 ‘cfv 6533 Atomscatm 40139 PSubSpcpsubsp 40372 PClcpclN 40763 |
| 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 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2732 ax-rep 5232 ax-sep 5251 ax-nul 5263 ax-pow 5330 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 2100 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-ral 3077 df-rex 3087 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-int 4908 df-iun 4953 df-br 5104 df-opab 5168 df-mpt 5187 df-id 5550 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 df-iota 6489 df-fun 6535 df-fn 6536 df-f 6537 df-f1 6538 df-fo 6539 df-f1o 6540 df-fv 6541 df-ov 7417 df-psubsp 40379 df-pclN 40764 |
| This theorem is used by: pclfinN 40776 |
| Copyright terms: Public domain | W3C validator |