| 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 14254 | . . 3 ⊢ ((𝑊 ∈ LMod ∧ 𝑈 ∈ 𝑆) → 𝑈 ∈ (SubGrp‘𝑊)) |
| 3 | islss4.f | . . . . 5 ⊢ 𝐹 = (Scalar‘𝑊) | |
| 4 | islss4.t | . . . . 5 ⊢ · = ( ·𝑠 ‘𝑊) | |
| 5 | islss4.b | . . . . 5 ⊢ 𝐵 = (Base‘𝐹) | |
| 6 | 3, 4, 5, 1 | lssvscl 14252 | . . . 4 ⊢ (((𝑊 ∈ LMod ∧ 𝑈 ∈ 𝑆) ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝑈)) → (𝑎 · 𝑏) ∈ 𝑈) |
| 7 | 6 | ralrimivva 2590 | . . 3 ⊢ ((𝑊 ∈ LMod ∧ 𝑈 ∈ 𝑆) → ∀𝑎 ∈ 𝐵 ∀𝑏 ∈ 𝑈 (𝑎 · 𝑏) ∈ 𝑈) |
| 8 | 2, 7 | jca 306 | . 2 ⊢ ((𝑊 ∈ LMod ∧ 𝑈 ∈ 𝑆) → (𝑈 ∈ (SubGrp‘𝑊) ∧ ∀𝑎 ∈ 𝐵 ∀𝑏 ∈ 𝑈 (𝑎 · 𝑏) ∈ 𝑈)) |
| 9 | islss4.v | . . . . 5 ⊢ 𝑉 = (Base‘𝑊) | |
| 10 | 9 | subgss 13625 | . . . 4 ⊢ (𝑈 ∈ (SubGrp‘𝑊) → 𝑈 ⊆ 𝑉) |
| 11 | 10 | ad2antrl 490 | . . 3 ⊢ ((𝑊 ∈ LMod ∧ (𝑈 ∈ (SubGrp‘𝑊) ∧ ∀𝑎 ∈ 𝐵 ∀𝑏 ∈ 𝑈 (𝑎 · 𝑏) ∈ 𝑈)) → 𝑈 ⊆ 𝑉) |
| 12 | eqid 2207 | . . . . . 6 ⊢ (0g‘𝑊) = (0g‘𝑊) | |
| 13 | 12 | subg0cl 13633 | . . . . 5 ⊢ (𝑈 ∈ (SubGrp‘𝑊) → (0g‘𝑊) ∈ 𝑈) |
| 14 | elex2 2793 | . . . . 5 ⊢ ((0g‘𝑊) ∈ 𝑈 → ∃𝑗 𝑗 ∈ 𝑈) | |
| 15 | 13, 14 | syl 14 | . . . 4 ⊢ (𝑈 ∈ (SubGrp‘𝑊) → ∃𝑗 𝑗 ∈ 𝑈) |
| 16 | 15 | ad2antrl 490 | . . 3 ⊢ ((𝑊 ∈ LMod ∧ (𝑈 ∈ (SubGrp‘𝑊) ∧ ∀𝑎 ∈ 𝐵 ∀𝑏 ∈ 𝑈 (𝑎 · 𝑏) ∈ 𝑈)) → ∃𝑗 𝑗 ∈ 𝑈) |
| 17 | eqid 2207 | . . . . . . . . . 10 ⊢ (+g‘𝑊) = (+g‘𝑊) | |
| 18 | 17 | subgcl 13635 | . . . . . . . . 9 ⊢ ((𝑈 ∈ (SubGrp‘𝑊) ∧ (𝑎 · 𝑏) ∈ 𝑈 ∧ 𝑐 ∈ 𝑈) → ((𝑎 · 𝑏)(+g‘𝑊)𝑐) ∈ 𝑈) |
| 19 | 18 | 3exp 1205 | . . . . . . . 8 ⊢ (𝑈 ∈ (SubGrp‘𝑊) → ((𝑎 · 𝑏) ∈ 𝑈 → (𝑐 ∈ 𝑈 → ((𝑎 · 𝑏)(+g‘𝑊)𝑐) ∈ 𝑈))) |
| 20 | 19 | adantl 277 | . . . . . . 7 ⊢ ((𝑊 ∈ LMod ∧ 𝑈 ∈ (SubGrp‘𝑊)) → ((𝑎 · 𝑏) ∈ 𝑈 → (𝑐 ∈ 𝑈 → ((𝑎 · 𝑏)(+g‘𝑊)𝑐) ∈ 𝑈))) |
| 21 | 20 | ralrimdv 2587 | . . . . . 6 ⊢ ((𝑊 ∈ LMod ∧ 𝑈 ∈ (SubGrp‘𝑊)) → ((𝑎 · 𝑏) ∈ 𝑈 → ∀𝑐 ∈ 𝑈 ((𝑎 · 𝑏)(+g‘𝑊)𝑐) ∈ 𝑈)) |
| 22 | 21 | ralimdv 2576 | . . . . 5 ⊢ ((𝑊 ∈ LMod ∧ 𝑈 ∈ (SubGrp‘𝑊)) → (∀𝑏 ∈ 𝑈 (𝑎 · 𝑏) ∈ 𝑈 → ∀𝑏 ∈ 𝑈 ∀𝑐 ∈ 𝑈 ((𝑎 · 𝑏)(+g‘𝑊)𝑐) ∈ 𝑈)) |
| 23 | 22 | ralimdv 2576 | . . . 4 ⊢ ((𝑊 ∈ LMod ∧ 𝑈 ∈ (SubGrp‘𝑊)) → (∀𝑎 ∈ 𝐵 ∀𝑏 ∈ 𝑈 (𝑎 · 𝑏) ∈ 𝑈 → ∀𝑎 ∈ 𝐵 ∀𝑏 ∈ 𝑈 ∀𝑐 ∈ 𝑈 ((𝑎 · 𝑏)(+g‘𝑊)𝑐) ∈ 𝑈)) |
| 24 | 23 | impr 379 | . . 3 ⊢ ((𝑊 ∈ LMod ∧ (𝑈 ∈ (SubGrp‘𝑊) ∧ ∀𝑎 ∈ 𝐵 ∀𝑏 ∈ 𝑈 (𝑎 · 𝑏) ∈ 𝑈)) → ∀𝑎 ∈ 𝐵 ∀𝑏 ∈ 𝑈 ∀𝑐 ∈ 𝑈 ((𝑎 · 𝑏)(+g‘𝑊)𝑐) ∈ 𝑈) |
| 25 | 3, 5, 9, 17, 4, 1 | islssmg 14235 | . . . 4 ⊢ (𝑊 ∈ LMod → (𝑈 ∈ 𝑆 ↔ (𝑈 ⊆ 𝑉 ∧ ∃𝑗 𝑗 ∈ 𝑈 ∧ ∀𝑎 ∈ 𝐵 ∀𝑏 ∈ 𝑈 ∀𝑐 ∈ 𝑈 ((𝑎 · 𝑏)(+g‘𝑊)𝑐) ∈ 𝑈))) |
| 26 | 25 | adantr 276 | . . 3 ⊢ ((𝑊 ∈ LMod ∧ (𝑈 ∈ (SubGrp‘𝑊) ∧ ∀𝑎 ∈ 𝐵 ∀𝑏 ∈ 𝑈 (𝑎 · 𝑏) ∈ 𝑈)) → (𝑈 ∈ 𝑆 ↔ (𝑈 ⊆ 𝑉 ∧ ∃𝑗 𝑗 ∈ 𝑈 ∧ ∀𝑎 ∈ 𝐵 ∀𝑏 ∈ 𝑈 ∀𝑐 ∈ 𝑈 ((𝑎 · 𝑏)(+g‘𝑊)𝑐) ∈ 𝑈))) |
| 27 | 11, 16, 24, 26 | mpbir3and 1183 | . 2 ⊢ ((𝑊 ∈ LMod ∧ (𝑈 ∈ (SubGrp‘𝑊) ∧ ∀𝑎 ∈ 𝐵 ∀𝑏 ∈ 𝑈 (𝑎 · 𝑏) ∈ 𝑈)) → 𝑈 ∈ 𝑆) |
| 28 | 8, 27 | impbida 596 | 1 ⊢ (𝑊 ∈ LMod → (𝑈 ∈ 𝑆 ↔ (𝑈 ∈ (SubGrp‘𝑊) ∧ ∀𝑎 ∈ 𝐵 ∀𝑏 ∈ 𝑈 (𝑎 · 𝑏) ∈ 𝑈))) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ↔ wb 105 ∧ w3a 981 = wceq 1373 ∃wex 1516 ∈ wcel 2178 ∀wral 2486 ⊆ wss 3174 ‘cfv 5290 (class class class)co 5967 Basecbs 12947 +gcplusg 13024 Scalarcsca 13027 ·𝑠 cvsca 13028 0gc0g 13203 SubGrpcsubg 13618 LModclmod 14164 LSubSpclss 14229 |
| 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 711 ax-5 1471 ax-7 1472 ax-gen 1473 ax-ie1 1517 ax-ie2 1518 ax-8 1528 ax-10 1529 ax-11 1530 ax-i12 1531 ax-bndl 1533 ax-4 1534 ax-17 1550 ax-i9 1554 ax-ial 1558 ax-i5r 1559 ax-13 2180 ax-14 2181 ax-ext 2189 ax-coll 4175 ax-sep 4178 ax-pow 4234 ax-pr 4269 ax-un 4498 ax-setind 4603 ax-cnex 8051 ax-resscn 8052 ax-1cn 8053 ax-1re 8054 ax-icn 8055 ax-addcl 8056 ax-addrcl 8057 ax-mulcl 8058 ax-addcom 8060 ax-addass 8062 ax-i2m1 8065 ax-0lt1 8066 ax-0id 8068 ax-rnegex 8069 ax-pre-ltirr 8072 ax-pre-ltadd 8076 |
| This theorem depends on definitions: df-bi 117 df-3an 983 df-tru 1376 df-fal 1379 df-nf 1485 df-sb 1787 df-eu 2058 df-mo 2059 df-clab 2194 df-cleq 2200 df-clel 2203 df-nfc 2339 df-ne 2379 df-nel 2474 df-ral 2491 df-rex 2492 df-reu 2493 df-rmo 2494 df-rab 2495 df-v 2778 df-sbc 3006 df-csb 3102 df-dif 3176 df-un 3178 df-in 3180 df-ss 3187 df-nul 3469 df-pw 3628 df-sn 3649 df-pr 3650 df-op 3652 df-uni 3865 df-int 3900 df-iun 3943 df-br 4060 df-opab 4122 df-mpt 4123 df-id 4358 df-xp 4699 df-rel 4700 df-cnv 4701 df-co 4702 df-dm 4703 df-rn 4704 df-res 4705 df-ima 4706 df-iota 5251 df-fun 5292 df-fn 5293 df-f 5294 df-f1 5295 df-fo 5296 df-f1o 5297 df-fv 5298 df-riota 5922 df-ov 5970 df-oprab 5971 df-mpo 5972 df-1st 6249 df-2nd 6250 df-pnf 8144 df-mnf 8145 df-ltxr 8147 df-inn 9072 df-2 9130 df-3 9131 df-4 9132 df-5 9133 df-6 9134 df-ndx 12950 df-slot 12951 df-base 12953 df-sets 12954 df-iress 12955 df-plusg 13037 df-mulr 13038 df-sca 13040 df-vsca 13041 df-0g 13205 df-mgm 13303 df-sgrp 13349 df-mnd 13364 df-grp 13450 df-minusg 13451 df-sbg 13452 df-subg 13621 df-mgp 13798 df-ur 13837 df-ring 13875 df-lmod 14166 df-lssm 14230 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |