| 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 13933 | . . 3 ⊢ ((𝑊 ∈ LMod ∧ 𝑈 ∈ 𝑆) → 𝑈 ∈ (SubGrp‘𝑊)) |
| 3 | islss4.f | . . . . 5 ⊢ 𝐹 = (Scalar‘𝑊) | |
| 4 | islss4.t | . . . . 5 ⊢ · = ( ·𝑠 ‘𝑊) | |
| 5 | islss4.b | . . . . 5 ⊢ 𝐵 = (Base‘𝐹) | |
| 6 | 3, 4, 5, 1 | lssvscl 13931 | . . . 4 ⊢ (((𝑊 ∈ LMod ∧ 𝑈 ∈ 𝑆) ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝑈)) → (𝑎 · 𝑏) ∈ 𝑈) |
| 7 | 6 | ralrimivva 2579 | . . 3 ⊢ ((𝑊 ∈ LMod ∧ 𝑈 ∈ 𝑆) → ∀𝑎 ∈ 𝐵 ∀𝑏 ∈ 𝑈 (𝑎 · 𝑏) ∈ 𝑈) |
| 8 | 2, 7 | jca 306 | . 2 ⊢ ((𝑊 ∈ LMod ∧ 𝑈 ∈ 𝑆) → (𝑈 ∈ (SubGrp‘𝑊) ∧ ∀𝑎 ∈ 𝐵 ∀𝑏 ∈ 𝑈 (𝑎 · 𝑏) ∈ 𝑈)) |
| 9 | islss4.v | . . . . 5 ⊢ 𝑉 = (Base‘𝑊) | |
| 10 | 9 | subgss 13304 | . . . 4 ⊢ (𝑈 ∈ (SubGrp‘𝑊) → 𝑈 ⊆ 𝑉) |
| 11 | 10 | ad2antrl 490 | . . 3 ⊢ ((𝑊 ∈ LMod ∧ (𝑈 ∈ (SubGrp‘𝑊) ∧ ∀𝑎 ∈ 𝐵 ∀𝑏 ∈ 𝑈 (𝑎 · 𝑏) ∈ 𝑈)) → 𝑈 ⊆ 𝑉) |
| 12 | eqid 2196 | . . . . . 6 ⊢ (0g‘𝑊) = (0g‘𝑊) | |
| 13 | 12 | subg0cl 13312 | . . . . 5 ⊢ (𝑈 ∈ (SubGrp‘𝑊) → (0g‘𝑊) ∈ 𝑈) |
| 14 | elex2 2779 | . . . . 5 ⊢ ((0g‘𝑊) ∈ 𝑈 → ∃𝑗 𝑗 ∈ 𝑈) | |
| 15 | 13, 14 | syl 14 | . . . 4 ⊢ (𝑈 ∈ (SubGrp‘𝑊) → ∃𝑗 𝑗 ∈ 𝑈) |
| 16 | 15 | ad2antrl 490 | . . 3 ⊢ ((𝑊 ∈ LMod ∧ (𝑈 ∈ (SubGrp‘𝑊) ∧ ∀𝑎 ∈ 𝐵 ∀𝑏 ∈ 𝑈 (𝑎 · 𝑏) ∈ 𝑈)) → ∃𝑗 𝑗 ∈ 𝑈) |
| 17 | eqid 2196 | . . . . . . . . . 10 ⊢ (+g‘𝑊) = (+g‘𝑊) | |
| 18 | 17 | subgcl 13314 | . . . . . . . . 9 ⊢ ((𝑈 ∈ (SubGrp‘𝑊) ∧ (𝑎 · 𝑏) ∈ 𝑈 ∧ 𝑐 ∈ 𝑈) → ((𝑎 · 𝑏)(+g‘𝑊)𝑐) ∈ 𝑈) |
| 19 | 18 | 3exp 1204 | . . . . . . . 8 ⊢ (𝑈 ∈ (SubGrp‘𝑊) → ((𝑎 · 𝑏) ∈ 𝑈 → (𝑐 ∈ 𝑈 → ((𝑎 · 𝑏)(+g‘𝑊)𝑐) ∈ 𝑈))) |
| 20 | 19 | adantl 277 | . . . . . . 7 ⊢ ((𝑊 ∈ LMod ∧ 𝑈 ∈ (SubGrp‘𝑊)) → ((𝑎 · 𝑏) ∈ 𝑈 → (𝑐 ∈ 𝑈 → ((𝑎 · 𝑏)(+g‘𝑊)𝑐) ∈ 𝑈))) |
| 21 | 20 | ralrimdv 2576 | . . . . . 6 ⊢ ((𝑊 ∈ LMod ∧ 𝑈 ∈ (SubGrp‘𝑊)) → ((𝑎 · 𝑏) ∈ 𝑈 → ∀𝑐 ∈ 𝑈 ((𝑎 · 𝑏)(+g‘𝑊)𝑐) ∈ 𝑈)) |
| 22 | 21 | ralimdv 2565 | . . . . 5 ⊢ ((𝑊 ∈ LMod ∧ 𝑈 ∈ (SubGrp‘𝑊)) → (∀𝑏 ∈ 𝑈 (𝑎 · 𝑏) ∈ 𝑈 → ∀𝑏 ∈ 𝑈 ∀𝑐 ∈ 𝑈 ((𝑎 · 𝑏)(+g‘𝑊)𝑐) ∈ 𝑈)) |
| 23 | 22 | ralimdv 2565 | . . . 4 ⊢ ((𝑊 ∈ LMod ∧ 𝑈 ∈ (SubGrp‘𝑊)) → (∀𝑎 ∈ 𝐵 ∀𝑏 ∈ 𝑈 (𝑎 · 𝑏) ∈ 𝑈 → ∀𝑎 ∈ 𝐵 ∀𝑏 ∈ 𝑈 ∀𝑐 ∈ 𝑈 ((𝑎 · 𝑏)(+g‘𝑊)𝑐) ∈ 𝑈)) |
| 24 | 23 | impr 379 | . . 3 ⊢ ((𝑊 ∈ LMod ∧ (𝑈 ∈ (SubGrp‘𝑊) ∧ ∀𝑎 ∈ 𝐵 ∀𝑏 ∈ 𝑈 (𝑎 · 𝑏) ∈ 𝑈)) → ∀𝑎 ∈ 𝐵 ∀𝑏 ∈ 𝑈 ∀𝑐 ∈ 𝑈 ((𝑎 · 𝑏)(+g‘𝑊)𝑐) ∈ 𝑈) |
| 25 | 3, 5, 9, 17, 4, 1 | islssmg 13914 | . . . 4 ⊢ (𝑊 ∈ LMod → (𝑈 ∈ 𝑆 ↔ (𝑈 ⊆ 𝑉 ∧ ∃𝑗 𝑗 ∈ 𝑈 ∧ ∀𝑎 ∈ 𝐵 ∀𝑏 ∈ 𝑈 ∀𝑐 ∈ 𝑈 ((𝑎 · 𝑏)(+g‘𝑊)𝑐) ∈ 𝑈))) |
| 26 | 25 | adantr 276 | . . 3 ⊢ ((𝑊 ∈ LMod ∧ (𝑈 ∈ (SubGrp‘𝑊) ∧ ∀𝑎 ∈ 𝐵 ∀𝑏 ∈ 𝑈 (𝑎 · 𝑏) ∈ 𝑈)) → (𝑈 ∈ 𝑆 ↔ (𝑈 ⊆ 𝑉 ∧ ∃𝑗 𝑗 ∈ 𝑈 ∧ ∀𝑎 ∈ 𝐵 ∀𝑏 ∈ 𝑈 ∀𝑐 ∈ 𝑈 ((𝑎 · 𝑏)(+g‘𝑊)𝑐) ∈ 𝑈))) |
| 27 | 11, 16, 24, 26 | mpbir3and 1182 | . 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 980 = wceq 1364 ∃wex 1506 ∈ wcel 2167 ∀wral 2475 ⊆ wss 3157 ‘cfv 5258 (class class class)co 5922 Basecbs 12678 +gcplusg 12755 Scalarcsca 12758 ·𝑠 cvsca 12759 0gc0g 12927 SubGrpcsubg 13297 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-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: (None) |
| Copyright terms: Public domain | W3C validator |