| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > cnidOLD | Structured version Visualization version GIF version | ||
| Description: Obsolete version of cnaddid 19946. The group identity element of complex number addition is zero. (Contributed by Steve Rodriguez, 3-Dec-2006.) (Revised by Mario Carneiro, 21-Dec-2013.) (New usage is discouraged.) (Proof modification is discouraged.) |
| Ref | Expression |
|---|---|
| cnidOLD | ⊢ 0 = (GId‘ + ) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | cnaddabloOLD 30944 | . . . 4 ⊢ + ∈ AbelOp | |
| 2 | ablogrpo 30910 | . . . 4 ⊢ ( + ∈ AbelOp → + ∈ GrpOp) | |
| 3 | 1, 2 | ax-mp 5 | . . 3 ⊢ + ∈ GrpOp |
| 4 | ax-addf 11185 | . . . . . 6 ⊢ + :(ℂ × ℂ)⟶ℂ | |
| 5 | 4 | fdmi 6717 | . . . . 5 ⊢ dom + = (ℂ × ℂ) |
| 6 | 3, 5 | grporn 30884 | . . . 4 ⊢ ℂ = ran + |
| 7 | eqid 2762 | . . . 4 ⊢ (GId‘ + ) = (GId‘ + ) | |
| 8 | 6, 7 | grpoidval 30876 | . . 3 ⊢ ( + ∈ GrpOp → (GId‘ + ) = (℩𝑦 ∈ ℂ ∀𝑥 ∈ ℂ (𝑦 + 𝑥) = 𝑥)) |
| 9 | 3, 8 | ax-mp 5 | . 2 ⊢ (GId‘ + ) = (℩𝑦 ∈ ℂ ∀𝑥 ∈ ℂ (𝑦 + 𝑥) = 𝑥) |
| 10 | addlid 11399 | . . . 4 ⊢ (𝑥 ∈ ℂ → (0 + 𝑥) = 𝑥) | |
| 11 | 10 | rgen 3080 | . . 3 ⊢ ∀𝑥 ∈ ℂ (0 + 𝑥) = 𝑥 |
| 12 | 0cn 11204 | . . . 4 ⊢ 0 ∈ ℂ | |
| 13 | 6 | grpoideu 30872 | . . . . 5 ⊢ ( + ∈ GrpOp → ∃!𝑦 ∈ ℂ ∀𝑥 ∈ ℂ (𝑦 + 𝑥) = 𝑥) |
| 14 | 3, 13 | ax-mp 5 | . . . 4 ⊢ ∃!𝑦 ∈ ℂ ∀𝑥 ∈ ℂ (𝑦 + 𝑥) = 𝑥 |
| 15 | oveq1 7419 | . . . . . . 7 ⊢ (𝑦 = 0 → (𝑦 + 𝑥) = (0 + 𝑥)) | |
| 16 | 15 | eqeq1d 2764 | . . . . . 6 ⊢ (𝑦 = 0 → ((𝑦 + 𝑥) = 𝑥 ↔ (0 + 𝑥) = 𝑥)) |
| 17 | 16 | ralbidv 3187 | . . . . 5 ⊢ (𝑦 = 0 → (∀𝑥 ∈ ℂ (𝑦 + 𝑥) = 𝑥 ↔ ∀𝑥 ∈ ℂ (0 + 𝑥) = 𝑥)) |
| 18 | 17 | riota2 7394 | . . . 4 ⊢ ((0 ∈ ℂ ∧ ∃!𝑦 ∈ ℂ ∀𝑥 ∈ ℂ (𝑦 + 𝑥) = 𝑥) → (∀𝑥 ∈ ℂ (0 + 𝑥) = 𝑥 ↔ (℩𝑦 ∈ ℂ ∀𝑥 ∈ ℂ (𝑦 + 𝑥) = 𝑥) = 0)) |
| 19 | 12, 14, 18 | mp2an 704 | . . 3 ⊢ (∀𝑥 ∈ ℂ (0 + 𝑥) = 𝑥 ↔ (℩𝑦 ∈ ℂ ∀𝑥 ∈ ℂ (𝑦 + 𝑥) = 𝑥) = 0) |
| 20 | 11, 19 | mpbi 233 | . 2 ⊢ (℩𝑦 ∈ ℂ ∀𝑥 ∈ ℂ (𝑦 + 𝑥) = 𝑥) = 0 |
| 21 | 9, 20 | eqtr2i 2786 | 1 ⊢ 0 = (GId‘ + ) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ↔ wb 209 = wceq 1569 ∈ wcel 2142 ∀wral 3078 ∃!wreu 3366 × cxp 5658 ‘cfv 6536 ℩crio 7368 (class class class)co 7412 ℂcc 11104 0cc0 11106 + caddc 11109 GrpOpcgr 30852 GIdcgi 30853 AbelOpcablo 30907 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1824 ax-4 1838 ax-5 1939 ax-6 1996 ax-7 2037 ax-8 2144 ax-9 2152 ax-10 2175 ax-11 2191 ax-12 2212 ax-ext 2734 ax-rep 5237 ax-sep 5256 ax-nul 5268 ax-pow 5335 ax-pr 5403 ax-un 7734 ax-cnex 11162 ax-resscn 11163 ax-1cn 11164 ax-icn 11165 ax-addcl 11166 ax-addrcl 11167 ax-mulcl 11168 ax-mulrcl 11169 ax-mulcom 11170 ax-addass 11171 ax-mulass 11172 ax-distr 11173 ax-i2m1 11174 ax-1ne0 11175 ax-1rid 11176 ax-rnegex 11177 ax-rrecex 11178 ax-cnre 11179 ax-pre-lttri 11180 ax-pre-lttrn 11181 ax-pre-ltadd 11182 ax-addf 11185 |
| This proof depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1103 df-3an 1104 df-tru 1572 df-fal 1582 df-ex 1809 df-nf 1813 df-sb 2096 df-mo 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-nel 3064 df-ral 3079 df-rex 3089 df-reu 3369 df-rab 3416 df-v 3456 df-sbc 3744 df-csb 3853 df-dif 3907 df-un 3909 df-in 3911 df-ss 3921 df-nul 4286 df-if 4487 df-pw 4563 df-sn 4589 df-pr 4591 df-op 4595 df-uni 4872 df-iun 4957 df-br 5109 df-opab 5173 df-mpt 5192 df-id 5555 df-po 5568 df-so 5569 df-xp 5666 df-rel 5667 df-cnv 5668 df-co 5669 df-dm 5670 df-rn 5671 df-res 5672 df-ima 5673 df-iota 6492 df-fun 6538 df-fn 6539 df-f 6540 df-f1 6541 df-fo 6542 df-f1o 6543 df-fv 6544 df-riota 7369 df-ov 7415 df-oprab 7416 df-mpo 7417 df-er 8692 df-en 8942 df-dom 8943 df-sdom 8944 df-pnf 11251 df-mnf 11252 df-ltxr 11254 df-sub 11449 df-neg 11450 df-grpo 30856 df-gid 30857 df-ablo 30908 |
| This theorem is used by: cnnv 31040 |
| Copyright terms: Public domain | W3C validator |