| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > lmodfopnelem2 | GIF version | ||
| Description: Lemma 2 for lmodfopne 14298. (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 14296 | . . . 4 ⊢ ((𝑊 ∈ LMod ∧ + = · ) → 𝑉 = 𝐾) |
| 7 | 6 | ex 115 | . . 3 ⊢ (𝑊 ∈ LMod → ( + = · → 𝑉 = 𝐾)) |
| 8 | lmodfopne.0 | . . . . . 6 ⊢ 0 = (0g‘𝑆) | |
| 9 | 4, 5, 8 | lmod0cl 14286 | . . . . 5 ⊢ (𝑊 ∈ LMod → 0 ∈ 𝐾) |
| 10 | lmodfopne.1 | . . . . . 6 ⊢ 1 = (1r‘𝑆) | |
| 11 | 4, 5, 10 | lmod1cl 14287 | . . . . 5 ⊢ (𝑊 ∈ LMod → 1 ∈ 𝐾) |
| 12 | 9, 11 | jca 306 | . . . 4 ⊢ (𝑊 ∈ LMod → ( 0 ∈ 𝐾 ∧ 1 ∈ 𝐾)) |
| 13 | eleq2 2293 | . . . . 5 ⊢ (𝑉 = 𝐾 → ( 0 ∈ 𝑉 ↔ 0 ∈ 𝐾)) | |
| 14 | eleq2 2293 | . . . . 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 1395 ∈ wcel 2200 ‘cfv 5318 Basecbs 13040 Scalarcsca 13121 0gc0g 13297 +𝑓cplusf 13394 1rcur 13930 LModclmod 14259 ·sf cscaf 14260 |
| 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 617 ax-in2 618 ax-io 714 ax-5 1493 ax-7 1494 ax-gen 1495 ax-ie1 1539 ax-ie2 1540 ax-8 1550 ax-10 1551 ax-11 1552 ax-i12 1553 ax-bndl 1555 ax-4 1556 ax-17 1572 ax-i9 1576 ax-ial 1580 ax-i5r 1581 ax-13 2202 ax-14 2203 ax-ext 2211 ax-coll 4199 ax-sep 4202 ax-pow 4258 ax-pr 4293 ax-un 4524 ax-setind 4629 ax-cnex 8098 ax-resscn 8099 ax-1cn 8100 ax-1re 8101 ax-icn 8102 ax-addcl 8103 ax-addrcl 8104 ax-mulcl 8105 ax-addcom 8107 ax-addass 8109 ax-i2m1 8112 ax-0lt1 8113 ax-0id 8115 ax-rnegex 8116 ax-pre-ltirr 8119 ax-pre-ltadd 8123 |
| This theorem depends on definitions: df-bi 117 df-3an 1004 df-tru 1398 df-fal 1401 df-nf 1507 df-sb 1809 df-eu 2080 df-mo 2081 df-clab 2216 df-cleq 2222 df-clel 2225 df-nfc 2361 df-ne 2401 df-nel 2496 df-ral 2513 df-rex 2514 df-reu 2515 df-rmo 2516 df-rab 2517 df-v 2801 df-sbc 3029 df-csb 3125 df-dif 3199 df-un 3201 df-in 3203 df-ss 3210 df-nul 3492 df-pw 3651 df-sn 3672 df-pr 3673 df-op 3675 df-uni 3889 df-int 3924 df-iun 3967 df-br 4084 df-opab 4146 df-mpt 4147 df-id 4384 df-xp 4725 df-rel 4726 df-cnv 4727 df-co 4728 df-dm 4729 df-rn 4730 df-res 4731 df-ima 4732 df-iota 5278 df-fun 5320 df-fn 5321 df-f 5322 df-f1 5323 df-fo 5324 df-f1o 5325 df-fv 5326 df-riota 5960 df-ov 6010 df-oprab 6011 df-mpo 6012 df-1st 6292 df-2nd 6293 df-pnf 8191 df-mnf 8192 df-ltxr 8194 df-inn 9119 df-2 9177 df-3 9178 df-4 9179 df-5 9180 df-6 9181 df-ndx 13043 df-slot 13044 df-base 13046 df-sets 13047 df-plusg 13131 df-mulr 13132 df-sca 13134 df-vsca 13135 df-0g 13299 df-plusf 13396 df-mgm 13397 df-sgrp 13443 df-mnd 13458 df-grp 13544 df-mgp 13892 df-ur 13931 df-ring 13969 df-lmod 14261 df-scaf 14262 |
| This theorem is referenced by: lmodfopne 14298 |
| Copyright terms: Public domain | W3C validator |