| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > lmodfopnelem2 | GIF version | ||
| Description: Lemma 2 for lmodfopne 13908. (Contributed by AV, 2-Oct-2021.) |
| Ref | Expression |
|---|---|
| lmodfopne.t | ⊢ · = ( ·sf ‘𝑊) |
| lmodfopne.a | ⊢ + = (+𝑓‘𝑊) |
| lmodfopne.v | ⊢ 𝑉 = (Base‘𝑊) |
| lmodfopne.s | ⊢ 𝑆 = (Scalar‘𝑊) |
| lmodfopne.k | ⊢ 𝐾 = (Base‘𝑆) |
| lmodfopne.0 | ⊢ 0 = (0g‘𝑆) |
| lmodfopne.1 | ⊢ 1 = (1r‘𝑆) |
| Ref | Expression |
|---|---|
| lmodfopnelem2 | ⊢ ((𝑊 ∈ LMod ∧ + = · ) → ( 0 ∈ 𝑉 ∧ 1 ∈ 𝑉)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | lmodfopne.t | . . . . 5 ⊢ · = ( ·sf ‘𝑊) | |
| 2 | lmodfopne.a | . . . . 5 ⊢ + = (+𝑓‘𝑊) | |
| 3 | lmodfopne.v | . . . . 5 ⊢ 𝑉 = (Base‘𝑊) | |
| 4 | lmodfopne.s | . . . . 5 ⊢ 𝑆 = (Scalar‘𝑊) | |
| 5 | lmodfopne.k | . . . . 5 ⊢ 𝐾 = (Base‘𝑆) | |
| 6 | 1, 2, 3, 4, 5 | lmodfopnelem1 13906 | . . . 4 ⊢ ((𝑊 ∈ LMod ∧ + = · ) → 𝑉 = 𝐾) |
| 7 | 6 | ex 115 | . . 3 ⊢ (𝑊 ∈ LMod → ( + = · → 𝑉 = 𝐾)) |
| 8 | lmodfopne.0 | . . . . . 6 ⊢ 0 = (0g‘𝑆) | |
| 9 | 4, 5, 8 | lmod0cl 13896 | . . . . 5 ⊢ (𝑊 ∈ LMod → 0 ∈ 𝐾) |
| 10 | lmodfopne.1 | . . . . . 6 ⊢ 1 = (1r‘𝑆) | |
| 11 | 4, 5, 10 | lmod1cl 13897 | . . . . 5 ⊢ (𝑊 ∈ LMod → 1 ∈ 𝐾) |
| 12 | 9, 11 | jca 306 | . . . 4 ⊢ (𝑊 ∈ LMod → ( 0 ∈ 𝐾 ∧ 1 ∈ 𝐾)) |
| 13 | eleq2 2260 | . . . . 5 ⊢ (𝑉 = 𝐾 → ( 0 ∈ 𝑉 ↔ 0 ∈ 𝐾)) | |
| 14 | eleq2 2260 | . . . . 5 ⊢ (𝑉 = 𝐾 → ( 1 ∈ 𝑉 ↔ 1 ∈ 𝐾)) | |
| 15 | 13, 14 | anbi12d 473 | . . . 4 ⊢ (𝑉 = 𝐾 → (( 0 ∈ 𝑉 ∧ 1 ∈ 𝑉) ↔ ( 0 ∈ 𝐾 ∧ 1 ∈ 𝐾))) |
| 16 | 12, 15 | syl5ibrcom 157 | . . 3 ⊢ (𝑊 ∈ LMod → (𝑉 = 𝐾 → ( 0 ∈ 𝑉 ∧ 1 ∈ 𝑉))) |
| 17 | 7, 16 | syld 45 | . 2 ⊢ (𝑊 ∈ LMod → ( + = · → ( 0 ∈ 𝑉 ∧ 1 ∈ 𝑉))) |
| 18 | 17 | imp 124 | 1 ⊢ ((𝑊 ∈ LMod ∧ + = · ) → ( 0 ∈ 𝑉 ∧ 1 ∈ 𝑉)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 = wceq 1364 ∈ wcel 2167 ‘cfv 5259 Basecbs 12689 Scalarcsca 12769 0gc0g 12944 +𝑓cplusf 13022 1rcur 13541 LModclmod 13869 ·sf cscaf 13870 |
| 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 4149 ax-sep 4152 ax-pow 4208 ax-pr 4243 ax-un 4469 ax-setind 4574 ax-cnex 7973 ax-resscn 7974 ax-1cn 7975 ax-1re 7976 ax-icn 7977 ax-addcl 7978 ax-addrcl 7979 ax-mulcl 7980 ax-addcom 7982 ax-addass 7984 ax-i2m1 7987 ax-0lt1 7988 ax-0id 7990 ax-rnegex 7991 ax-pre-ltirr 7994 ax-pre-ltadd 7998 |
| 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 3452 df-pw 3608 df-sn 3629 df-pr 3630 df-op 3632 df-uni 3841 df-int 3876 df-iun 3919 df-br 4035 df-opab 4096 df-mpt 4097 df-id 4329 df-xp 4670 df-rel 4671 df-cnv 4672 df-co 4673 df-dm 4674 df-rn 4675 df-res 4676 df-ima 4677 df-iota 5220 df-fun 5261 df-fn 5262 df-f 5263 df-f1 5264 df-fo 5265 df-f1o 5266 df-fv 5267 df-riota 5878 df-ov 5926 df-oprab 5927 df-mpo 5928 df-1st 6200 df-2nd 6201 df-pnf 8066 df-mnf 8067 df-ltxr 8069 df-inn 8994 df-2 9052 df-3 9053 df-4 9054 df-5 9055 df-6 9056 df-ndx 12692 df-slot 12693 df-base 12695 df-sets 12696 df-plusg 12779 df-mulr 12780 df-sca 12782 df-vsca 12783 df-0g 12946 df-plusf 13024 df-mgm 13025 df-sgrp 13071 df-mnd 13084 df-grp 13161 df-mgp 13503 df-ur 13542 df-ring 13580 df-lmod 13871 df-scaf 13872 |
| This theorem is referenced by: lmodfopne 13908 |
| Copyright terms: Public domain | W3C validator |