![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > addsqn2reu | Structured version Visualization version GIF version |
Description: For each complex number
𝐶,
there does not exist a unique complex
number 𝑏, squared and added to a unique
another complex number
𝑎 resulting in the given complex number
𝐶.
Actually, for each
complex number 𝑏, 𝑎 = (𝐶 − (𝑏↑2)) is unique.
Remark: This, together with addsq2reu 27391, shows that commutation of two unique quantifications need not be equivalent, and provides an evident justification of the fact that considering the pair of variables is necessary to obtain what we intuitively understand as "double unique existence". (Proposed by GL, 23-Jun-2023.). (Contributed by AV, 23-Jun-2023.) |
Ref | Expression |
---|---|
addsqn2reu | ⊢ (𝐶 ∈ ℂ → ¬ ∃!𝑏 ∈ ℂ ∃!𝑎 ∈ ℂ (𝑎 + (𝑏↑2)) = 𝐶) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | ax-1cn 11196 | . . 3 ⊢ 1 ∈ ℂ | |
2 | neg1cn 12356 | . . 3 ⊢ -1 ∈ ℂ | |
3 | 1nn 12253 | . . . 4 ⊢ 1 ∈ ℕ | |
4 | nnneneg 12277 | . . . 4 ⊢ (1 ∈ ℕ → 1 ≠ -1) | |
5 | 3, 4 | ax-mp 5 | . . 3 ⊢ 1 ≠ -1 |
6 | 1, 2, 5 | 3pm3.2i 1336 | . 2 ⊢ (1 ∈ ℂ ∧ -1 ∈ ℂ ∧ 1 ≠ -1) |
7 | 1cnd 11239 | . . . . 5 ⊢ (𝐶 ∈ ℂ → 1 ∈ ℂ) | |
8 | negeu 11480 | . . . . 5 ⊢ ((1 ∈ ℂ ∧ 𝐶 ∈ ℂ) → ∃!𝑎 ∈ ℂ (1 + 𝑎) = 𝐶) | |
9 | 7, 8 | mpancom 686 | . . . 4 ⊢ (𝐶 ∈ ℂ → ∃!𝑎 ∈ ℂ (1 + 𝑎) = 𝐶) |
10 | sq1 14190 | . . . . . . . . 9 ⊢ (1↑2) = 1 | |
11 | 10 | a1i 11 | . . . . . . . 8 ⊢ ((𝐶 ∈ ℂ ∧ 𝑎 ∈ ℂ) → (1↑2) = 1) |
12 | 11 | oveq2d 7432 | . . . . . . 7 ⊢ ((𝐶 ∈ ℂ ∧ 𝑎 ∈ ℂ) → (𝑎 + (1↑2)) = (𝑎 + 1)) |
13 | id 22 | . . . . . . . . 9 ⊢ (𝑎 ∈ ℂ → 𝑎 ∈ ℂ) | |
14 | 1cnd 11239 | . . . . . . . . 9 ⊢ (𝑎 ∈ ℂ → 1 ∈ ℂ) | |
15 | 13, 14 | addcomd 11446 | . . . . . . . 8 ⊢ (𝑎 ∈ ℂ → (𝑎 + 1) = (1 + 𝑎)) |
16 | 15 | adantl 480 | . . . . . . 7 ⊢ ((𝐶 ∈ ℂ ∧ 𝑎 ∈ ℂ) → (𝑎 + 1) = (1 + 𝑎)) |
17 | 12, 16 | eqtrd 2765 | . . . . . 6 ⊢ ((𝐶 ∈ ℂ ∧ 𝑎 ∈ ℂ) → (𝑎 + (1↑2)) = (1 + 𝑎)) |
18 | 17 | eqeq1d 2727 | . . . . 5 ⊢ ((𝐶 ∈ ℂ ∧ 𝑎 ∈ ℂ) → ((𝑎 + (1↑2)) = 𝐶 ↔ (1 + 𝑎) = 𝐶)) |
19 | 18 | reubidva 3380 | . . . 4 ⊢ (𝐶 ∈ ℂ → (∃!𝑎 ∈ ℂ (𝑎 + (1↑2)) = 𝐶 ↔ ∃!𝑎 ∈ ℂ (1 + 𝑎) = 𝐶)) |
20 | 9, 19 | mpbird 256 | . . 3 ⊢ (𝐶 ∈ ℂ → ∃!𝑎 ∈ ℂ (𝑎 + (1↑2)) = 𝐶) |
21 | neg1sqe1 14191 | . . . . . . . . 9 ⊢ (-1↑2) = 1 | |
22 | 21 | a1i 11 | . . . . . . . 8 ⊢ ((𝐶 ∈ ℂ ∧ 𝑎 ∈ ℂ) → (-1↑2) = 1) |
23 | 22 | oveq2d 7432 | . . . . . . 7 ⊢ ((𝐶 ∈ ℂ ∧ 𝑎 ∈ ℂ) → (𝑎 + (-1↑2)) = (𝑎 + 1)) |
24 | 23, 16 | eqtrd 2765 | . . . . . 6 ⊢ ((𝐶 ∈ ℂ ∧ 𝑎 ∈ ℂ) → (𝑎 + (-1↑2)) = (1 + 𝑎)) |
25 | 24 | eqeq1d 2727 | . . . . 5 ⊢ ((𝐶 ∈ ℂ ∧ 𝑎 ∈ ℂ) → ((𝑎 + (-1↑2)) = 𝐶 ↔ (1 + 𝑎) = 𝐶)) |
26 | 25 | reubidva 3380 | . . . 4 ⊢ (𝐶 ∈ ℂ → (∃!𝑎 ∈ ℂ (𝑎 + (-1↑2)) = 𝐶 ↔ ∃!𝑎 ∈ ℂ (1 + 𝑎) = 𝐶)) |
27 | 9, 26 | mpbird 256 | . . 3 ⊢ (𝐶 ∈ ℂ → ∃!𝑎 ∈ ℂ (𝑎 + (-1↑2)) = 𝐶) |
28 | 20, 27 | jca 510 | . 2 ⊢ (𝐶 ∈ ℂ → (∃!𝑎 ∈ ℂ (𝑎 + (1↑2)) = 𝐶 ∧ ∃!𝑎 ∈ ℂ (𝑎 + (-1↑2)) = 𝐶)) |
29 | oveq1 7423 | . . . . . 6 ⊢ (𝑏 = 1 → (𝑏↑2) = (1↑2)) | |
30 | 29 | oveq2d 7432 | . . . . 5 ⊢ (𝑏 = 1 → (𝑎 + (𝑏↑2)) = (𝑎 + (1↑2))) |
31 | 30 | eqeq1d 2727 | . . . 4 ⊢ (𝑏 = 1 → ((𝑎 + (𝑏↑2)) = 𝐶 ↔ (𝑎 + (1↑2)) = 𝐶)) |
32 | 31 | reubidv 3382 | . . 3 ⊢ (𝑏 = 1 → (∃!𝑎 ∈ ℂ (𝑎 + (𝑏↑2)) = 𝐶 ↔ ∃!𝑎 ∈ ℂ (𝑎 + (1↑2)) = 𝐶)) |
33 | oveq1 7423 | . . . . . 6 ⊢ (𝑏 = -1 → (𝑏↑2) = (-1↑2)) | |
34 | 33 | oveq2d 7432 | . . . . 5 ⊢ (𝑏 = -1 → (𝑎 + (𝑏↑2)) = (𝑎 + (-1↑2))) |
35 | 34 | eqeq1d 2727 | . . . 4 ⊢ (𝑏 = -1 → ((𝑎 + (𝑏↑2)) = 𝐶 ↔ (𝑎 + (-1↑2)) = 𝐶)) |
36 | 35 | reubidv 3382 | . . 3 ⊢ (𝑏 = -1 → (∃!𝑎 ∈ ℂ (𝑎 + (𝑏↑2)) = 𝐶 ↔ ∃!𝑎 ∈ ℂ (𝑎 + (-1↑2)) = 𝐶)) |
37 | 32, 36 | 2nreu 4437 | . 2 ⊢ ((1 ∈ ℂ ∧ -1 ∈ ℂ ∧ 1 ≠ -1) → ((∃!𝑎 ∈ ℂ (𝑎 + (1↑2)) = 𝐶 ∧ ∃!𝑎 ∈ ℂ (𝑎 + (-1↑2)) = 𝐶) → ¬ ∃!𝑏 ∈ ℂ ∃!𝑎 ∈ ℂ (𝑎 + (𝑏↑2)) = 𝐶)) |
38 | 6, 28, 37 | mpsyl 68 | 1 ⊢ (𝐶 ∈ ℂ → ¬ ∃!𝑏 ∈ ℂ ∃!𝑎 ∈ ℂ (𝑎 + (𝑏↑2)) = 𝐶) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ∧ wa 394 ∧ w3a 1084 = wceq 1533 ∈ wcel 2098 ≠ wne 2930 ∃!wreu 3362 (class class class)co 7416 ℂcc 11136 1c1 11139 + caddc 11141 -cneg 11475 ℕcn 12242 2c2 12297 ↑cexp 14058 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1789 ax-4 1803 ax-5 1905 ax-6 1963 ax-7 2003 ax-8 2100 ax-9 2108 ax-10 2129 ax-11 2146 ax-12 2166 ax-ext 2696 ax-sep 5294 ax-nul 5301 ax-pow 5359 ax-pr 5423 ax-un 7738 ax-cnex 11194 ax-resscn 11195 ax-1cn 11196 ax-icn 11197 ax-addcl 11198 ax-addrcl 11199 ax-mulcl 11200 ax-mulrcl 11201 ax-mulcom 11202 ax-addass 11203 ax-mulass 11204 ax-distr 11205 ax-i2m1 11206 ax-1ne0 11207 ax-1rid 11208 ax-rnegex 11209 ax-rrecex 11210 ax-cnre 11211 ax-pre-lttri 11212 ax-pre-lttrn 11213 ax-pre-ltadd 11214 ax-pre-mulgt0 11215 |
This theorem depends on definitions: df-bi 206 df-an 395 df-or 846 df-3or 1085 df-3an 1086 df-tru 1536 df-fal 1546 df-ex 1774 df-nf 1778 df-sb 2060 df-mo 2528 df-eu 2557 df-clab 2703 df-cleq 2717 df-clel 2802 df-nfc 2877 df-ne 2931 df-nel 3037 df-ral 3052 df-rex 3061 df-rmo 3364 df-reu 3365 df-rab 3420 df-v 3465 df-sbc 3769 df-csb 3885 df-dif 3942 df-un 3944 df-in 3946 df-ss 3956 df-pss 3959 df-nul 4319 df-if 4525 df-pw 4600 df-sn 4625 df-pr 4627 df-op 4631 df-uni 4904 df-iun 4993 df-br 5144 df-opab 5206 df-mpt 5227 df-tr 5261 df-id 5570 df-eprel 5576 df-po 5584 df-so 5585 df-fr 5627 df-we 5629 df-xp 5678 df-rel 5679 df-cnv 5680 df-co 5681 df-dm 5682 df-rn 5683 df-res 5684 df-ima 5685 df-pred 6300 df-ord 6367 df-on 6368 df-lim 6369 df-suc 6370 df-iota 6495 df-fun 6545 df-fn 6546 df-f 6547 df-f1 6548 df-fo 6549 df-f1o 6550 df-fv 6551 df-riota 7372 df-ov 7419 df-oprab 7420 df-mpo 7421 df-om 7869 df-2nd 7992 df-frecs 8285 df-wrecs 8316 df-recs 8390 df-rdg 8429 df-er 8723 df-en 8963 df-dom 8964 df-sdom 8965 df-pnf 11280 df-mnf 11281 df-xr 11282 df-ltxr 11283 df-le 11284 df-sub 11476 df-neg 11477 df-div 11902 df-nn 12243 df-2 12305 df-n0 12503 df-z 12589 df-uz 12853 df-seq 13999 df-exp 14059 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |