![]() |
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 10663 without ax-mulcom 10624. (Contributed by SN, 27-May-2024.) |
Ref | Expression |
---|---|
sn-mulid2 | ⊢ (𝐴 ∈ ℂ → (1 · 𝐴) = 𝐴) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | cnre 10661 | . 2 ⊢ (𝐴 ∈ ℂ → ∃𝑥 ∈ ℝ ∃𝑦 ∈ ℝ 𝐴 = (𝑥 + (i · 𝑦))) | |
2 | 1cnd 10659 | . . . . . 6 ⊢ ((𝑥 ∈ ℝ ∧ 𝑦 ∈ ℝ) → 1 ∈ ℂ) | |
3 | recn 10650 | . . . . . . 7 ⊢ (𝑥 ∈ ℝ → 𝑥 ∈ ℂ) | |
4 | 3 | adantr 485 | . . . . . 6 ⊢ ((𝑥 ∈ ℝ ∧ 𝑦 ∈ ℝ) → 𝑥 ∈ ℂ) |
5 | ax-icn 10619 | . . . . . . . 8 ⊢ i ∈ ℂ | |
6 | 5 | a1i 11 | . . . . . . 7 ⊢ ((𝑥 ∈ ℝ ∧ 𝑦 ∈ ℝ) → i ∈ ℂ) |
7 | recn 10650 | . . . . . . . 8 ⊢ (𝑦 ∈ ℝ → 𝑦 ∈ ℂ) | |
8 | 7 | adantl 486 | . . . . . . 7 ⊢ ((𝑥 ∈ ℝ ∧ 𝑦 ∈ ℝ) → 𝑦 ∈ ℂ) |
9 | 6, 8 | mulcld 10684 | . . . . . 6 ⊢ ((𝑥 ∈ ℝ ∧ 𝑦 ∈ ℝ) → (i · 𝑦) ∈ ℂ) |
10 | 2, 4, 9 | adddid 10688 | . . . . 5 ⊢ ((𝑥 ∈ ℝ ∧ 𝑦 ∈ ℝ) → (1 · (𝑥 + (i · 𝑦))) = ((1 · 𝑥) + (1 · (i · 𝑦)))) |
11 | remulid2 39897 | . . . . . . 7 ⊢ (𝑥 ∈ ℝ → (1 · 𝑥) = 𝑥) | |
12 | 11 | adantr 485 | . . . . . 6 ⊢ ((𝑥 ∈ ℝ ∧ 𝑦 ∈ ℝ) → (1 · 𝑥) = 𝑥) |
13 | 2, 6, 8 | mulassd 10687 | . . . . . . 7 ⊢ ((𝑥 ∈ ℝ ∧ 𝑦 ∈ ℝ) → ((1 · i) · 𝑦) = (1 · (i · 𝑦))) |
14 | sn-1ticom 39898 | . . . . . . . . . 10 ⊢ (1 · i) = (i · 1) | |
15 | 14 | oveq1i 7153 | . . . . . . . . 9 ⊢ ((1 · i) · 𝑦) = ((i · 1) · 𝑦) |
16 | 15 | a1i 11 | . . . . . . . 8 ⊢ ((𝑥 ∈ ℝ ∧ 𝑦 ∈ ℝ) → ((1 · i) · 𝑦) = ((i · 1) · 𝑦)) |
17 | 6, 2, 8 | mulassd 10687 | . . . . . . . 8 ⊢ ((𝑥 ∈ ℝ ∧ 𝑦 ∈ ℝ) → ((i · 1) · 𝑦) = (i · (1 · 𝑦))) |
18 | remulid2 39897 | . . . . . . . . . 10 ⊢ (𝑦 ∈ ℝ → (1 · 𝑦) = 𝑦) | |
19 | 18 | adantl 486 | . . . . . . . . 9 ⊢ ((𝑥 ∈ ℝ ∧ 𝑦 ∈ ℝ) → (1 · 𝑦) = 𝑦) |
20 | 19 | oveq2d 7159 | . . . . . . . 8 ⊢ ((𝑥 ∈ ℝ ∧ 𝑦 ∈ ℝ) → (i · (1 · 𝑦)) = (i · 𝑦)) |
21 | 16, 17, 20 | 3eqtrd 2798 | . . . . . . 7 ⊢ ((𝑥 ∈ ℝ ∧ 𝑦 ∈ ℝ) → ((1 · i) · 𝑦) = (i · 𝑦)) |
22 | 13, 21 | eqtr3d 2796 | . . . . . 6 ⊢ ((𝑥 ∈ ℝ ∧ 𝑦 ∈ ℝ) → (1 · (i · 𝑦)) = (i · 𝑦)) |
23 | 12, 22 | oveq12d 7161 | . . . . 5 ⊢ ((𝑥 ∈ ℝ ∧ 𝑦 ∈ ℝ) → ((1 · 𝑥) + (1 · (i · 𝑦))) = (𝑥 + (i · 𝑦))) |
24 | 10, 23 | eqtrd 2794 | . . . 4 ⊢ ((𝑥 ∈ ℝ ∧ 𝑦 ∈ ℝ) → (1 · (𝑥 + (i · 𝑦))) = (𝑥 + (i · 𝑦))) |
25 | oveq2 7151 | . . . . 5 ⊢ (𝐴 = (𝑥 + (i · 𝑦)) → (1 · 𝐴) = (1 · (𝑥 + (i · 𝑦)))) | |
26 | id 22 | . . . . 5 ⊢ (𝐴 = (𝑥 + (i · 𝑦)) → 𝐴 = (𝑥 + (i · 𝑦))) | |
27 | 25, 26 | eqeq12d 2775 | . . . 4 ⊢ (𝐴 = (𝑥 + (i · 𝑦)) → ((1 · 𝐴) = 𝐴 ↔ (1 · (𝑥 + (i · 𝑦))) = (𝑥 + (i · 𝑦)))) |
28 | 24, 27 | syl5ibrcom 250 | . . 3 ⊢ ((𝑥 ∈ ℝ ∧ 𝑦 ∈ ℝ) → (𝐴 = (𝑥 + (i · 𝑦)) → (1 · 𝐴) = 𝐴)) |
29 | 28 | rexlimivv 3214 | . 2 ⊢ (∃𝑥 ∈ ℝ ∃𝑦 ∈ ℝ 𝐴 = (𝑥 + (i · 𝑦)) → (1 · 𝐴) = 𝐴) |
30 | 1, 29 | syl 17 | 1 ⊢ (𝐴 ∈ ℂ → (1 · 𝐴) = 𝐴) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 400 = wceq 1539 ∈ wcel 2112 ∃wrex 3069 (class class class)co 7143 ℂcc 10558 ℝcr 10559 1c1 10561 ici 10562 + caddc 10563 · cmul 10565 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1912 ax-6 1971 ax-7 2016 ax-8 2114 ax-9 2122 ax-10 2143 ax-11 2159 ax-12 2176 ax-ext 2730 ax-sep 5162 ax-nul 5169 ax-pow 5227 ax-pr 5291 ax-un 7452 ax-resscn 10617 ax-1cn 10618 ax-icn 10619 ax-addcl 10620 ax-addrcl 10621 ax-mulcl 10622 ax-mulrcl 10623 ax-addass 10625 ax-mulass 10626 ax-distr 10627 ax-i2m1 10628 ax-1ne0 10629 ax-1rid 10630 ax-rnegex 10631 ax-rrecex 10632 ax-cnre 10633 ax-pre-lttri 10634 ax-pre-lttrn 10635 ax-pre-ltadd 10636 |
This theorem depends on definitions: df-bi 210 df-an 401 df-or 846 df-3or 1086 df-3an 1087 df-tru 1542 df-ex 1783 df-nf 1787 df-sb 2071 df-mo 2558 df-eu 2589 df-clab 2737 df-cleq 2751 df-clel 2831 df-nfc 2899 df-ne 2950 df-nel 3054 df-ral 3073 df-rex 3074 df-reu 3075 df-rmo 3076 df-rab 3077 df-v 3409 df-sbc 3694 df-csb 3802 df-dif 3857 df-un 3859 df-in 3861 df-ss 3871 df-nul 4222 df-if 4414 df-pw 4489 df-sn 4516 df-pr 4518 df-op 4522 df-uni 4792 df-br 5026 df-opab 5088 df-mpt 5106 df-id 5423 df-po 5436 df-so 5437 df-xp 5523 df-rel 5524 df-cnv 5525 df-co 5526 df-dm 5527 df-rn 5528 df-res 5529 df-ima 5530 df-iota 6287 df-fun 6330 df-fn 6331 df-f 6332 df-f1 6333 df-fo 6334 df-f1o 6335 df-fv 6336 df-riota 7101 df-ov 7146 df-oprab 7147 df-mpo 7148 df-er 8292 df-en 8521 df-dom 8522 df-sdom 8523 df-pnf 10700 df-mnf 10701 df-ltxr 10703 df-2 11722 df-3 11723 df-resub 39831 |
This theorem is referenced by: it1ei 39900 |
Copyright terms: Public domain | W3C validator |