| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > gsummgmpropd | GIF version | ||
| Description: A stronger version of gsumpropd 13498 if at least one of the involved structures is a magma, see gsumpropd2 13499. (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 2230 | . . . . . 6 ⊢ (Base‘𝐺) = (Base‘𝐺) | |
| 7 | eqid 2230 | . . . . . 6 ⊢ (+g‘𝐺) = (+g‘𝐺) | |
| 8 | 6, 7 | mgmcl 13465 | . . . . 5 ⊢ ((𝐺 ∈ Mgm ∧ 𝑠 ∈ (Base‘𝐺) ∧ 𝑡 ∈ (Base‘𝐺)) → (𝑠(+g‘𝐺)𝑡) ∈ (Base‘𝐺)) |
| 9 | 8 | 3expib 1232 | . . . 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 13499 | 1 ⊢ (𝜑 → (𝐺 Σg 𝐹) = (𝐻 Σg 𝐹)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 = wceq 1397 ∈ wcel 2201 ⊆ wss 3199 ran crn 4728 Fun wfun 5322 ‘cfv 5328 (class class class)co 6023 Basecbs 13105 +gcplusg 13183 Σg cgsu 13363 Mgmcmgm 13460 |
| 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 716 ax-5 1495 ax-7 1496 ax-gen 1497 ax-ie1 1541 ax-ie2 1542 ax-8 1552 ax-10 1553 ax-11 1554 ax-i12 1555 ax-bndl 1557 ax-4 1558 ax-17 1574 ax-i9 1578 ax-ial 1582 ax-i5r 1583 ax-13 2203 ax-14 2204 ax-ext 2212 ax-coll 4205 ax-sep 4208 ax-nul 4216 ax-pow 4266 ax-pr 4301 ax-un 4532 ax-setind 4637 ax-iinf 4688 ax-cnex 8128 ax-resscn 8129 ax-1cn 8130 ax-1re 8131 ax-icn 8132 ax-addcl 8133 ax-addrcl 8134 ax-mulcl 8135 ax-addcom 8137 ax-addass 8139 ax-distr 8141 ax-i2m1 8142 ax-0lt1 8143 ax-0id 8145 ax-rnegex 8146 ax-cnre 8148 ax-pre-ltirr 8149 ax-pre-ltwlin 8150 ax-pre-lttrn 8151 ax-pre-ltadd 8153 |
| This theorem depends on definitions: df-bi 117 df-3or 1005 df-3an 1006 df-tru 1400 df-fal 1403 df-nf 1509 df-sb 1810 df-eu 2081 df-mo 2082 df-clab 2217 df-cleq 2223 df-clel 2226 df-nfc 2362 df-ne 2402 df-nel 2497 df-ral 2514 df-rex 2515 df-reu 2516 df-rab 2518 df-v 2803 df-sbc 3031 df-csb 3127 df-dif 3201 df-un 3203 df-in 3205 df-ss 3212 df-nul 3494 df-pw 3655 df-sn 3676 df-pr 3677 df-op 3679 df-uni 3895 df-int 3930 df-iun 3973 df-br 4090 df-opab 4152 df-mpt 4153 df-tr 4189 df-id 4392 df-iord 4465 df-on 4467 df-ilim 4468 df-suc 4470 df-iom 4691 df-xp 4733 df-rel 4734 df-cnv 4735 df-co 4736 df-dm 4737 df-rn 4738 df-res 4739 df-ima 4740 df-iota 5288 df-fun 5330 df-fn 5331 df-f 5332 df-f1 5333 df-fo 5334 df-f1o 5335 df-fv 5336 df-riota 5976 df-ov 6026 df-oprab 6027 df-mpo 6028 df-1st 6308 df-2nd 6309 df-recs 6476 df-frec 6562 df-pnf 8221 df-mnf 8222 df-xr 8223 df-ltxr 8224 df-le 8225 df-sub 8357 df-neg 8358 df-inn 9149 df-2 9207 df-n0 9408 df-z 9485 df-uz 9761 df-fz 10249 df-fzo 10383 df-seqfrec 10716 df-ndx 13108 df-slot 13109 df-base 13111 df-plusg 13196 df-0g 13364 df-igsum 13365 df-mgm 13462 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |