| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > lsslss | GIF version | ||
| Description: The subspaces of a subspace are the smaller subspaces. (Contributed by Stefan O'Rear, 12-Dec-2014.) |
| Ref | Expression |
|---|---|
| lsslss.x | ⊢ 𝑋 = (𝑊 ↾s 𝑈) |
| lsslss.s | ⊢ 𝑆 = (LSubSp‘𝑊) |
| lsslss.t | ⊢ 𝑇 = (LSubSp‘𝑋) |
| Ref | Expression |
|---|---|
| lsslss | ⊢ ((𝑊 ∈ LMod ∧ 𝑈 ∈ 𝑆) → (𝑉 ∈ 𝑇 ↔ (𝑉 ∈ 𝑆 ∧ 𝑉 ⊆ 𝑈))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | lsslss.x | . . . 4 ⊢ 𝑋 = (𝑊 ↾s 𝑈) | |
| 2 | lsslss.s | . . . 4 ⊢ 𝑆 = (LSubSp‘𝑊) | |
| 3 | 1, 2 | lsslmod 14418 | . . 3 ⊢ ((𝑊 ∈ LMod ∧ 𝑈 ∈ 𝑆) → 𝑋 ∈ LMod) |
| 4 | eqid 2230 | . . . 4 ⊢ (𝑋 ↾s 𝑉) = (𝑋 ↾s 𝑉) | |
| 5 | eqid 2230 | . . . 4 ⊢ (Base‘𝑋) = (Base‘𝑋) | |
| 6 | lsslss.t | . . . 4 ⊢ 𝑇 = (LSubSp‘𝑋) | |
| 7 | 4, 5, 6 | islss3 14417 | . . 3 ⊢ (𝑋 ∈ LMod → (𝑉 ∈ 𝑇 ↔ (𝑉 ⊆ (Base‘𝑋) ∧ (𝑋 ↾s 𝑉) ∈ LMod))) |
| 8 | 3, 7 | syl 14 | . 2 ⊢ ((𝑊 ∈ LMod ∧ 𝑈 ∈ 𝑆) → (𝑉 ∈ 𝑇 ↔ (𝑉 ⊆ (Base‘𝑋) ∧ (𝑋 ↾s 𝑉) ∈ LMod))) |
| 9 | 1 | a1i 9 | . . . . 5 ⊢ ((𝑊 ∈ LMod ∧ 𝑈 ∈ 𝑆) → 𝑋 = (𝑊 ↾s 𝑈)) |
| 10 | eqid 2230 | . . . . . 6 ⊢ (Base‘𝑊) = (Base‘𝑊) | |
| 11 | 10 | a1i 9 | . . . . 5 ⊢ ((𝑊 ∈ LMod ∧ 𝑈 ∈ 𝑆) → (Base‘𝑊) = (Base‘𝑊)) |
| 12 | simpl 109 | . . . . 5 ⊢ ((𝑊 ∈ LMod ∧ 𝑈 ∈ 𝑆) → 𝑊 ∈ LMod) | |
| 13 | 10, 2 | lssssg 14398 | . . . . 5 ⊢ ((𝑊 ∈ LMod ∧ 𝑈 ∈ 𝑆) → 𝑈 ⊆ (Base‘𝑊)) |
| 14 | 9, 11, 12, 13 | ressbas2d 13174 | . . . 4 ⊢ ((𝑊 ∈ LMod ∧ 𝑈 ∈ 𝑆) → 𝑈 = (Base‘𝑋)) |
| 15 | 14 | sseq2d 3256 | . . 3 ⊢ ((𝑊 ∈ LMod ∧ 𝑈 ∈ 𝑆) → (𝑉 ⊆ 𝑈 ↔ 𝑉 ⊆ (Base‘𝑋))) |
| 16 | 15 | anbi1d 465 | . 2 ⊢ ((𝑊 ∈ LMod ∧ 𝑈 ∈ 𝑆) → ((𝑉 ⊆ 𝑈 ∧ (𝑋 ↾s 𝑉) ∈ LMod) ↔ (𝑉 ⊆ (Base‘𝑋) ∧ (𝑋 ↾s 𝑉) ∈ LMod))) |
| 17 | sstr2 3233 | . . . . . . 7 ⊢ (𝑉 ⊆ 𝑈 → (𝑈 ⊆ (Base‘𝑊) → 𝑉 ⊆ (Base‘𝑊))) | |
| 18 | 13, 17 | mpan9 281 | . . . . . 6 ⊢ (((𝑊 ∈ LMod ∧ 𝑈 ∈ 𝑆) ∧ 𝑉 ⊆ 𝑈) → 𝑉 ⊆ (Base‘𝑊)) |
| 19 | 18 | biantrurd 305 | . . . . 5 ⊢ (((𝑊 ∈ LMod ∧ 𝑈 ∈ 𝑆) ∧ 𝑉 ⊆ 𝑈) → ((𝑊 ↾s 𝑉) ∈ LMod ↔ (𝑉 ⊆ (Base‘𝑊) ∧ (𝑊 ↾s 𝑉) ∈ LMod))) |
| 20 | 1 | oveq1i 6033 | . . . . . . 7 ⊢ (𝑋 ↾s 𝑉) = ((𝑊 ↾s 𝑈) ↾s 𝑉) |
| 21 | simplr 529 | . . . . . . . 8 ⊢ (((𝑊 ∈ LMod ∧ 𝑈 ∈ 𝑆) ∧ 𝑉 ⊆ 𝑈) → 𝑈 ∈ 𝑆) | |
| 22 | simpr 110 | . . . . . . . 8 ⊢ (((𝑊 ∈ LMod ∧ 𝑈 ∈ 𝑆) ∧ 𝑉 ⊆ 𝑈) → 𝑉 ⊆ 𝑈) | |
| 23 | simpll 527 | . . . . . . . 8 ⊢ (((𝑊 ∈ LMod ∧ 𝑈 ∈ 𝑆) ∧ 𝑉 ⊆ 𝑈) → 𝑊 ∈ LMod) | |
| 24 | ressabsg 13182 | . . . . . . . 8 ⊢ ((𝑈 ∈ 𝑆 ∧ 𝑉 ⊆ 𝑈 ∧ 𝑊 ∈ LMod) → ((𝑊 ↾s 𝑈) ↾s 𝑉) = (𝑊 ↾s 𝑉)) | |
| 25 | 21, 22, 23, 24 | syl3anc 1273 | . . . . . . 7 ⊢ (((𝑊 ∈ LMod ∧ 𝑈 ∈ 𝑆) ∧ 𝑉 ⊆ 𝑈) → ((𝑊 ↾s 𝑈) ↾s 𝑉) = (𝑊 ↾s 𝑉)) |
| 26 | 20, 25 | eqtrid 2275 | . . . . . 6 ⊢ (((𝑊 ∈ LMod ∧ 𝑈 ∈ 𝑆) ∧ 𝑉 ⊆ 𝑈) → (𝑋 ↾s 𝑉) = (𝑊 ↾s 𝑉)) |
| 27 | 26 | eleq1d 2299 | . . . . 5 ⊢ (((𝑊 ∈ LMod ∧ 𝑈 ∈ 𝑆) ∧ 𝑉 ⊆ 𝑈) → ((𝑋 ↾s 𝑉) ∈ LMod ↔ (𝑊 ↾s 𝑉) ∈ LMod)) |
| 28 | eqid 2230 | . . . . . . 7 ⊢ (𝑊 ↾s 𝑉) = (𝑊 ↾s 𝑉) | |
| 29 | 28, 10, 2 | islss3 14417 | . . . . . 6 ⊢ (𝑊 ∈ LMod → (𝑉 ∈ 𝑆 ↔ (𝑉 ⊆ (Base‘𝑊) ∧ (𝑊 ↾s 𝑉) ∈ LMod))) |
| 30 | 29 | ad2antrr 488 | . . . . 5 ⊢ (((𝑊 ∈ LMod ∧ 𝑈 ∈ 𝑆) ∧ 𝑉 ⊆ 𝑈) → (𝑉 ∈ 𝑆 ↔ (𝑉 ⊆ (Base‘𝑊) ∧ (𝑊 ↾s 𝑉) ∈ LMod))) |
| 31 | 19, 27, 30 | 3bitr4d 220 | . . . 4 ⊢ (((𝑊 ∈ LMod ∧ 𝑈 ∈ 𝑆) ∧ 𝑉 ⊆ 𝑈) → ((𝑋 ↾s 𝑉) ∈ LMod ↔ 𝑉 ∈ 𝑆)) |
| 32 | 31 | pm5.32da 452 | . . 3 ⊢ ((𝑊 ∈ LMod ∧ 𝑈 ∈ 𝑆) → ((𝑉 ⊆ 𝑈 ∧ (𝑋 ↾s 𝑉) ∈ LMod) ↔ (𝑉 ⊆ 𝑈 ∧ 𝑉 ∈ 𝑆))) |
| 33 | 32 | biancomd 271 | . 2 ⊢ ((𝑊 ∈ LMod ∧ 𝑈 ∈ 𝑆) → ((𝑉 ⊆ 𝑈 ∧ (𝑋 ↾s 𝑉) ∈ LMod) ↔ (𝑉 ∈ 𝑆 ∧ 𝑉 ⊆ 𝑈))) |
| 34 | 8, 16, 33 | 3bitr2d 216 | 1 ⊢ ((𝑊 ∈ LMod ∧ 𝑈 ∈ 𝑆) → (𝑉 ∈ 𝑇 ↔ (𝑉 ∈ 𝑆 ∧ 𝑉 ⊆ 𝑈))) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ↔ wb 105 = wceq 1397 ∈ wcel 2201 ⊆ wss 3199 ‘cfv 5328 (class class class)co 6023 Basecbs 13105 ↾s cress 13106 LModclmod 14325 LSubSpclss 14390 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 619 ax-in2 620 ax-io 716 ax-5 1495 ax-7 1496 ax-gen 1497 ax-ie1 1541 ax-ie2 1542 ax-8 1552 ax-10 1553 ax-11 1554 ax-i12 1555 ax-bndl 1557 ax-4 1558 ax-17 1574 ax-i9 1578 ax-ial 1582 ax-i5r 1583 ax-13 2203 ax-14 2204 ax-ext 2212 ax-coll 4205 ax-sep 4208 ax-pow 4266 ax-pr 4301 ax-un 4532 ax-setind 4637 ax-cnex 8128 ax-resscn 8129 ax-1cn 8130 ax-1re 8131 ax-icn 8132 ax-addcl 8133 ax-addrcl 8134 ax-mulcl 8135 ax-addcom 8137 ax-addass 8139 ax-i2m1 8142 ax-0lt1 8143 ax-0id 8145 ax-rnegex 8146 ax-pre-ltirr 8149 ax-pre-lttrn 8151 ax-pre-ltadd 8153 |
| This theorem depends on definitions: df-bi 117 df-3an 1006 df-tru 1400 df-fal 1403 df-nf 1509 df-sb 1810 df-eu 2081 df-mo 2082 df-clab 2217 df-cleq 2223 df-clel 2226 df-nfc 2362 df-ne 2402 df-nel 2497 df-ral 2514 df-rex 2515 df-reu 2516 df-rmo 2517 df-rab 2518 df-v 2803 df-sbc 3031 df-csb 3127 df-dif 3201 df-un 3203 df-in 3205 df-ss 3212 df-nul 3494 df-pw 3655 df-sn 3676 df-pr 3677 df-op 3679 df-uni 3895 df-int 3930 df-iun 3973 df-br 4090 df-opab 4152 df-mpt 4153 df-id 4392 df-xp 4733 df-rel 4734 df-cnv 4735 df-co 4736 df-dm 4737 df-rn 4738 df-res 4739 df-ima 4740 df-iota 5288 df-fun 5330 df-fn 5331 df-f 5332 df-f1 5333 df-fo 5334 df-f1o 5335 df-fv 5336 df-riota 5976 df-ov 6026 df-oprab 6027 df-mpo 6028 df-1st 6308 df-2nd 6309 df-pnf 8221 df-mnf 8222 df-ltxr 8224 df-inn 9149 df-2 9207 df-3 9208 df-4 9209 df-5 9210 df-6 9211 df-ndx 13108 df-slot 13109 df-base 13111 df-sets 13112 df-iress 13113 df-plusg 13196 df-mulr 13197 df-sca 13199 df-vsca 13200 df-0g 13364 df-mgm 13462 df-sgrp 13508 df-mnd 13523 df-grp 13609 df-minusg 13610 df-sbg 13611 df-subg 13780 df-mgp 13958 df-ur 13997 df-ring 14035 df-lmod 14327 df-lssm 14391 |
| This theorem is referenced by: lsslsp 14467 |
| Copyright terms: Public domain | W3C validator |