| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > ax0id | GIF version | ||
| Description: 0
is an identity element for real addition. Axiom for real and
complex numbers, derived from set theory. This construction-dependent
theorem should not be referenced directly; instead, use ax-0id 8251.
In the Metamath Proof Explorer this is not a complex number axiom but is instead proved from other axioms. That proof relies on excluded middle and it is not known whether it is possible to prove this from the other axioms without excluded middle. (Contributed by Jim Kingdon, 16-Jan-2020.) (New usage is discouraged.) |
| Ref | Expression |
|---|---|
| ax0id | ⊢ (𝐴 ∈ ℂ → (𝐴 + 0) = 𝐴) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | df-c 8149 | . 2 ⊢ ℂ = (R × R) | |
| 2 | oveq1 6065 | . . 3 ⊢ (〈𝑥, 𝑦〉 = 𝐴 → (〈𝑥, 𝑦〉 + 0) = (𝐴 + 0)) | |
| 3 | id 19 | . . 3 ⊢ (〈𝑥, 𝑦〉 = 𝐴 → 〈𝑥, 𝑦〉 = 𝐴) | |
| 4 | 2, 3 | eqeq12d 2249 | . 2 ⊢ (〈𝑥, 𝑦〉 = 𝐴 → ((〈𝑥, 𝑦〉 + 0) = 〈𝑥, 𝑦〉 ↔ (𝐴 + 0) = 𝐴)) |
| 5 | 0r 8081 | . . . 4 ⊢ 0R ∈ R | |
| 6 | addcnsr 8165 | . . . 4 ⊢ (((𝑥 ∈ R ∧ 𝑦 ∈ R) ∧ (0R ∈ R ∧ 0R ∈ R)) → (〈𝑥, 𝑦〉 + 〈0R, 0R〉) = 〈(𝑥 +R 0R), (𝑦 +R 0R)〉) | |
| 7 | 5, 5, 6 | mpanr12 439 | . . 3 ⊢ ((𝑥 ∈ R ∧ 𝑦 ∈ R) → (〈𝑥, 𝑦〉 + 〈0R, 0R〉) = 〈(𝑥 +R 0R), (𝑦 +R 0R)〉) |
| 8 | df-0 8150 | . . . . . 6 ⊢ 0 = 〈0R, 0R〉 | |
| 9 | 8 | eqcomi 2238 | . . . . 5 ⊢ 〈0R, 0R〉 = 0 |
| 10 | 9 | a1i 9 | . . . 4 ⊢ ((𝑥 ∈ R ∧ 𝑦 ∈ R) → 〈0R, 0R〉 = 0) |
| 11 | 10 | oveq2d 6074 | . . 3 ⊢ ((𝑥 ∈ R ∧ 𝑦 ∈ R) → (〈𝑥, 𝑦〉 + 〈0R, 0R〉) = (〈𝑥, 𝑦〉 + 0)) |
| 12 | 0idsr 8098 | . . . . 5 ⊢ (𝑥 ∈ R → (𝑥 +R 0R) = 𝑥) | |
| 13 | 12 | adantr 276 | . . . 4 ⊢ ((𝑥 ∈ R ∧ 𝑦 ∈ R) → (𝑥 +R 0R) = 𝑥) |
| 14 | 0idsr 8098 | . . . . 5 ⊢ (𝑦 ∈ R → (𝑦 +R 0R) = 𝑦) | |
| 15 | 14 | adantl 277 | . . . 4 ⊢ ((𝑥 ∈ R ∧ 𝑦 ∈ R) → (𝑦 +R 0R) = 𝑦) |
| 16 | 13, 15 | opeq12d 3896 | . . 3 ⊢ ((𝑥 ∈ R ∧ 𝑦 ∈ R) → 〈(𝑥 +R 0R), (𝑦 +R 0R)〉 = 〈𝑥, 𝑦〉) |
| 17 | 7, 11, 16 | 3eqtr3d 2275 | . 2 ⊢ ((𝑥 ∈ R ∧ 𝑦 ∈ R) → (〈𝑥, 𝑦〉 + 0) = 〈𝑥, 𝑦〉) |
| 18 | 1, 4, 17 | optocl 4831 | 1 ⊢ (𝐴 ∈ ℂ → (𝐴 + 0) = 𝐴) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 = wceq 1398 ∈ wcel 2205 〈cop 3697 (class class class)co 6058 Rcnr 7628 0Rc0r 7629 +R cplr 7632 ℂcc 8141 0cc0 8143 + caddc 8146 |
| 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 717 ax-5 1496 ax-7 1497 ax-gen 1498 ax-ie1 1542 ax-ie2 1543 ax-8 1553 ax-10 1554 ax-11 1555 ax-i12 1556 ax-bndl 1558 ax-4 1559 ax-17 1575 ax-i9 1579 ax-ial 1583 ax-i5r 1584 ax-13 2207 ax-14 2208 ax-ext 2216 ax-coll 4230 ax-sep 4233 ax-nul 4241 ax-pow 4292 ax-pr 4327 ax-un 4559 ax-setind 4664 ax-iinf 4715 |
| This theorem depends on definitions: df-bi 117 df-dc 843 df-3or 1006 df-3an 1007 df-tru 1401 df-fal 1404 df-nf 1510 df-sb 1812 df-eu 2085 df-mo 2086 df-clab 2221 df-cleq 2227 df-clel 2230 df-nfc 2375 df-ne 2415 df-ral 2527 df-rex 2528 df-reu 2529 df-rab 2531 df-v 2817 df-sbc 3046 df-csb 3142 df-dif 3216 df-un 3218 df-in 3220 df-ss 3227 df-nul 3513 df-pw 3676 df-sn 3700 df-pr 3701 df-op 3703 df-uni 3920 df-int 3955 df-iun 3998 df-br 4115 df-opab 4177 df-mpt 4178 df-tr 4214 df-eprel 4415 df-id 4419 df-po 4422 df-iso 4423 df-iord 4492 df-on 4494 df-suc 4497 df-iom 4718 df-xp 4760 df-rel 4761 df-cnv 4762 df-co 4763 df-dm 4764 df-rn 4765 df-res 4766 df-ima 4767 df-iota 5317 df-fun 5359 df-fn 5360 df-f 5361 df-f1 5362 df-fo 5363 df-f1o 5364 df-fv 5365 df-ov 6061 df-oprab 6062 df-mpo 6063 df-1st 6347 df-2nd 6348 df-recs 6549 df-irdg 6614 df-1o 6660 df-2o 6661 df-oadd 6664 df-omul 6665 df-er 6780 df-ec 6782 df-qs 6786 df-ni 7635 df-pli 7636 df-mi 7637 df-lti 7638 df-plpq 7675 df-mpq 7676 df-enq 7678 df-nqqs 7679 df-plqqs 7680 df-mqqs 7681 df-1nqqs 7682 df-rq 7683 df-ltnqqs 7684 df-enq0 7755 df-nq0 7756 df-0nq0 7757 df-plq0 7758 df-mq0 7759 df-inp 7797 df-i1p 7798 df-iplp 7799 df-enr 8057 df-nr 8058 df-plr 8059 df-0r 8062 df-c 8149 df-0 8150 df-add 8154 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |