| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > islss4 | GIF version | ||
| Description: A linear subspace is a subgroup which respects scalar multiplication. (Contributed by Stefan O'Rear, 11-Dec-2014.) (Revised by Mario Carneiro, 19-Apr-2016.) |
| Ref | Expression |
|---|---|
| islss4.f | ⊢ 𝐹 = (Scalar‘𝑊) |
| islss4.b | ⊢ 𝐵 = (Base‘𝐹) |
| islss4.v | ⊢ 𝑉 = (Base‘𝑊) |
| islss4.t | ⊢ · = ( ·𝑠 ‘𝑊) |
| islss4.s | ⊢ 𝑆 = (LSubSp‘𝑊) |
| Ref | Expression |
|---|---|
| islss4 | ⊢ (𝑊 ∈ LMod → (𝑈 ∈ 𝑆 ↔ (𝑈 ∈ (SubGrp‘𝑊) ∧ ∀𝑎 ∈ 𝐵 ∀𝑏 ∈ 𝑈 (𝑎 · 𝑏) ∈ 𝑈))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | islss4.s | . . . 4 ⊢ 𝑆 = (LSubSp‘𝑊) | |
| 2 | 1 | lsssubg 14456 | . . 3 ⊢ ((𝑊 ∈ LMod ∧ 𝑈 ∈ 𝑆) → 𝑈 ∈ (SubGrp‘𝑊)) |
| 3 | islss4.f | . . . . 5 ⊢ 𝐹 = (Scalar‘𝑊) | |
| 4 | islss4.t | . . . . 5 ⊢ · = ( ·𝑠 ‘𝑊) | |
| 5 | islss4.b | . . . . 5 ⊢ 𝐵 = (Base‘𝐹) | |
| 6 | 3, 4, 5, 1 | lssvscl 14454 | . . . 4 ⊢ (((𝑊 ∈ LMod ∧ 𝑈 ∈ 𝑆) ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝑈)) → (𝑎 · 𝑏) ∈ 𝑈) |
| 7 | 6 | ralrimivva 2615 | . . 3 ⊢ ((𝑊 ∈ LMod ∧ 𝑈 ∈ 𝑆) → ∀𝑎 ∈ 𝐵 ∀𝑏 ∈ 𝑈 (𝑎 · 𝑏) ∈ 𝑈) |
| 8 | 2, 7 | jca 306 | . 2 ⊢ ((𝑊 ∈ LMod ∧ 𝑈 ∈ 𝑆) → (𝑈 ∈ (SubGrp‘𝑊) ∧ ∀𝑎 ∈ 𝐵 ∀𝑏 ∈ 𝑈 (𝑎 · 𝑏) ∈ 𝑈)) |
| 9 | islss4.v | . . . . 5 ⊢ 𝑉 = (Base‘𝑊) | |
| 10 | 9 | subgss 13824 | . . . 4 ⊢ (𝑈 ∈ (SubGrp‘𝑊) → 𝑈 ⊆ 𝑉) |
| 11 | 10 | ad2antrl 490 | . . 3 ⊢ ((𝑊 ∈ LMod ∧ (𝑈 ∈ (SubGrp‘𝑊) ∧ ∀𝑎 ∈ 𝐵 ∀𝑏 ∈ 𝑈 (𝑎 · 𝑏) ∈ 𝑈)) → 𝑈 ⊆ 𝑉) |
| 12 | eqid 2231 | . . . . . 6 ⊢ (0g‘𝑊) = (0g‘𝑊) | |
| 13 | 12 | subg0cl 13832 | . . . . 5 ⊢ (𝑈 ∈ (SubGrp‘𝑊) → (0g‘𝑊) ∈ 𝑈) |
| 14 | elex2 2820 | . . . . 5 ⊢ ((0g‘𝑊) ∈ 𝑈 → ∃𝑗 𝑗 ∈ 𝑈) | |
| 15 | 13, 14 | syl 14 | . . . 4 ⊢ (𝑈 ∈ (SubGrp‘𝑊) → ∃𝑗 𝑗 ∈ 𝑈) |
| 16 | 15 | ad2antrl 490 | . . 3 ⊢ ((𝑊 ∈ LMod ∧ (𝑈 ∈ (SubGrp‘𝑊) ∧ ∀𝑎 ∈ 𝐵 ∀𝑏 ∈ 𝑈 (𝑎 · 𝑏) ∈ 𝑈)) → ∃𝑗 𝑗 ∈ 𝑈) |
| 17 | eqid 2231 | . . . . . . . . . 10 ⊢ (+g‘𝑊) = (+g‘𝑊) | |
| 18 | 17 | subgcl 13834 | . . . . . . . . 9 ⊢ ((𝑈 ∈ (SubGrp‘𝑊) ∧ (𝑎 · 𝑏) ∈ 𝑈 ∧ 𝑐 ∈ 𝑈) → ((𝑎 · 𝑏)(+g‘𝑊)𝑐) ∈ 𝑈) |
| 19 | 18 | 3exp 1229 | . . . . . . . 8 ⊢ (𝑈 ∈ (SubGrp‘𝑊) → ((𝑎 · 𝑏) ∈ 𝑈 → (𝑐 ∈ 𝑈 → ((𝑎 · 𝑏)(+g‘𝑊)𝑐) ∈ 𝑈))) |
| 20 | 19 | adantl 277 | . . . . . . 7 ⊢ ((𝑊 ∈ LMod ∧ 𝑈 ∈ (SubGrp‘𝑊)) → ((𝑎 · 𝑏) ∈ 𝑈 → (𝑐 ∈ 𝑈 → ((𝑎 · 𝑏)(+g‘𝑊)𝑐) ∈ 𝑈))) |
| 21 | 20 | ralrimdv 2612 | . . . . . 6 ⊢ ((𝑊 ∈ LMod ∧ 𝑈 ∈ (SubGrp‘𝑊)) → ((𝑎 · 𝑏) ∈ 𝑈 → ∀𝑐 ∈ 𝑈 ((𝑎 · 𝑏)(+g‘𝑊)𝑐) ∈ 𝑈)) |
| 22 | 21 | ralimdv 2601 | . . . . 5 ⊢ ((𝑊 ∈ LMod ∧ 𝑈 ∈ (SubGrp‘𝑊)) → (∀𝑏 ∈ 𝑈 (𝑎 · 𝑏) ∈ 𝑈 → ∀𝑏 ∈ 𝑈 ∀𝑐 ∈ 𝑈 ((𝑎 · 𝑏)(+g‘𝑊)𝑐) ∈ 𝑈)) |
| 23 | 22 | ralimdv 2601 | . . . 4 ⊢ ((𝑊 ∈ LMod ∧ 𝑈 ∈ (SubGrp‘𝑊)) → (∀𝑎 ∈ 𝐵 ∀𝑏 ∈ 𝑈 (𝑎 · 𝑏) ∈ 𝑈 → ∀𝑎 ∈ 𝐵 ∀𝑏 ∈ 𝑈 ∀𝑐 ∈ 𝑈 ((𝑎 · 𝑏)(+g‘𝑊)𝑐) ∈ 𝑈)) |
| 24 | 23 | impr 379 | . . 3 ⊢ ((𝑊 ∈ LMod ∧ (𝑈 ∈ (SubGrp‘𝑊) ∧ ∀𝑎 ∈ 𝐵 ∀𝑏 ∈ 𝑈 (𝑎 · 𝑏) ∈ 𝑈)) → ∀𝑎 ∈ 𝐵 ∀𝑏 ∈ 𝑈 ∀𝑐 ∈ 𝑈 ((𝑎 · 𝑏)(+g‘𝑊)𝑐) ∈ 𝑈) |
| 25 | 3, 5, 9, 17, 4, 1 | islssmg 14437 | . . . 4 ⊢ (𝑊 ∈ LMod → (𝑈 ∈ 𝑆 ↔ (𝑈 ⊆ 𝑉 ∧ ∃𝑗 𝑗 ∈ 𝑈 ∧ ∀𝑎 ∈ 𝐵 ∀𝑏 ∈ 𝑈 ∀𝑐 ∈ 𝑈 ((𝑎 · 𝑏)(+g‘𝑊)𝑐) ∈ 𝑈))) |
| 26 | 25 | adantr 276 | . . 3 ⊢ ((𝑊 ∈ LMod ∧ (𝑈 ∈ (SubGrp‘𝑊) ∧ ∀𝑎 ∈ 𝐵 ∀𝑏 ∈ 𝑈 (𝑎 · 𝑏) ∈ 𝑈)) → (𝑈 ∈ 𝑆 ↔ (𝑈 ⊆ 𝑉 ∧ ∃𝑗 𝑗 ∈ 𝑈 ∧ ∀𝑎 ∈ 𝐵 ∀𝑏 ∈ 𝑈 ∀𝑐 ∈ 𝑈 ((𝑎 · 𝑏)(+g‘𝑊)𝑐) ∈ 𝑈))) |
| 27 | 11, 16, 24, 26 | mpbir3and 1207 | . 2 ⊢ ((𝑊 ∈ LMod ∧ (𝑈 ∈ (SubGrp‘𝑊) ∧ ∀𝑎 ∈ 𝐵 ∀𝑏 ∈ 𝑈 (𝑎 · 𝑏) ∈ 𝑈)) → 𝑈 ∈ 𝑆) |
| 28 | 8, 27 | impbida 600 | 1 ⊢ (𝑊 ∈ LMod → (𝑈 ∈ 𝑆 ↔ (𝑈 ∈ (SubGrp‘𝑊) ∧ ∀𝑎 ∈ 𝐵 ∀𝑏 ∈ 𝑈 (𝑎 · 𝑏) ∈ 𝑈))) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ↔ wb 105 ∧ w3a 1005 = wceq 1398 ∃wex 1541 ∈ wcel 2202 ∀wral 2511 ⊆ wss 3201 ‘cfv 5333 (class class class)co 6028 Basecbs 13145 +gcplusg 13223 Scalarcsca 13226 ·𝑠 cvsca 13227 0gc0g 13402 SubGrpcsubg 13817 LModclmod 14366 LSubSpclss 14431 |
| 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 717 ax-5 1496 ax-7 1497 ax-gen 1498 ax-ie1 1542 ax-ie2 1543 ax-8 1553 ax-10 1554 ax-11 1555 ax-i12 1556 ax-bndl 1558 ax-4 1559 ax-17 1575 ax-i9 1579 ax-ial 1583 ax-i5r 1584 ax-13 2204 ax-14 2205 ax-ext 2213 ax-coll 4209 ax-sep 4212 ax-pow 4270 ax-pr 4305 ax-un 4536 ax-setind 4641 ax-cnex 8166 ax-resscn 8167 ax-1cn 8168 ax-1re 8169 ax-icn 8170 ax-addcl 8171 ax-addrcl 8172 ax-mulcl 8173 ax-addcom 8175 ax-addass 8177 ax-i2m1 8180 ax-0lt1 8181 ax-0id 8183 ax-rnegex 8184 ax-pre-ltirr 8187 ax-pre-ltadd 8191 |
| This theorem depends on definitions: df-bi 117 df-3an 1007 df-tru 1401 df-fal 1404 df-nf 1510 df-sb 1811 df-eu 2082 df-mo 2083 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2364 df-ne 2404 df-nel 2499 df-ral 2516 df-rex 2517 df-reu 2518 df-rmo 2519 df-rab 2520 df-v 2805 df-sbc 3033 df-csb 3129 df-dif 3203 df-un 3205 df-in 3207 df-ss 3214 df-nul 3497 df-pw 3658 df-sn 3679 df-pr 3680 df-op 3682 df-uni 3899 df-int 3934 df-iun 3977 df-br 4094 df-opab 4156 df-mpt 4157 df-id 4396 df-xp 4737 df-rel 4738 df-cnv 4739 df-co 4740 df-dm 4741 df-rn 4742 df-res 4743 df-ima 4744 df-iota 5293 df-fun 5335 df-fn 5336 df-f 5337 df-f1 5338 df-fo 5339 df-f1o 5340 df-fv 5341 df-riota 5981 df-ov 6031 df-oprab 6032 df-mpo 6033 df-1st 6312 df-2nd 6313 df-pnf 8258 df-mnf 8259 df-ltxr 8261 df-inn 9186 df-2 9244 df-3 9245 df-4 9246 df-5 9247 df-6 9248 df-ndx 13148 df-slot 13149 df-base 13151 df-sets 13152 df-iress 13153 df-plusg 13236 df-mulr 13237 df-sca 13239 df-vsca 13240 df-0g 13404 df-mgm 13502 df-sgrp 13548 df-mnd 13563 df-grp 13649 df-minusg 13650 df-sbg 13651 df-subg 13820 df-mgp 13998 df-ur 14037 df-ring 14075 df-lmod 14368 df-lssm 14432 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |