| 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 8234.
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 8132 | . 2 ⊢ ℂ = (R × R) | |
| 2 | oveq1 6056 | . . 3 ⊢ (〈𝑥, 𝑦〉 = 𝐴 → (〈𝑥, 𝑦〉 + 0) = (𝐴 + 0)) | |
| 3 | id 19 | . . 3 ⊢ (〈𝑥, 𝑦〉 = 𝐴 → 〈𝑥, 𝑦〉 = 𝐴) | |
| 4 | 2, 3 | eqeq12d 2247 | . 2 ⊢ (〈𝑥, 𝑦〉 = 𝐴 → ((〈𝑥, 𝑦〉 + 0) = 〈𝑥, 𝑦〉 ↔ (𝐴 + 0) = 𝐴)) |
| 5 | 0r 8064 | . . . 4 ⊢ 0R ∈ R | |
| 6 | addcnsr 8148 | . . . 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 8133 | . . . . . 6 ⊢ 0 = 〈0R, 0R〉 | |
| 9 | 8 | eqcomi 2236 | . . . . 5 ⊢ 〈0R, 0R〉 = 0 |
| 10 | 9 | a1i 9 | . . . 4 ⊢ ((𝑥 ∈ R ∧ 𝑦 ∈ R) → 〈0R, 0R〉 = 0) |
| 11 | 10 | oveq2d 6065 | . . 3 ⊢ ((𝑥 ∈ R ∧ 𝑦 ∈ R) → (〈𝑥, 𝑦〉 + 〈0R, 0R〉) = (〈𝑥, 𝑦〉 + 0)) |
| 12 | 0idsr 8081 | . . . . 5 ⊢ (𝑥 ∈ R → (𝑥 +R 0R) = 𝑥) | |
| 13 | 12 | adantr 276 | . . . 4 ⊢ ((𝑥 ∈ R ∧ 𝑦 ∈ R) → (𝑥 +R 0R) = 𝑥) |
| 14 | 0idsr 8081 | . . . . 5 ⊢ (𝑦 ∈ R → (𝑦 +R 0R) = 𝑦) | |
| 15 | 14 | adantl 277 | . . . 4 ⊢ ((𝑥 ∈ R ∧ 𝑦 ∈ R) → (𝑦 +R 0R) = 𝑦) |
| 16 | 13, 15 | opeq12d 3890 | . . 3 ⊢ ((𝑥 ∈ R ∧ 𝑦 ∈ R) → 〈(𝑥 +R 0R), (𝑦 +R 0R)〉 = 〈𝑥, 𝑦〉) |
| 17 | 7, 11, 16 | 3eqtr3d 2273 | . 2 ⊢ ((𝑥 ∈ R ∧ 𝑦 ∈ R) → (〈𝑥, 𝑦〉 + 0) = 〈𝑥, 𝑦〉) |
| 18 | 1, 4, 17 | optocl 4825 | 1 ⊢ (𝐴 ∈ ℂ → (𝐴 + 0) = 𝐴) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 = wceq 1398 ∈ wcel 2203 〈cop 3691 (class class class)co 6049 Rcnr 7611 0Rc0r 7612 +R cplr 7615 ℂcc 8124 0cc0 8126 + caddc 8129 |
| 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 2205 ax-14 2206 ax-ext 2214 ax-coll 4224 ax-sep 4227 ax-nul 4235 ax-pow 4286 ax-pr 4321 ax-un 4553 ax-setind 4658 ax-iinf 4709 |
| 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 2083 df-mo 2084 df-clab 2219 df-cleq 2225 df-clel 2228 df-nfc 2373 df-ne 2413 df-ral 2525 df-rex 2526 df-reu 2527 df-rab 2529 df-v 2814 df-sbc 3042 df-csb 3138 df-dif 3212 df-un 3214 df-in 3216 df-ss 3223 df-nul 3508 df-pw 3670 df-sn 3694 df-pr 3695 df-op 3697 df-uni 3914 df-int 3949 df-iun 3992 df-br 4109 df-opab 4171 df-mpt 4172 df-tr 4208 df-eprel 4409 df-id 4413 df-po 4416 df-iso 4417 df-iord 4486 df-on 4488 df-suc 4491 df-iom 4712 df-xp 4754 df-rel 4755 df-cnv 4756 df-co 4757 df-dm 4758 df-rn 4759 df-res 4760 df-ima 4761 df-iota 5311 df-fun 5353 df-fn 5354 df-f 5355 df-f1 5356 df-fo 5357 df-f1o 5358 df-fv 5359 df-ov 6052 df-oprab 6053 df-mpo 6054 df-1st 6333 df-2nd 6334 df-recs 6535 df-irdg 6600 df-1o 6646 df-2o 6647 df-oadd 6650 df-omul 6651 df-er 6766 df-ec 6768 df-qs 6772 df-ni 7618 df-pli 7619 df-mi 7620 df-lti 7621 df-plpq 7658 df-mpq 7659 df-enq 7661 df-nqqs 7662 df-plqqs 7663 df-mqqs 7664 df-1nqqs 7665 df-rq 7666 df-ltnqqs 7667 df-enq0 7738 df-nq0 7739 df-0nq0 7740 df-plq0 7741 df-mq0 7742 df-inp 7780 df-i1p 7781 df-iplp 7782 df-enr 8040 df-nr 8041 df-plr 8042 df-0r 8045 df-c 8132 df-0 8133 df-add 8137 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |