| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > gsummgmpropd | GIF version | ||
| Description: A stronger version of gsumpropd 13626 if at least one of the involved structures is a magma, see gsumpropd2 13627. (Contributed by AV, 31-Jan-2020.) |
| Ref | Expression |
|---|---|
| gsummgmpropd.f | ⊢ (𝜑 → 𝐹 ∈ 𝑉) |
| gsummgmpropd.g | ⊢ (𝜑 → 𝐺 ∈ 𝑊) |
| gsummgmpropd.h | ⊢ (𝜑 → 𝐻 ∈ 𝑋) |
| gsummgmpropd.b | ⊢ (𝜑 → (Base‘𝐺) = (Base‘𝐻)) |
| gsummgmpropd.m | ⊢ (𝜑 → 𝐺 ∈ Mgm) |
| gsummgmpropd.e | ⊢ ((𝜑 ∧ (𝑠 ∈ (Base‘𝐺) ∧ 𝑡 ∈ (Base‘𝐺))) → (𝑠(+g‘𝐺)𝑡) = (𝑠(+g‘𝐻)𝑡)) |
| gsummgmpropd.n | ⊢ (𝜑 → Fun 𝐹) |
| gsummgmpropd.r | ⊢ (𝜑 → ran 𝐹 ⊆ (Base‘𝐺)) |
| Ref | Expression |
|---|---|
| gsummgmpropd | ⊢ (𝜑 → (𝐺 Σg 𝐹) = (𝐻 Σg 𝐹)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | gsummgmpropd.f | . 2 ⊢ (𝜑 → 𝐹 ∈ 𝑉) | |
| 2 | gsummgmpropd.g | . 2 ⊢ (𝜑 → 𝐺 ∈ 𝑊) | |
| 3 | gsummgmpropd.h | . 2 ⊢ (𝜑 → 𝐻 ∈ 𝑋) | |
| 4 | gsummgmpropd.b | . 2 ⊢ (𝜑 → (Base‘𝐺) = (Base‘𝐻)) | |
| 5 | gsummgmpropd.m | . . . 4 ⊢ (𝜑 → 𝐺 ∈ Mgm) | |
| 6 | eqid 2234 | . . . . . 6 ⊢ (Base‘𝐺) = (Base‘𝐺) | |
| 7 | eqid 2234 | . . . . . 6 ⊢ (+g‘𝐺) = (+g‘𝐺) | |
| 8 | 6, 7 | mgmcl 13593 | . . . . 5 ⊢ ((𝐺 ∈ Mgm ∧ 𝑠 ∈ (Base‘𝐺) ∧ 𝑡 ∈ (Base‘𝐺)) → (𝑠(+g‘𝐺)𝑡) ∈ (Base‘𝐺)) |
| 9 | 8 | 3expib 1233 | . . . 4 ⊢ (𝐺 ∈ Mgm → ((𝑠 ∈ (Base‘𝐺) ∧ 𝑡 ∈ (Base‘𝐺)) → (𝑠(+g‘𝐺)𝑡) ∈ (Base‘𝐺))) |
| 10 | 5, 9 | syl 14 | . . 3 ⊢ (𝜑 → ((𝑠 ∈ (Base‘𝐺) ∧ 𝑡 ∈ (Base‘𝐺)) → (𝑠(+g‘𝐺)𝑡) ∈ (Base‘𝐺))) |
| 11 | 10 | imp 124 | . 2 ⊢ ((𝜑 ∧ (𝑠 ∈ (Base‘𝐺) ∧ 𝑡 ∈ (Base‘𝐺))) → (𝑠(+g‘𝐺)𝑡) ∈ (Base‘𝐺)) |
| 12 | gsummgmpropd.e | . 2 ⊢ ((𝜑 ∧ (𝑠 ∈ (Base‘𝐺) ∧ 𝑡 ∈ (Base‘𝐺))) → (𝑠(+g‘𝐺)𝑡) = (𝑠(+g‘𝐻)𝑡)) | |
| 13 | gsummgmpropd.n | . 2 ⊢ (𝜑 → Fun 𝐹) | |
| 14 | gsummgmpropd.r | . 2 ⊢ (𝜑 → ran 𝐹 ⊆ (Base‘𝐺)) | |
| 15 | 1, 2, 3, 4, 11, 12, 13, 14 | gsumpropd2 13627 | 1 ⊢ (𝜑 → (𝐺 Σg 𝐹) = (𝐻 Σg 𝐹)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 = wceq 1398 ∈ wcel 2205 ⊆ wss 3213 ran crn 4752 Fun wfun 5348 ‘cfv 5354 (class class class)co 6052 Basecbs 13233 +gcplusg 13311 Σg cgsu 13491 Mgmcmgm 13588 |
| 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 2207 ax-14 2208 ax-ext 2216 ax-coll 4227 ax-sep 4230 ax-nul 4238 ax-pow 4289 ax-pr 4324 ax-un 4556 ax-setind 4661 ax-iinf 4712 ax-cnex 8223 ax-resscn 8224 ax-1cn 8225 ax-1re 8226 ax-icn 8227 ax-addcl 8228 ax-addrcl 8229 ax-mulcl 8230 ax-addcom 8232 ax-addass 8234 ax-distr 8236 ax-i2m1 8237 ax-0lt1 8238 ax-0id 8240 ax-rnegex 8241 ax-cnre 8243 ax-pre-ltirr 8244 ax-pre-ltwlin 8245 ax-pre-lttrn 8246 ax-pre-ltadd 8248 |
| This theorem depends on definitions: df-bi 117 df-3or 1006 df-3an 1007 df-tru 1401 df-fal 1404 df-nf 1510 df-sb 1812 df-eu 2085 df-mo 2086 df-clab 2221 df-cleq 2227 df-clel 2230 df-nfc 2375 df-ne 2415 df-nel 2510 df-ral 2527 df-rex 2528 df-reu 2529 df-rab 2531 df-v 2817 df-sbc 3045 df-csb 3141 df-dif 3215 df-un 3217 df-in 3219 df-ss 3226 df-nul 3511 df-pw 3673 df-sn 3697 df-pr 3698 df-op 3700 df-uni 3917 df-int 3952 df-iun 3995 df-br 4112 df-opab 4174 df-mpt 4175 df-tr 4211 df-id 4416 df-iord 4489 df-on 4491 df-ilim 4492 df-suc 4494 df-iom 4715 df-xp 4757 df-rel 4758 df-cnv 4759 df-co 4760 df-dm 4761 df-rn 4762 df-res 4763 df-ima 4764 df-iota 5314 df-fun 5356 df-fn 5357 df-f 5358 df-f1 5359 df-fo 5360 df-f1o 5361 df-fv 5362 df-riota 6005 df-ov 6055 df-oprab 6056 df-mpo 6057 df-1st 6336 df-2nd 6337 df-recs 6538 df-frec 6624 df-pnf 8315 df-mnf 8316 df-xr 8317 df-ltxr 8318 df-le 8319 df-sub 8451 df-neg 8452 df-inn 9243 df-2 9301 df-n0 9502 df-z 9583 df-uz 9860 df-fz 10349 df-fzo 10484 df-seqfrec 10817 df-ndx 13236 df-slot 13237 df-base 13239 df-plusg 13324 df-0g 13492 df-igsum 13493 df-mgm 13590 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |