Mathbox for Steven Nguyen |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > Mathboxes > sn-mulid2 | Structured version Visualization version GIF version |
Description: mulid2 10629 without ax-mulcom 10590. (Contributed by SN, 27-May-2024.) |
Ref | Expression |
---|---|
sn-mulid2 | ⊢ (𝐴 ∈ ℂ → (1 · 𝐴) = 𝐴) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | cnre 10627 | . 2 ⊢ (𝐴 ∈ ℂ → ∃𝑥 ∈ ℝ ∃𝑦 ∈ ℝ 𝐴 = (𝑥 + (i · 𝑦))) | |
2 | 1cnd 10625 | . . . . . 6 ⊢ ((𝑥 ∈ ℝ ∧ 𝑦 ∈ ℝ) → 1 ∈ ℂ) | |
3 | recn 10616 | . . . . . . 7 ⊢ (𝑥 ∈ ℝ → 𝑥 ∈ ℂ) | |
4 | 3 | adantr 484 | . . . . . 6 ⊢ ((𝑥 ∈ ℝ ∧ 𝑦 ∈ ℝ) → 𝑥 ∈ ℂ) |
5 | ax-icn 10585 | . . . . . . . 8 ⊢ i ∈ ℂ | |
6 | 5 | a1i 11 | . . . . . . 7 ⊢ ((𝑥 ∈ ℝ ∧ 𝑦 ∈ ℝ) → i ∈ ℂ) |
7 | recn 10616 | . . . . . . . 8 ⊢ (𝑦 ∈ ℝ → 𝑦 ∈ ℂ) | |
8 | 7 | adantl 485 | . . . . . . 7 ⊢ ((𝑥 ∈ ℝ ∧ 𝑦 ∈ ℝ) → 𝑦 ∈ ℂ) |
9 | 6, 8 | mulcld 10650 | . . . . . 6 ⊢ ((𝑥 ∈ ℝ ∧ 𝑦 ∈ ℝ) → (i · 𝑦) ∈ ℂ) |
10 | 2, 4, 9 | adddid 10654 | . . . . 5 ⊢ ((𝑥 ∈ ℝ ∧ 𝑦 ∈ ℝ) → (1 · (𝑥 + (i · 𝑦))) = ((1 · 𝑥) + (1 · (i · 𝑦)))) |
11 | remulid2 39570 | . . . . . . 7 ⊢ (𝑥 ∈ ℝ → (1 · 𝑥) = 𝑥) | |
12 | 11 | adantr 484 | . . . . . 6 ⊢ ((𝑥 ∈ ℝ ∧ 𝑦 ∈ ℝ) → (1 · 𝑥) = 𝑥) |
13 | 2, 6, 8 | mulassd 10653 | . . . . . . 7 ⊢ ((𝑥 ∈ ℝ ∧ 𝑦 ∈ ℝ) → ((1 · i) · 𝑦) = (1 · (i · 𝑦))) |
14 | sn-1ticom 39571 | . . . . . . . . . 10 ⊢ (1 · i) = (i · 1) | |
15 | 14 | oveq1i 7145 | . . . . . . . . 9 ⊢ ((1 · i) · 𝑦) = ((i · 1) · 𝑦) |
16 | 15 | a1i 11 | . . . . . . . 8 ⊢ ((𝑥 ∈ ℝ ∧ 𝑦 ∈ ℝ) → ((1 · i) · 𝑦) = ((i · 1) · 𝑦)) |
17 | 6, 2, 8 | mulassd 10653 | . . . . . . . 8 ⊢ ((𝑥 ∈ ℝ ∧ 𝑦 ∈ ℝ) → ((i · 1) · 𝑦) = (i · (1 · 𝑦))) |
18 | remulid2 39570 | . . . . . . . . . 10 ⊢ (𝑦 ∈ ℝ → (1 · 𝑦) = 𝑦) | |
19 | 18 | adantl 485 | . . . . . . . . 9 ⊢ ((𝑥 ∈ ℝ ∧ 𝑦 ∈ ℝ) → (1 · 𝑦) = 𝑦) |
20 | 19 | oveq2d 7151 | . . . . . . . 8 ⊢ ((𝑥 ∈ ℝ ∧ 𝑦 ∈ ℝ) → (i · (1 · 𝑦)) = (i · 𝑦)) |
21 | 16, 17, 20 | 3eqtrd 2837 | . . . . . . 7 ⊢ ((𝑥 ∈ ℝ ∧ 𝑦 ∈ ℝ) → ((1 · i) · 𝑦) = (i · 𝑦)) |
22 | 13, 21 | eqtr3d 2835 | . . . . . 6 ⊢ ((𝑥 ∈ ℝ ∧ 𝑦 ∈ ℝ) → (1 · (i · 𝑦)) = (i · 𝑦)) |
23 | 12, 22 | oveq12d 7153 | . . . . 5 ⊢ ((𝑥 ∈ ℝ ∧ 𝑦 ∈ ℝ) → ((1 · 𝑥) + (1 · (i · 𝑦))) = (𝑥 + (i · 𝑦))) |
24 | 10, 23 | eqtrd 2833 | . . . 4 ⊢ ((𝑥 ∈ ℝ ∧ 𝑦 ∈ ℝ) → (1 · (𝑥 + (i · 𝑦))) = (𝑥 + (i · 𝑦))) |
25 | oveq2 7143 | . . . . 5 ⊢ (𝐴 = (𝑥 + (i · 𝑦)) → (1 · 𝐴) = (1 · (𝑥 + (i · 𝑦)))) | |
26 | id 22 | . . . . 5 ⊢ (𝐴 = (𝑥 + (i · 𝑦)) → 𝐴 = (𝑥 + (i · 𝑦))) | |
27 | 25, 26 | eqeq12d 2814 | . . . 4 ⊢ (𝐴 = (𝑥 + (i · 𝑦)) → ((1 · 𝐴) = 𝐴 ↔ (1 · (𝑥 + (i · 𝑦))) = (𝑥 + (i · 𝑦)))) |
28 | 24, 27 | syl5ibrcom 250 | . . 3 ⊢ ((𝑥 ∈ ℝ ∧ 𝑦 ∈ ℝ) → (𝐴 = (𝑥 + (i · 𝑦)) → (1 · 𝐴) = 𝐴)) |
29 | 28 | rexlimivv 3251 | . 2 ⊢ (∃𝑥 ∈ ℝ ∃𝑦 ∈ ℝ 𝐴 = (𝑥 + (i · 𝑦)) → (1 · 𝐴) = 𝐴) |
30 | 1, 29 | syl 17 | 1 ⊢ (𝐴 ∈ ℂ → (1 · 𝐴) = 𝐴) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 399 = wceq 1538 ∈ wcel 2111 ∃wrex 3107 (class class class)co 7135 ℂcc 10524 ℝcr 10525 1c1 10527 ici 10528 + caddc 10529 · cmul 10531 |
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 1911 ax-6 1970 ax-7 2015 ax-8 2113 ax-9 2121 ax-10 2142 ax-11 2158 ax-12 2175 ax-ext 2770 ax-sep 5167 ax-nul 5174 ax-pow 5231 ax-pr 5295 ax-un 7441 ax-resscn 10583 ax-1cn 10584 ax-icn 10585 ax-addcl 10586 ax-addrcl 10587 ax-mulcl 10588 ax-mulrcl 10589 ax-addass 10591 ax-mulass 10592 ax-distr 10593 ax-i2m1 10594 ax-1ne0 10595 ax-1rid 10596 ax-rnegex 10597 ax-rrecex 10598 ax-cnre 10599 ax-pre-lttri 10600 ax-pre-lttrn 10601 ax-pre-ltadd 10602 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 845 df-3or 1085 df-3an 1086 df-tru 1541 df-ex 1782 df-nf 1786 df-sb 2070 df-mo 2598 df-eu 2629 df-clab 2777 df-cleq 2791 df-clel 2870 df-nfc 2938 df-ne 2988 df-nel 3092 df-ral 3111 df-rex 3112 df-reu 3113 df-rmo 3114 df-rab 3115 df-v 3443 df-sbc 3721 df-csb 3829 df-dif 3884 df-un 3886 df-in 3888 df-ss 3898 df-nul 4244 df-if 4426 df-pw 4499 df-sn 4526 df-pr 4528 df-op 4532 df-uni 4801 df-br 5031 df-opab 5093 df-mpt 5111 df-id 5425 df-po 5438 df-so 5439 df-xp 5525 df-rel 5526 df-cnv 5527 df-co 5528 df-dm 5529 df-rn 5530 df-res 5531 df-ima 5532 df-iota 6283 df-fun 6326 df-fn 6327 df-f 6328 df-f1 6329 df-fo 6330 df-f1o 6331 df-fv 6332 df-riota 7093 df-ov 7138 df-oprab 7139 df-mpo 7140 df-er 8272 df-en 8493 df-dom 8494 df-sdom 8495 df-pnf 10666 df-mnf 10667 df-ltxr 10669 df-2 11688 df-3 11689 df-resub 39504 |
This theorem is referenced by: it1ei 39573 |
Copyright terms: Public domain | W3C validator |