| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > plusffval | Structured version Visualization version GIF version | ||
| Description: The group addition operation as a function. (Contributed by Mario Carneiro, 14-Aug-2015.) (Proof shortened by AV, 2-Mar-2024.) |
| Ref | Expression |
|---|---|
| plusffval.1 | ⊢ 𝐵 = (Base‘𝐺) |
| plusffval.2 | ⊢ + = (+g‘𝐺) |
| plusffval.3 | ⊢ ⨣ = (+𝑓‘𝐺) |
| Ref | Expression |
|---|---|
| plusffval | ⊢ ⨣ = (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ (𝑥 + 𝑦)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | plusffval.3 | . 2 ⊢ ⨣ = (+𝑓‘𝐺) | |
| 2 | fveq2 6882 | . . . . . 6 ⊢ (𝑔 = 𝐺 → (Base‘𝑔) = (Base‘𝐺)) | |
| 3 | plusffval.1 | . . . . . 6 ⊢ 𝐵 = (Base‘𝐺) | |
| 4 | 2, 3 | eqtr4di 2822 | . . . . 5 ⊢ (𝑔 = 𝐺 → (Base‘𝑔) = 𝐵) |
| 5 | fveq2 6882 | . . . . . . 7 ⊢ (𝑔 = 𝐺 → (+g‘𝑔) = (+g‘𝐺)) | |
| 6 | plusffval.2 | . . . . . . 7 ⊢ + = (+g‘𝐺) | |
| 7 | 5, 6 | eqtr4di 2822 | . . . . . 6 ⊢ (𝑔 = 𝐺 → (+g‘𝑔) = + ) |
| 8 | 7 | oveqd 7428 | . . . . 5 ⊢ (𝑔 = 𝐺 → (𝑥(+g‘𝑔)𝑦) = (𝑥 + 𝑦)) |
| 9 | 4, 4, 8 | mpoeq123dv 7486 | . . . 4 ⊢ (𝑔 = 𝐺 → (𝑥 ∈ (Base‘𝑔), 𝑦 ∈ (Base‘𝑔) ↦ (𝑥(+g‘𝑔)𝑦)) = (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ (𝑥 + 𝑦))) |
| 10 | df-plusf 18697 | . . . 4 ⊢ +𝑓 = (𝑔 ∈ V ↦ (𝑥 ∈ (Base‘𝑔), 𝑦 ∈ (Base‘𝑔) ↦ (𝑥(+g‘𝑔)𝑦))) | |
| 11 | 3 | fvexi 6896 | . . . . 5 ⊢ 𝐵 ∈ V |
| 12 | 6 | fvexi 6896 | . . . . . . 7 ⊢ + ∈ V |
| 13 | 12 | rnex 7907 | . . . . . 6 ⊢ ran + ∈ V |
| 14 | p0ex 5356 | . . . . . 6 ⊢ {∅} ∈ V | |
| 15 | 13, 14 | unex 7743 | . . . . 5 ⊢ (ran + ∪ {∅}) ∈ V |
| 16 | df-ov 7414 | . . . . . . 7 ⊢ (𝑥 + 𝑦) = ( + ‘〈𝑥, 𝑦〉) | |
| 17 | fvrn0 6910 | . . . . . . 7 ⊢ ( + ‘〈𝑥, 𝑦〉) ∈ (ran + ∪ {∅}) | |
| 18 | 16, 17 | eqeltri 2865 | . . . . . 6 ⊢ (𝑥 + 𝑦) ∈ (ran + ∪ {∅}) |
| 19 | 18 | rgen2w 3090 | . . . . 5 ⊢ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑥 + 𝑦) ∈ (ran + ∪ {∅}) |
| 20 | 11, 11, 15, 19 | mpoexw 8075 | . . . 4 ⊢ (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ (𝑥 + 𝑦)) ∈ V |
| 21 | 9, 10, 20 | fvmpt 6990 | . . 3 ⊢ (𝐺 ∈ V → (+𝑓‘𝐺) = (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ (𝑥 + 𝑦))) |
| 22 | fvprc 6874 | . . . 4 ⊢ (¬ 𝐺 ∈ V → (+𝑓‘𝐺) = ∅) | |
| 23 | fvprc 6874 | . . . . . . 7 ⊢ (¬ 𝐺 ∈ V → (Base‘𝐺) = ∅) | |
| 24 | 3, 23 | eqtrid 2816 | . . . . . 6 ⊢ (¬ 𝐺 ∈ V → 𝐵 = ∅) |
| 25 | 24 | olcd 887 | . . . . 5 ⊢ (¬ 𝐺 ∈ V → (𝐵 = ∅ ∨ 𝐵 = ∅)) |
| 26 | 0mpo0 7494 | . . . . 5 ⊢ ((𝐵 = ∅ ∨ 𝐵 = ∅) → (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ (𝑥 + 𝑦)) = ∅) | |
| 27 | 25, 26 | syl 18 | . . . 4 ⊢ (¬ 𝐺 ∈ V → (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ (𝑥 + 𝑦)) = ∅) |
| 28 | 22, 27 | eqtr4d 2807 | . . 3 ⊢ (¬ 𝐺 ∈ V → (+𝑓‘𝐺) = (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ (𝑥 + 𝑦))) |
| 29 | 21, 28 | pm2.61i 184 | . 2 ⊢ (+𝑓‘𝐺) = (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ (𝑥 + 𝑦)) |
| 30 | 1, 29 | eqtri 2792 | 1 ⊢ ⨣ = (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ (𝑥 + 𝑦)) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 ∨ wo 860 = wceq 1567 ∈ wcel 2149 Vcvv 3463 ∪ cun 3911 ∅c0 4294 {csn 4594 〈cop 4600 ran crn 5663 ‘cfv 6537 (class class class)co 7411 ∈ cmpo 7413 Basecbs 17269 +gcplusg 17310 +𝑓cplusf 18695 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1822 ax-4 1836 ax-5 1937 ax-6 1994 ax-7 2035 ax-8 2151 ax-9 2159 ax-10 2182 ax-11 2198 ax-12 2219 ax-ext 2741 ax-sep 5261 ax-nul 5271 ax-pow 5337 ax-pr 5405 ax-un 7733 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1103 df-tru 1570 df-fal 1580 df-ex 1807 df-nf 1811 df-sb 2098 df-mo 2573 df-eu 2603 df-clab 2748 df-cleq 2761 df-clel 2844 df-nfc 2918 df-ne 2965 df-ral 3086 df-rex 3096 df-rab 3424 df-v 3465 df-sbc 3754 df-csb 3862 df-dif 3916 df-un 3918 df-in 3920 df-ss 3930 df-nul 4295 df-if 4493 df-pw 4569 df-sn 4595 df-pr 4597 df-op 4601 df-uni 4877 df-iun 4962 df-br 5114 df-opab 5178 df-mpt 5197 df-id 5557 df-xp 5668 df-rel 5669 df-cnv 5670 df-co 5671 df-dm 5672 df-rn 5673 df-res 5674 df-ima 5675 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-fv 6545 df-ov 7414 df-oprab 7415 df-mpo 7416 df-1st 7986 df-2nd 7987 df-plusf 18697 |
| This theorem is referenced by: plusfval 18705 plusfeq 18706 plusffn 18707 mgmplusf 18708 rlmscaf 21306 istgp2 24217 oppgtmd 24223 submtmd 24230 prdstmdd 24250 ressplusf 33224 pl1cn 34290 |
| Copyright terms: Public domain | W3C validator |