![]() |
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 6881 | . . . . . 6 ⊢ (𝑔 = 𝐺 → (Base‘𝑔) = (Base‘𝐺)) | |
3 | plusffval.1 | . . . . . 6 ⊢ 𝐵 = (Base‘𝐺) | |
4 | 2, 3 | eqtr4di 2782 | . . . . 5 ⊢ (𝑔 = 𝐺 → (Base‘𝑔) = 𝐵) |
5 | fveq2 6881 | . . . . . . 7 ⊢ (𝑔 = 𝐺 → (+g‘𝑔) = (+g‘𝐺)) | |
6 | plusffval.2 | . . . . . . 7 ⊢ + = (+g‘𝐺) | |
7 | 5, 6 | eqtr4di 2782 | . . . . . 6 ⊢ (𝑔 = 𝐺 → (+g‘𝑔) = + ) |
8 | 7 | oveqd 7418 | . . . . 5 ⊢ (𝑔 = 𝐺 → (𝑥(+g‘𝑔)𝑦) = (𝑥 + 𝑦)) |
9 | 4, 4, 8 | mpoeq123dv 7476 | . . . 4 ⊢ (𝑔 = 𝐺 → (𝑥 ∈ (Base‘𝑔), 𝑦 ∈ (Base‘𝑔) ↦ (𝑥(+g‘𝑔)𝑦)) = (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ (𝑥 + 𝑦))) |
10 | df-plusf 18561 | . . . 4 ⊢ +𝑓 = (𝑔 ∈ V ↦ (𝑥 ∈ (Base‘𝑔), 𝑦 ∈ (Base‘𝑔) ↦ (𝑥(+g‘𝑔)𝑦))) | |
11 | 3 | fvexi 6895 | . . . . 5 ⊢ 𝐵 ∈ V |
12 | 6 | fvexi 6895 | . . . . . . 7 ⊢ + ∈ V |
13 | 12 | rnex 7896 | . . . . . 6 ⊢ ran + ∈ V |
14 | p0ex 5372 | . . . . . 6 ⊢ {∅} ∈ V | |
15 | 13, 14 | unex 7726 | . . . . 5 ⊢ (ran + ∪ {∅}) ∈ V |
16 | df-ov 7404 | . . . . . . 7 ⊢ (𝑥 + 𝑦) = ( + ‘⟨𝑥, 𝑦⟩) | |
17 | fvrn0 6911 | . . . . . . 7 ⊢ ( + ‘⟨𝑥, 𝑦⟩) ∈ (ran + ∪ {∅}) | |
18 | 16, 17 | eqeltri 2821 | . . . . . 6 ⊢ (𝑥 + 𝑦) ∈ (ran + ∪ {∅}) |
19 | 18 | rgen2w 3058 | . . . . 5 ⊢ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑥 + 𝑦) ∈ (ran + ∪ {∅}) |
20 | 11, 11, 15, 19 | mpoexw 8058 | . . . 4 ⊢ (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ (𝑥 + 𝑦)) ∈ V |
21 | 9, 10, 20 | fvmpt 6988 | . . 3 ⊢ (𝐺 ∈ V → (+𝑓‘𝐺) = (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ (𝑥 + 𝑦))) |
22 | fvprc 6873 | . . . 4 ⊢ (¬ 𝐺 ∈ V → (+𝑓‘𝐺) = ∅) | |
23 | fvprc 6873 | . . . . . . 7 ⊢ (¬ 𝐺 ∈ V → (Base‘𝐺) = ∅) | |
24 | 3, 23 | eqtrid 2776 | . . . . . 6 ⊢ (¬ 𝐺 ∈ V → 𝐵 = ∅) |
25 | 24 | olcd 871 | . . . . 5 ⊢ (¬ 𝐺 ∈ V → (𝐵 = ∅ ∨ 𝐵 = ∅)) |
26 | 0mpo0 7484 | . . . . 5 ⊢ ((𝐵 = ∅ ∨ 𝐵 = ∅) → (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ (𝑥 + 𝑦)) = ∅) | |
27 | 25, 26 | syl 17 | . . . 4 ⊢ (¬ 𝐺 ∈ V → (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ (𝑥 + 𝑦)) = ∅) |
28 | 22, 27 | eqtr4d 2767 | . . 3 ⊢ (¬ 𝐺 ∈ V → (+𝑓‘𝐺) = (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ (𝑥 + 𝑦))) |
29 | 21, 28 | pm2.61i 182 | . 2 ⊢ (+𝑓‘𝐺) = (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ (𝑥 + 𝑦)) |
30 | 1, 29 | eqtri 2752 | 1 ⊢ ⨣ = (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ (𝑥 + 𝑦)) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 ∨ wo 844 = wceq 1533 ∈ wcel 2098 Vcvv 3466 ∪ cun 3938 ∅c0 4314 {csn 4620 ⟨cop 4626 ran crn 5667 ‘cfv 6533 (class class class)co 7401 ∈ cmpo 7403 Basecbs 17142 +gcplusg 17195 +𝑓cplusf 18559 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1789 ax-4 1803 ax-5 1905 ax-6 1963 ax-7 2003 ax-8 2100 ax-9 2108 ax-10 2129 ax-11 2146 ax-12 2163 ax-ext 2695 ax-sep 5289 ax-nul 5296 ax-pow 5353 ax-pr 5417 ax-un 7718 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 845 df-3an 1086 df-tru 1536 df-fal 1546 df-ex 1774 df-nf 1778 df-sb 2060 df-mo 2526 df-eu 2555 df-clab 2702 df-cleq 2716 df-clel 2802 df-nfc 2877 df-ne 2933 df-ral 3054 df-rex 3063 df-rab 3425 df-v 3468 df-sbc 3770 df-csb 3886 df-dif 3943 df-un 3945 df-in 3947 df-ss 3957 df-nul 4315 df-if 4521 df-pw 4596 df-sn 4621 df-pr 4623 df-op 4627 df-uni 4900 df-iun 4989 df-br 5139 df-opab 5201 df-mpt 5222 df-id 5564 df-xp 5672 df-rel 5673 df-cnv 5674 df-co 5675 df-dm 5676 df-rn 5677 df-res 5678 df-ima 5679 df-iota 6485 df-fun 6535 df-fn 6536 df-f 6537 df-fv 6541 df-ov 7404 df-oprab 7405 df-mpo 7406 df-1st 7968 df-2nd 7969 df-plusf 18561 |
This theorem is referenced by: plusfval 18569 plusfeq 18570 plusffn 18571 mgmplusf 18572 rlmscaf 21052 istgp2 23916 oppgtmd 23922 submtmd 23929 prdstmdd 23949 ressplusf 32560 pl1cn 33390 |
Copyright terms: Public domain | W3C validator |