| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > lss0cl | GIF version | ||
| Description: The zero vector belongs to every subspace. (Contributed by NM, 12-Jan-2014.) (Proof shortened by Mario Carneiro, 19-Jun-2014.) |
| Ref | Expression |
|---|---|
| lss0cl.z | ⊢ 0 = (0g‘𝑊) |
| lss0cl.s | ⊢ 𝑆 = (LSubSp‘𝑊) |
| Ref | Expression |
|---|---|
| lss0cl | ⊢ ((𝑊 ∈ LMod ∧ 𝑈 ∈ 𝑆) → 0 ∈ 𝑈) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eqid 2231 | . . . . 5 ⊢ (Scalar‘𝑊) = (Scalar‘𝑊) | |
| 2 | eqid 2231 | . . . . 5 ⊢ (Base‘(Scalar‘𝑊)) = (Base‘(Scalar‘𝑊)) | |
| 3 | eqid 2231 | . . . . 5 ⊢ (Base‘𝑊) = (Base‘𝑊) | |
| 4 | eqid 2231 | . . . . 5 ⊢ (+g‘𝑊) = (+g‘𝑊) | |
| 5 | eqid 2231 | . . . . 5 ⊢ ( ·𝑠 ‘𝑊) = ( ·𝑠 ‘𝑊) | |
| 6 | lss0cl.s | . . . . 5 ⊢ 𝑆 = (LSubSp‘𝑊) | |
| 7 | 1, 2, 3, 4, 5, 6 | islssmg 14371 | . . . 4 ⊢ (𝑊 ∈ LMod → (𝑈 ∈ 𝑆 ↔ (𝑈 ⊆ (Base‘𝑊) ∧ ∃𝑥 𝑥 ∈ 𝑈 ∧ ∀𝑎 ∈ (Base‘(Scalar‘𝑊))∀𝑏 ∈ 𝑈 ∀𝑐 ∈ 𝑈 ((𝑎( ·𝑠 ‘𝑊)𝑏)(+g‘𝑊)𝑐) ∈ 𝑈))) |
| 8 | 7 | biimpa 296 | . . 3 ⊢ ((𝑊 ∈ LMod ∧ 𝑈 ∈ 𝑆) → (𝑈 ⊆ (Base‘𝑊) ∧ ∃𝑥 𝑥 ∈ 𝑈 ∧ ∀𝑎 ∈ (Base‘(Scalar‘𝑊))∀𝑏 ∈ 𝑈 ∀𝑐 ∈ 𝑈 ((𝑎( ·𝑠 ‘𝑊)𝑏)(+g‘𝑊)𝑐) ∈ 𝑈)) |
| 9 | 8 | simp2d 1036 | . 2 ⊢ ((𝑊 ∈ LMod ∧ 𝑈 ∈ 𝑆) → ∃𝑥 𝑥 ∈ 𝑈) |
| 10 | simp1 1023 | . . . . . 6 ⊢ ((𝑊 ∈ LMod ∧ 𝑈 ∈ 𝑆 ∧ 𝑥 ∈ 𝑈) → 𝑊 ∈ LMod) | |
| 11 | 3, 6 | lsselg 14374 | . . . . . 6 ⊢ ((𝑊 ∈ LMod ∧ 𝑈 ∈ 𝑆 ∧ 𝑥 ∈ 𝑈) → 𝑥 ∈ (Base‘𝑊)) |
| 12 | lss0cl.z | . . . . . . 7 ⊢ 0 = (0g‘𝑊) | |
| 13 | eqid 2231 | . . . . . . 7 ⊢ (-g‘𝑊) = (-g‘𝑊) | |
| 14 | 3, 12, 13 | lmodsubid 14360 | . . . . . 6 ⊢ ((𝑊 ∈ LMod ∧ 𝑥 ∈ (Base‘𝑊)) → (𝑥(-g‘𝑊)𝑥) = 0 ) |
| 15 | 10, 11, 14 | syl2anc 411 | . . . . 5 ⊢ ((𝑊 ∈ LMod ∧ 𝑈 ∈ 𝑆 ∧ 𝑥 ∈ 𝑈) → (𝑥(-g‘𝑊)𝑥) = 0 ) |
| 16 | 13, 6 | lssvsubcl 14379 | . . . . . . 7 ⊢ (((𝑊 ∈ LMod ∧ 𝑈 ∈ 𝑆) ∧ (𝑥 ∈ 𝑈 ∧ 𝑥 ∈ 𝑈)) → (𝑥(-g‘𝑊)𝑥) ∈ 𝑈) |
| 17 | 16 | anabsan2 586 | . . . . . 6 ⊢ (((𝑊 ∈ LMod ∧ 𝑈 ∈ 𝑆) ∧ 𝑥 ∈ 𝑈) → (𝑥(-g‘𝑊)𝑥) ∈ 𝑈) |
| 18 | 17 | 3impa 1220 | . . . . 5 ⊢ ((𝑊 ∈ LMod ∧ 𝑈 ∈ 𝑆 ∧ 𝑥 ∈ 𝑈) → (𝑥(-g‘𝑊)𝑥) ∈ 𝑈) |
| 19 | 15, 18 | eqeltrrd 2309 | . . . 4 ⊢ ((𝑊 ∈ LMod ∧ 𝑈 ∈ 𝑆 ∧ 𝑥 ∈ 𝑈) → 0 ∈ 𝑈) |
| 20 | 19 | 3expia 1231 | . . 3 ⊢ ((𝑊 ∈ LMod ∧ 𝑈 ∈ 𝑆) → (𝑥 ∈ 𝑈 → 0 ∈ 𝑈)) |
| 21 | 20 | exlimdv 1867 | . 2 ⊢ ((𝑊 ∈ LMod ∧ 𝑈 ∈ 𝑆) → (∃𝑥 𝑥 ∈ 𝑈 → 0 ∈ 𝑈)) |
| 22 | 9, 21 | mpd 13 | 1 ⊢ ((𝑊 ∈ LMod ∧ 𝑈 ∈ 𝑆) → 0 ∈ 𝑈) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ∧ w3a 1004 = wceq 1397 ∃wex 1540 ∈ wcel 2202 ∀wral 2510 ⊆ wss 3200 ‘cfv 5326 (class class class)co 6017 Basecbs 13081 +gcplusg 13159 Scalarcsca 13162 ·𝑠 cvsca 13163 0gc0g 13338 -gcsg 13584 LModclmod 14300 LSubSpclss 14365 |
| 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 2204 ax-14 2205 ax-ext 2213 ax-coll 4204 ax-sep 4207 ax-pow 4264 ax-pr 4299 ax-un 4530 ax-setind 4635 ax-cnex 8122 ax-resscn 8123 ax-1cn 8124 ax-1re 8125 ax-icn 8126 ax-addcl 8127 ax-addrcl 8128 ax-mulcl 8129 ax-addcom 8131 ax-addass 8133 ax-i2m1 8136 ax-0lt1 8137 ax-0id 8139 ax-rnegex 8140 ax-pre-ltirr 8143 ax-pre-ltadd 8147 |
| This theorem depends on definitions: df-bi 117 df-3an 1006 df-tru 1400 df-fal 1403 df-nf 1509 df-sb 1811 df-eu 2082 df-mo 2083 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2363 df-ne 2403 df-nel 2498 df-ral 2515 df-rex 2516 df-reu 2517 df-rmo 2518 df-rab 2519 df-v 2804 df-sbc 3032 df-csb 3128 df-dif 3202 df-un 3204 df-in 3206 df-ss 3213 df-nul 3495 df-pw 3654 df-sn 3675 df-pr 3676 df-op 3678 df-uni 3894 df-int 3929 df-iun 3972 df-br 4089 df-opab 4151 df-mpt 4152 df-id 4390 df-xp 4731 df-rel 4732 df-cnv 4733 df-co 4734 df-dm 4735 df-rn 4736 df-res 4737 df-ima 4738 df-iota 5286 df-fun 5328 df-fn 5329 df-f 5330 df-f1 5331 df-fo 5332 df-f1o 5333 df-fv 5334 df-riota 5970 df-ov 6020 df-oprab 6021 df-mpo 6022 df-1st 6302 df-2nd 6303 df-pnf 8215 df-mnf 8216 df-ltxr 8218 df-inn 9143 df-2 9201 df-3 9202 df-4 9203 df-5 9204 df-6 9205 df-ndx 13084 df-slot 13085 df-base 13087 df-sets 13088 df-plusg 13172 df-mulr 13173 df-sca 13175 df-vsca 13176 df-0g 13340 df-mgm 13438 df-sgrp 13484 df-mnd 13499 df-grp 13585 df-minusg 13586 df-sbg 13587 df-mgp 13933 df-ur 13972 df-ring 14010 df-lmod 14302 df-lssm 14366 |
| This theorem is referenced by: lss0ss 14384 lssvneln0 14386 lssvscl 14388 lsssubg 14390 lssintclm 14397 lidl0cl 14496 |
| Copyright terms: Public domain | W3C validator |