| 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 6842 | . . . . . 6 ⊢ (𝑔 = 𝐺 → (Base‘𝑔) = (Base‘𝐺)) | |
| 3 | plusffval.1 | . . . . . 6 ⊢ 𝐵 = (Base‘𝐺) | |
| 4 | 2, 3 | eqtr4di 2790 | . . . . 5 ⊢ (𝑔 = 𝐺 → (Base‘𝑔) = 𝐵) |
| 5 | fveq2 6842 | . . . . . . 7 ⊢ (𝑔 = 𝐺 → (+g‘𝑔) = (+g‘𝐺)) | |
| 6 | plusffval.2 | . . . . . . 7 ⊢ + = (+g‘𝐺) | |
| 7 | 5, 6 | eqtr4di 2790 | . . . . . 6 ⊢ (𝑔 = 𝐺 → (+g‘𝑔) = + ) |
| 8 | 7 | oveqd 7385 | . . . . 5 ⊢ (𝑔 = 𝐺 → (𝑥(+g‘𝑔)𝑦) = (𝑥 + 𝑦)) |
| 9 | 4, 4, 8 | mpoeq123dv 7443 | . . . 4 ⊢ (𝑔 = 𝐺 → (𝑥 ∈ (Base‘𝑔), 𝑦 ∈ (Base‘𝑔) ↦ (𝑥(+g‘𝑔)𝑦)) = (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ (𝑥 + 𝑦))) |
| 10 | df-plusf 18576 | . . . 4 ⊢ +𝑓 = (𝑔 ∈ V ↦ (𝑥 ∈ (Base‘𝑔), 𝑦 ∈ (Base‘𝑔) ↦ (𝑥(+g‘𝑔)𝑦))) | |
| 11 | 3 | fvexi 6856 | . . . . 5 ⊢ 𝐵 ∈ V |
| 12 | 6 | fvexi 6856 | . . . . . . 7 ⊢ + ∈ V |
| 13 | 12 | rnex 7862 | . . . . . 6 ⊢ ran + ∈ V |
| 14 | p0ex 5331 | . . . . . 6 ⊢ {∅} ∈ V | |
| 15 | 13, 14 | unex 7699 | . . . . 5 ⊢ (ran + ∪ {∅}) ∈ V |
| 16 | df-ov 7371 | . . . . . . 7 ⊢ (𝑥 + 𝑦) = ( + ‘〈𝑥, 𝑦〉) | |
| 17 | fvrn0 6870 | . . . . . . 7 ⊢ ( + ‘〈𝑥, 𝑦〉) ∈ (ran + ∪ {∅}) | |
| 18 | 16, 17 | eqeltri 2833 | . . . . . 6 ⊢ (𝑥 + 𝑦) ∈ (ran + ∪ {∅}) |
| 19 | 18 | rgen2w 3057 | . . . . 5 ⊢ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑥 + 𝑦) ∈ (ran + ∪ {∅}) |
| 20 | 11, 11, 15, 19 | mpoexw 8032 | . . . 4 ⊢ (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ (𝑥 + 𝑦)) ∈ V |
| 21 | 9, 10, 20 | fvmpt 6949 | . . 3 ⊢ (𝐺 ∈ V → (+𝑓‘𝐺) = (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ (𝑥 + 𝑦))) |
| 22 | fvprc 6834 | . . . 4 ⊢ (¬ 𝐺 ∈ V → (+𝑓‘𝐺) = ∅) | |
| 23 | fvprc 6834 | . . . . . . 7 ⊢ (¬ 𝐺 ∈ V → (Base‘𝐺) = ∅) | |
| 24 | 3, 23 | eqtrid 2784 | . . . . . 6 ⊢ (¬ 𝐺 ∈ V → 𝐵 = ∅) |
| 25 | 24 | olcd 875 | . . . . 5 ⊢ (¬ 𝐺 ∈ V → (𝐵 = ∅ ∨ 𝐵 = ∅)) |
| 26 | 0mpo0 7451 | . . . . 5 ⊢ ((𝐵 = ∅ ∨ 𝐵 = ∅) → (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ (𝑥 + 𝑦)) = ∅) | |
| 27 | 25, 26 | syl 17 | . . . 4 ⊢ (¬ 𝐺 ∈ V → (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ (𝑥 + 𝑦)) = ∅) |
| 28 | 22, 27 | eqtr4d 2775 | . . 3 ⊢ (¬ 𝐺 ∈ V → (+𝑓‘𝐺) = (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ (𝑥 + 𝑦))) |
| 29 | 21, 28 | pm2.61i 182 | . 2 ⊢ (+𝑓‘𝐺) = (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ (𝑥 + 𝑦)) |
| 30 | 1, 29 | eqtri 2760 | 1 ⊢ ⨣ = (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ (𝑥 + 𝑦)) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 ∨ wo 848 = wceq 1542 ∈ wcel 2114 Vcvv 3442 ∪ cun 3901 ∅c0 4287 {csn 4582 〈cop 4588 ran crn 5633 ‘cfv 6500 (class class class)co 7368 ∈ cmpo 7370 Basecbs 17148 +gcplusg 17189 +𝑓cplusf 18574 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-sep 5243 ax-nul 5253 ax-pow 5312 ax-pr 5379 ax-un 7690 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-ral 3053 df-rex 3063 df-rab 3402 df-v 3444 df-sbc 3743 df-csb 3852 df-dif 3906 df-un 3908 df-in 3910 df-ss 3920 df-nul 4288 df-if 4482 df-pw 4558 df-sn 4583 df-pr 4585 df-op 4589 df-uni 4866 df-iun 4950 df-br 5101 df-opab 5163 df-mpt 5182 df-id 5527 df-xp 5638 df-rel 5639 df-cnv 5640 df-co 5641 df-dm 5642 df-rn 5643 df-res 5644 df-ima 5645 df-iota 6456 df-fun 6502 df-fn 6503 df-f 6504 df-fv 6508 df-ov 7371 df-oprab 7372 df-mpo 7373 df-1st 7943 df-2nd 7944 df-plusf 18576 |
| This theorem is referenced by: plusfval 18584 plusfeq 18585 plusffn 18586 mgmplusf 18587 rlmscaf 21171 istgp2 24047 oppgtmd 24053 submtmd 24060 prdstmdd 24080 ressplusf 33055 pl1cn 34132 |
| Copyright terms: Public domain | W3C validator |