| 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 13936 | . . 3 ⊢ ((𝑊 ∈ LMod ∧ 𝑈 ∈ 𝑆) → 𝑋 ∈ LMod) | 
| 4 | eqid 2196 | . . . 4 ⊢ (𝑋 ↾s 𝑉) = (𝑋 ↾s 𝑉) | |
| 5 | eqid 2196 | . . . 4 ⊢ (Base‘𝑋) = (Base‘𝑋) | |
| 6 | lsslss.t | . . . 4 ⊢ 𝑇 = (LSubSp‘𝑋) | |
| 7 | 4, 5, 6 | islss3 13935 | . . 3 ⊢ (𝑋 ∈ LMod → (𝑉 ∈ 𝑇 ↔ (𝑉 ⊆ (Base‘𝑋) ∧ (𝑋 ↾s 𝑉) ∈ LMod))) | 
| 8 | 3, 7 | syl 14 | . 2 ⊢ ((𝑊 ∈ LMod ∧ 𝑈 ∈ 𝑆) → (𝑉 ∈ 𝑇 ↔ (𝑉 ⊆ (Base‘𝑋) ∧ (𝑋 ↾s 𝑉) ∈ LMod))) | 
| 9 | 1 | a1i 9 | . . . . 5 ⊢ ((𝑊 ∈ LMod ∧ 𝑈 ∈ 𝑆) → 𝑋 = (𝑊 ↾s 𝑈)) | 
| 10 | eqid 2196 | . . . . . 6 ⊢ (Base‘𝑊) = (Base‘𝑊) | |
| 11 | 10 | a1i 9 | . . . . 5 ⊢ ((𝑊 ∈ LMod ∧ 𝑈 ∈ 𝑆) → (Base‘𝑊) = (Base‘𝑊)) | 
| 12 | simpl 109 | . . . . 5 ⊢ ((𝑊 ∈ LMod ∧ 𝑈 ∈ 𝑆) → 𝑊 ∈ LMod) | |
| 13 | 10, 2 | lssssg 13916 | . . . . 5 ⊢ ((𝑊 ∈ LMod ∧ 𝑈 ∈ 𝑆) → 𝑈 ⊆ (Base‘𝑊)) | 
| 14 | 9, 11, 12, 13 | ressbas2d 12746 | . . . 4 ⊢ ((𝑊 ∈ LMod ∧ 𝑈 ∈ 𝑆) → 𝑈 = (Base‘𝑋)) | 
| 15 | 14 | sseq2d 3213 | . . 3 ⊢ ((𝑊 ∈ LMod ∧ 𝑈 ∈ 𝑆) → (𝑉 ⊆ 𝑈 ↔ 𝑉 ⊆ (Base‘𝑋))) | 
| 16 | 15 | anbi1d 465 | . 2 ⊢ ((𝑊 ∈ LMod ∧ 𝑈 ∈ 𝑆) → ((𝑉 ⊆ 𝑈 ∧ (𝑋 ↾s 𝑉) ∈ LMod) ↔ (𝑉 ⊆ (Base‘𝑋) ∧ (𝑋 ↾s 𝑉) ∈ LMod))) | 
| 17 | sstr2 3190 | . . . . . . 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 5932 | . . . . . . 7 ⊢ (𝑋 ↾s 𝑉) = ((𝑊 ↾s 𝑈) ↾s 𝑉) | 
| 21 | simplr 528 | . . . . . . . 8 ⊢ (((𝑊 ∈ LMod ∧ 𝑈 ∈ 𝑆) ∧ 𝑉 ⊆ 𝑈) → 𝑈 ∈ 𝑆) | |
| 22 | simpr 110 | . . . . . . . 8 ⊢ (((𝑊 ∈ LMod ∧ 𝑈 ∈ 𝑆) ∧ 𝑉 ⊆ 𝑈) → 𝑉 ⊆ 𝑈) | |
| 23 | simpll 527 | . . . . . . . 8 ⊢ (((𝑊 ∈ LMod ∧ 𝑈 ∈ 𝑆) ∧ 𝑉 ⊆ 𝑈) → 𝑊 ∈ LMod) | |
| 24 | ressabsg 12754 | . . . . . . . 8 ⊢ ((𝑈 ∈ 𝑆 ∧ 𝑉 ⊆ 𝑈 ∧ 𝑊 ∈ LMod) → ((𝑊 ↾s 𝑈) ↾s 𝑉) = (𝑊 ↾s 𝑉)) | |
| 25 | 21, 22, 23, 24 | syl3anc 1249 | . . . . . . 7 ⊢ (((𝑊 ∈ LMod ∧ 𝑈 ∈ 𝑆) ∧ 𝑉 ⊆ 𝑈) → ((𝑊 ↾s 𝑈) ↾s 𝑉) = (𝑊 ↾s 𝑉)) | 
| 26 | 20, 25 | eqtrid 2241 | . . . . . 6 ⊢ (((𝑊 ∈ LMod ∧ 𝑈 ∈ 𝑆) ∧ 𝑉 ⊆ 𝑈) → (𝑋 ↾s 𝑉) = (𝑊 ↾s 𝑉)) | 
| 27 | 26 | eleq1d 2265 | . . . . 5 ⊢ (((𝑊 ∈ LMod ∧ 𝑈 ∈ 𝑆) ∧ 𝑉 ⊆ 𝑈) → ((𝑋 ↾s 𝑉) ∈ LMod ↔ (𝑊 ↾s 𝑉) ∈ LMod)) | 
| 28 | eqid 2196 | . . . . . . 7 ⊢ (𝑊 ↾s 𝑉) = (𝑊 ↾s 𝑉) | |
| 29 | 28, 10, 2 | islss3 13935 | . . . . . 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 1364 ∈ wcel 2167 ⊆ wss 3157 ‘cfv 5258 (class class class)co 5922 Basecbs 12678 ↾s cress 12679 LModclmod 13843 LSubSpclss 13908 | 
| 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 615 ax-in2 616 ax-io 710 ax-5 1461 ax-7 1462 ax-gen 1463 ax-ie1 1507 ax-ie2 1508 ax-8 1518 ax-10 1519 ax-11 1520 ax-i12 1521 ax-bndl 1523 ax-4 1524 ax-17 1540 ax-i9 1544 ax-ial 1548 ax-i5r 1549 ax-13 2169 ax-14 2170 ax-ext 2178 ax-coll 4148 ax-sep 4151 ax-pow 4207 ax-pr 4242 ax-un 4468 ax-setind 4573 ax-cnex 7970 ax-resscn 7971 ax-1cn 7972 ax-1re 7973 ax-icn 7974 ax-addcl 7975 ax-addrcl 7976 ax-mulcl 7977 ax-addcom 7979 ax-addass 7981 ax-i2m1 7984 ax-0lt1 7985 ax-0id 7987 ax-rnegex 7988 ax-pre-ltirr 7991 ax-pre-lttrn 7993 ax-pre-ltadd 7995 | 
| This theorem depends on definitions: df-bi 117 df-3an 982 df-tru 1367 df-fal 1370 df-nf 1475 df-sb 1777 df-eu 2048 df-mo 2049 df-clab 2183 df-cleq 2189 df-clel 2192 df-nfc 2328 df-ne 2368 df-nel 2463 df-ral 2480 df-rex 2481 df-reu 2482 df-rmo 2483 df-rab 2484 df-v 2765 df-sbc 2990 df-csb 3085 df-dif 3159 df-un 3161 df-in 3163 df-ss 3170 df-nul 3451 df-pw 3607 df-sn 3628 df-pr 3629 df-op 3631 df-uni 3840 df-int 3875 df-iun 3918 df-br 4034 df-opab 4095 df-mpt 4096 df-id 4328 df-xp 4669 df-rel 4670 df-cnv 4671 df-co 4672 df-dm 4673 df-rn 4674 df-res 4675 df-ima 4676 df-iota 5219 df-fun 5260 df-fn 5261 df-f 5262 df-f1 5263 df-fo 5264 df-f1o 5265 df-fv 5266 df-riota 5877 df-ov 5925 df-oprab 5926 df-mpo 5927 df-1st 6198 df-2nd 6199 df-pnf 8063 df-mnf 8064 df-ltxr 8066 df-inn 8991 df-2 9049 df-3 9050 df-4 9051 df-5 9052 df-6 9053 df-ndx 12681 df-slot 12682 df-base 12684 df-sets 12685 df-iress 12686 df-plusg 12768 df-mulr 12769 df-sca 12771 df-vsca 12772 df-0g 12929 df-mgm 12999 df-sgrp 13045 df-mnd 13058 df-grp 13135 df-minusg 13136 df-sbg 13137 df-subg 13300 df-mgp 13477 df-ur 13516 df-ring 13554 df-lmod 13845 df-lssm 13909 | 
| This theorem is referenced by: lsslsp 13985 | 
| Copyright terms: Public domain | W3C validator |