Metamath Proof Explorer


Theorem 2sqmo

Description: There exists at most one decomposition of a prime as a sum of two squares. See 2sqb for the existence of such a decomposition. (Contributed by Thierry Arnoux, 2-Feb-2020)

Ref Expression
Assertion 2sqmo ⊢ P ∈ ℙ → ∃* a ∈ ℕ 0 ∃ b ∈ ℕ 0 a ≤ b ∧ a 2 + b 2 = P

Proof

Step Hyp Ref Expression
1 nfv ⊢ Ⅎ b P ∈ ℙ ∧ a ∈ ℕ 0 ∧ c ∈ ℕ 0
2 nfre1 ⊢ Ⅎ b ∃ b ∈ ℕ 0 a ≤ b ∧ a 2 + b 2 = P
3 1 2 nfan ⊢ Ⅎ b P ∈ ℙ ∧ a ∈ ℕ 0 ∧ c ∈ ℕ 0 ∧ ∃ b ∈ ℕ 0 a ≤ b ∧ a 2 + b 2 = P
4 nfv ⊢ Ⅎ b d ∈ ℕ 0
5 3 4 nfan ⊢ Ⅎ b P ∈ ℙ ∧ a ∈ ℕ 0 ∧ c ∈ ℕ 0 ∧ ∃ b ∈ ℕ 0 a ≤ b ∧ a 2 + b 2 = P ∧ d ∈ ℕ 0
6 nfv ⊢ Ⅎ b c ≤ d
7 5 6 nfan ⊢ Ⅎ b P ∈ ℙ ∧ a ∈ ℕ 0 ∧ c ∈ ℕ 0 ∧ ∃ b ∈ ℕ 0 a ≤ b ∧ a 2 + b 2 = P ∧ d ∈ ℕ 0 ∧ c ≤ d
8 nfv ⊢ Ⅎ b c 2 + d 2 = P
9 7 8 nfan ⊢ Ⅎ b P ∈ ℙ ∧ a ∈ ℕ 0 ∧ c ∈ ℕ 0 ∧ ∃ b ∈ ℕ 0 a ≤ b ∧ a 2 + b 2 = P ∧ d ∈ ℕ 0 ∧ c ≤ d ∧ c 2 + d 2 = P
10 simp-8l ⊢ P ∈ ℙ ∧ a ∈ ℕ 0 ∧ c ∈ ℕ 0 ∧ d ∈ ℕ 0 ∧ c ≤ d ∧ c 2 + d 2 = P ∧ b ∈ ℕ 0 ∧ a ≤ b ∧ a 2 + b 2 = P → P ∈ ℙ
11 simp-8r ⊢ P ∈ ℙ ∧ a ∈ ℕ 0 ∧ c ∈ ℕ 0 ∧ d ∈ ℕ 0 ∧ c ≤ d ∧ c 2 + d 2 = P ∧ b ∈ ℕ 0 ∧ a ≤ b ∧ a 2 + b 2 = P → a ∈ ℕ 0
12 simpllr ⊢ P ∈ ℙ ∧ a ∈ ℕ 0 ∧ c ∈ ℕ 0 ∧ d ∈ ℕ 0 ∧ c ≤ d ∧ c 2 + d 2 = P ∧ b ∈ ℕ 0 ∧ a ≤ b ∧ a 2 + b 2 = P → b ∈ ℕ 0
13 simp-7r ⊢ P ∈ ℙ ∧ a ∈ ℕ 0 ∧ c ∈ ℕ 0 ∧ d ∈ ℕ 0 ∧ c ≤ d ∧ c 2 + d 2 = P ∧ b ∈ ℕ 0 ∧ a ≤ b ∧ a 2 + b 2 = P → c ∈ ℕ 0
14 simp-6r ⊢ P ∈ ℙ ∧ a ∈ ℕ 0 ∧ c ∈ ℕ 0 ∧ d ∈ ℕ 0 ∧ c ≤ d ∧ c 2 + d 2 = P ∧ b ∈ ℕ 0 ∧ a ≤ b ∧ a 2 + b 2 = P → d ∈ ℕ 0
15 simplr ⊢ P ∈ ℙ ∧ a ∈ ℕ 0 ∧ c ∈ ℕ 0 ∧ d ∈ ℕ 0 ∧ c ≤ d ∧ c 2 + d 2 = P ∧ b ∈ ℕ 0 ∧ a ≤ b ∧ a 2 + b 2 = P → a ≤ b
16 simp-5r ⊢ P ∈ ℙ ∧ a ∈ ℕ 0 ∧ c ∈ ℕ 0 ∧ d ∈ ℕ 0 ∧ c ≤ d ∧ c 2 + d 2 = P ∧ b ∈ ℕ 0 ∧ a ≤ b ∧ a 2 + b 2 = P → c ≤ d
17 simpr ⊢ P ∈ ℙ ∧ a ∈ ℕ 0 ∧ c ∈ ℕ 0 ∧ d ∈ ℕ 0 ∧ c ≤ d ∧ c 2 + d 2 = P ∧ b ∈ ℕ 0 ∧ a ≤ b ∧ a 2 + b 2 = P → a 2 + b 2 = P
18 simp-4r ⊢ P ∈ ℙ ∧ a ∈ ℕ 0 ∧ c ∈ ℕ 0 ∧ d ∈ ℕ 0 ∧ c ≤ d ∧ c 2 + d 2 = P ∧ b ∈ ℕ 0 ∧ a ≤ b ∧ a 2 + b 2 = P → c 2 + d 2 = P
19 10 11 12 13 14 15 16 17 18 2sqmod ⊢ P ∈ ℙ ∧ a ∈ ℕ 0 ∧ c ∈ ℕ 0 ∧ d ∈ ℕ 0 ∧ c ≤ d ∧ c 2 + d 2 = P ∧ b ∈ ℕ 0 ∧ a ≤ b ∧ a 2 + b 2 = P → a = c ∧ b = d
20 19 simpld ⊢ P ∈ ℙ ∧ a ∈ ℕ 0 ∧ c ∈ ℕ 0 ∧ d ∈ ℕ 0 ∧ c ≤ d ∧ c 2 + d 2 = P ∧ b ∈ ℕ 0 ∧ a ≤ b ∧ a 2 + b 2 = P → a = c
21 20 anasss ⊢ P ∈ ℙ ∧ a ∈ ℕ 0 ∧ c ∈ ℕ 0 ∧ d ∈ ℕ 0 ∧ c ≤ d ∧ c 2 + d 2 = P ∧ b ∈ ℕ 0 ∧ a ≤ b ∧ a 2 + b 2 = P → a = c
22 21 adantl5r ⊢ P ∈ ℙ ∧ a ∈ ℕ 0 ∧ c ∈ ℕ 0 ∧ ∃ b ∈ ℕ 0 a ≤ b ∧ a 2 + b 2 = P ∧ d ∈ ℕ 0 ∧ c ≤ d ∧ c 2 + d 2 = P ∧ b ∈ ℕ 0 ∧ a ≤ b ∧ a 2 + b 2 = P → a = c
23 simp-4r ⊢ P ∈ ℙ ∧ a ∈ ℕ 0 ∧ c ∈ ℕ 0 ∧ ∃ b ∈ ℕ 0 a ≤ b ∧ a 2 + b 2 = P ∧ d ∈ ℕ 0 ∧ c ≤ d ∧ c 2 + d 2 = P → ∃ b ∈ ℕ 0 a ≤ b ∧ a 2 + b 2 = P
24 9 22 23 r19.29af ⊢ P ∈ ℙ ∧ a ∈ ℕ 0 ∧ c ∈ ℕ 0 ∧ ∃ b ∈ ℕ 0 a ≤ b ∧ a 2 + b 2 = P ∧ d ∈ ℕ 0 ∧ c ≤ d ∧ c 2 + d 2 = P → a = c
25 24 anasss ⊢ P ∈ ℙ ∧ a ∈ ℕ 0 ∧ c ∈ ℕ 0 ∧ ∃ b ∈ ℕ 0 a ≤ b ∧ a 2 + b 2 = P ∧ d ∈ ℕ 0 ∧ c ≤ d ∧ c 2 + d 2 = P → a = c
26 25 r19.29an ⊢ P ∈ ℙ ∧ a ∈ ℕ 0 ∧ c ∈ ℕ 0 ∧ ∃ b ∈ ℕ 0 a ≤ b ∧ a 2 + b 2 = P ∧ ∃ d ∈ ℕ 0 c ≤ d ∧ c 2 + d 2 = P → a = c
27 26 expl ⊢ P ∈ ℙ ∧ a ∈ ℕ 0 ∧ c ∈ ℕ 0 → ∃ b ∈ ℕ 0 a ≤ b ∧ a 2 + b 2 = P ∧ ∃ d ∈ ℕ 0 c ≤ d ∧ c 2 + d 2 = P → a = c
28 27 ralrimiva ⊢ P ∈ ℙ ∧ a ∈ ℕ 0 → ∀ c ∈ ℕ 0 ∃ b ∈ ℕ 0 a ≤ b ∧ a 2 + b 2 = P ∧ ∃ d ∈ ℕ 0 c ≤ d ∧ c 2 + d 2 = P → a = c
29 28 ralrimiva ⊢ P ∈ ℙ → ∀ a ∈ ℕ 0 ∀ c ∈ ℕ 0 ∃ b ∈ ℕ 0 a ≤ b ∧ a 2 + b 2 = P ∧ ∃ d ∈ ℕ 0 c ≤ d ∧ c 2 + d 2 = P → a = c
30 breq12 ⊢ a = c ∧ b = d → a ≤ b ↔ c ≤ d
31 simpl ⊢ a = c ∧ b = d → a = c
32 31 oveq1d ⊢ a = c ∧ b = d → a 2 = c 2
33 simpr ⊢ a = c ∧ b = d → b = d
34 33 oveq1d ⊢ a = c ∧ b = d → b 2 = d 2
35 32 34 oveq12d ⊢ a = c ∧ b = d → a 2 + b 2 = c 2 + d 2
36 35 eqeq1d ⊢ a = c ∧ b = d → a 2 + b 2 = P ↔ c 2 + d 2 = P
37 30 36 anbi12d ⊢ a = c ∧ b = d → a ≤ b ∧ a 2 + b 2 = P ↔ c ≤ d ∧ c 2 + d 2 = P
38 37 cbvrexdva ⊢ a = c → ∃ b ∈ ℕ 0 a ≤ b ∧ a 2 + b 2 = P ↔ ∃ d ∈ ℕ 0 c ≤ d ∧ c 2 + d 2 = P
39 38 rmo4 ⊢ ∃* a ∈ ℕ 0 ∃ b ∈ ℕ 0 a ≤ b ∧ a 2 + b 2 = P ↔ ∀ a ∈ ℕ 0 ∀ c ∈ ℕ 0 ∃ b ∈ ℕ 0 a ≤ b ∧ a 2 + b 2 = P ∧ ∃ d ∈ ℕ 0 c ≤ d ∧ c 2 + d 2 = P → a = c
40 29 39 sylibr ⊢ P ∈ ℙ → ∃* a ∈ ℕ 0 ∃ b ∈ ℕ 0 a ≤ b ∧ a 2 + b 2 = P