![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > 2sqlem5 | Structured version Visualization version GIF version |
Description: Lemma for 2sq 26706. If a number that is a sum of two squares is divisible by a prime that is a sum of two squares, then the quotient is a sum of two squares. (Contributed by Mario Carneiro, 20-Jun-2015.) |
Ref | Expression |
---|---|
2sq.1 | ⊢ 𝑆 = ran (𝑤 ∈ ℤ[i] ↦ ((abs‘𝑤)↑2)) |
2sqlem5.1 | ⊢ (𝜑 → 𝑁 ∈ ℕ) |
2sqlem5.2 | ⊢ (𝜑 → 𝑃 ∈ ℙ) |
2sqlem5.3 | ⊢ (𝜑 → (𝑁 · 𝑃) ∈ 𝑆) |
2sqlem5.4 | ⊢ (𝜑 → 𝑃 ∈ 𝑆) |
Ref | Expression |
---|---|
2sqlem5 | ⊢ (𝜑 → 𝑁 ∈ 𝑆) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | 2sqlem5.4 | . . 3 ⊢ (𝜑 → 𝑃 ∈ 𝑆) | |
2 | 2sq.1 | . . . 4 ⊢ 𝑆 = ran (𝑤 ∈ ℤ[i] ↦ ((abs‘𝑤)↑2)) | |
3 | 2 | 2sqlem2 26694 | . . 3 ⊢ (𝑃 ∈ 𝑆 ↔ ∃𝑝 ∈ ℤ ∃𝑞 ∈ ℤ 𝑃 = ((𝑝↑2) + (𝑞↑2))) |
4 | 1, 3 | sylib 217 | . 2 ⊢ (𝜑 → ∃𝑝 ∈ ℤ ∃𝑞 ∈ ℤ 𝑃 = ((𝑝↑2) + (𝑞↑2))) |
5 | 2sqlem5.3 | . . 3 ⊢ (𝜑 → (𝑁 · 𝑃) ∈ 𝑆) | |
6 | 2 | 2sqlem2 26694 | . . 3 ⊢ ((𝑁 · 𝑃) ∈ 𝑆 ↔ ∃𝑥 ∈ ℤ ∃𝑦 ∈ ℤ (𝑁 · 𝑃) = ((𝑥↑2) + (𝑦↑2))) |
7 | 5, 6 | sylib 217 | . 2 ⊢ (𝜑 → ∃𝑥 ∈ ℤ ∃𝑦 ∈ ℤ (𝑁 · 𝑃) = ((𝑥↑2) + (𝑦↑2))) |
8 | reeanv 3216 | . . 3 ⊢ (∃𝑝 ∈ ℤ ∃𝑥 ∈ ℤ (∃𝑞 ∈ ℤ 𝑃 = ((𝑝↑2) + (𝑞↑2)) ∧ ∃𝑦 ∈ ℤ (𝑁 · 𝑃) = ((𝑥↑2) + (𝑦↑2))) ↔ (∃𝑝 ∈ ℤ ∃𝑞 ∈ ℤ 𝑃 = ((𝑝↑2) + (𝑞↑2)) ∧ ∃𝑥 ∈ ℤ ∃𝑦 ∈ ℤ (𝑁 · 𝑃) = ((𝑥↑2) + (𝑦↑2)))) | |
9 | reeanv 3216 | . . . . 5 ⊢ (∃𝑞 ∈ ℤ ∃𝑦 ∈ ℤ (𝑃 = ((𝑝↑2) + (𝑞↑2)) ∧ (𝑁 · 𝑃) = ((𝑥↑2) + (𝑦↑2))) ↔ (∃𝑞 ∈ ℤ 𝑃 = ((𝑝↑2) + (𝑞↑2)) ∧ ∃𝑦 ∈ ℤ (𝑁 · 𝑃) = ((𝑥↑2) + (𝑦↑2)))) | |
10 | 2sqlem5.1 | . . . . . . . . 9 ⊢ (𝜑 → 𝑁 ∈ ℕ) | |
11 | 10 | ad2antrr 725 | . . . . . . . 8 ⊢ (((𝜑 ∧ (𝑝 ∈ ℤ ∧ 𝑥 ∈ ℤ)) ∧ ((𝑞 ∈ ℤ ∧ 𝑦 ∈ ℤ) ∧ (𝑃 = ((𝑝↑2) + (𝑞↑2)) ∧ (𝑁 · 𝑃) = ((𝑥↑2) + (𝑦↑2))))) → 𝑁 ∈ ℕ) |
12 | 2sqlem5.2 | . . . . . . . . 9 ⊢ (𝜑 → 𝑃 ∈ ℙ) | |
13 | 12 | ad2antrr 725 | . . . . . . . 8 ⊢ (((𝜑 ∧ (𝑝 ∈ ℤ ∧ 𝑥 ∈ ℤ)) ∧ ((𝑞 ∈ ℤ ∧ 𝑦 ∈ ℤ) ∧ (𝑃 = ((𝑝↑2) + (𝑞↑2)) ∧ (𝑁 · 𝑃) = ((𝑥↑2) + (𝑦↑2))))) → 𝑃 ∈ ℙ) |
14 | simplrr 777 | . . . . . . . 8 ⊢ (((𝜑 ∧ (𝑝 ∈ ℤ ∧ 𝑥 ∈ ℤ)) ∧ ((𝑞 ∈ ℤ ∧ 𝑦 ∈ ℤ) ∧ (𝑃 = ((𝑝↑2) + (𝑞↑2)) ∧ (𝑁 · 𝑃) = ((𝑥↑2) + (𝑦↑2))))) → 𝑥 ∈ ℤ) | |
15 | simprlr 779 | . . . . . . . 8 ⊢ (((𝜑 ∧ (𝑝 ∈ ℤ ∧ 𝑥 ∈ ℤ)) ∧ ((𝑞 ∈ ℤ ∧ 𝑦 ∈ ℤ) ∧ (𝑃 = ((𝑝↑2) + (𝑞↑2)) ∧ (𝑁 · 𝑃) = ((𝑥↑2) + (𝑦↑2))))) → 𝑦 ∈ ℤ) | |
16 | simplrl 776 | . . . . . . . 8 ⊢ (((𝜑 ∧ (𝑝 ∈ ℤ ∧ 𝑥 ∈ ℤ)) ∧ ((𝑞 ∈ ℤ ∧ 𝑦 ∈ ℤ) ∧ (𝑃 = ((𝑝↑2) + (𝑞↑2)) ∧ (𝑁 · 𝑃) = ((𝑥↑2) + (𝑦↑2))))) → 𝑝 ∈ ℤ) | |
17 | simprll 778 | . . . . . . . 8 ⊢ (((𝜑 ∧ (𝑝 ∈ ℤ ∧ 𝑥 ∈ ℤ)) ∧ ((𝑞 ∈ ℤ ∧ 𝑦 ∈ ℤ) ∧ (𝑃 = ((𝑝↑2) + (𝑞↑2)) ∧ (𝑁 · 𝑃) = ((𝑥↑2) + (𝑦↑2))))) → 𝑞 ∈ ℤ) | |
18 | simprrr 781 | . . . . . . . 8 ⊢ (((𝜑 ∧ (𝑝 ∈ ℤ ∧ 𝑥 ∈ ℤ)) ∧ ((𝑞 ∈ ℤ ∧ 𝑦 ∈ ℤ) ∧ (𝑃 = ((𝑝↑2) + (𝑞↑2)) ∧ (𝑁 · 𝑃) = ((𝑥↑2) + (𝑦↑2))))) → (𝑁 · 𝑃) = ((𝑥↑2) + (𝑦↑2))) | |
19 | simprrl 780 | . . . . . . . 8 ⊢ (((𝜑 ∧ (𝑝 ∈ ℤ ∧ 𝑥 ∈ ℤ)) ∧ ((𝑞 ∈ ℤ ∧ 𝑦 ∈ ℤ) ∧ (𝑃 = ((𝑝↑2) + (𝑞↑2)) ∧ (𝑁 · 𝑃) = ((𝑥↑2) + (𝑦↑2))))) → 𝑃 = ((𝑝↑2) + (𝑞↑2))) | |
20 | 2, 11, 13, 14, 15, 16, 17, 18, 19 | 2sqlem4 26697 | . . . . . . 7 ⊢ (((𝜑 ∧ (𝑝 ∈ ℤ ∧ 𝑥 ∈ ℤ)) ∧ ((𝑞 ∈ ℤ ∧ 𝑦 ∈ ℤ) ∧ (𝑃 = ((𝑝↑2) + (𝑞↑2)) ∧ (𝑁 · 𝑃) = ((𝑥↑2) + (𝑦↑2))))) → 𝑁 ∈ 𝑆) |
21 | 20 | expr 458 | . . . . . 6 ⊢ (((𝜑 ∧ (𝑝 ∈ ℤ ∧ 𝑥 ∈ ℤ)) ∧ (𝑞 ∈ ℤ ∧ 𝑦 ∈ ℤ)) → ((𝑃 = ((𝑝↑2) + (𝑞↑2)) ∧ (𝑁 · 𝑃) = ((𝑥↑2) + (𝑦↑2))) → 𝑁 ∈ 𝑆)) |
22 | 21 | rexlimdvva 3204 | . . . . 5 ⊢ ((𝜑 ∧ (𝑝 ∈ ℤ ∧ 𝑥 ∈ ℤ)) → (∃𝑞 ∈ ℤ ∃𝑦 ∈ ℤ (𝑃 = ((𝑝↑2) + (𝑞↑2)) ∧ (𝑁 · 𝑃) = ((𝑥↑2) + (𝑦↑2))) → 𝑁 ∈ 𝑆)) |
23 | 9, 22 | biimtrrid 242 | . . . 4 ⊢ ((𝜑 ∧ (𝑝 ∈ ℤ ∧ 𝑥 ∈ ℤ)) → ((∃𝑞 ∈ ℤ 𝑃 = ((𝑝↑2) + (𝑞↑2)) ∧ ∃𝑦 ∈ ℤ (𝑁 · 𝑃) = ((𝑥↑2) + (𝑦↑2))) → 𝑁 ∈ 𝑆)) |
24 | 23 | rexlimdvva 3204 | . . 3 ⊢ (𝜑 → (∃𝑝 ∈ ℤ ∃𝑥 ∈ ℤ (∃𝑞 ∈ ℤ 𝑃 = ((𝑝↑2) + (𝑞↑2)) ∧ ∃𝑦 ∈ ℤ (𝑁 · 𝑃) = ((𝑥↑2) + (𝑦↑2))) → 𝑁 ∈ 𝑆)) |
25 | 8, 24 | biimtrrid 242 | . 2 ⊢ (𝜑 → ((∃𝑝 ∈ ℤ ∃𝑞 ∈ ℤ 𝑃 = ((𝑝↑2) + (𝑞↑2)) ∧ ∃𝑥 ∈ ℤ ∃𝑦 ∈ ℤ (𝑁 · 𝑃) = ((𝑥↑2) + (𝑦↑2))) → 𝑁 ∈ 𝑆)) |
26 | 4, 7, 25 | mp2and 698 | 1 ⊢ (𝜑 → 𝑁 ∈ 𝑆) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 397 = wceq 1542 ∈ wcel 2107 ∃wrex 3072 ↦ cmpt 5187 ran crn 5632 ‘cfv 6492 (class class class)co 7350 + caddc 10988 · cmul 10990 ℕcn 12087 2c2 12142 ℤcz 12433 ↑cexp 13897 abscabs 15054 ℙcprime 16483 ℤ[i]cgz 16737 |
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 1914 ax-6 1972 ax-7 2012 ax-8 2109 ax-9 2117 ax-10 2138 ax-11 2155 ax-12 2172 ax-ext 2709 ax-sep 5255 ax-nul 5262 ax-pow 5319 ax-pr 5383 ax-un 7663 ax-cnex 11041 ax-resscn 11042 ax-1cn 11043 ax-icn 11044 ax-addcl 11045 ax-addrcl 11046 ax-mulcl 11047 ax-mulrcl 11048 ax-mulcom 11049 ax-addass 11050 ax-mulass 11051 ax-distr 11052 ax-i2m1 11053 ax-1ne0 11054 ax-1rid 11055 ax-rnegex 11056 ax-rrecex 11057 ax-cnre 11058 ax-pre-lttri 11059 ax-pre-lttrn 11060 ax-pre-ltadd 11061 ax-pre-mulgt0 11062 ax-pre-sup 11063 |
This theorem depends on definitions: df-bi 206 df-an 398 df-or 847 df-3or 1089 df-3an 1090 df-tru 1545 df-fal 1555 df-ex 1783 df-nf 1787 df-sb 2069 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2816 df-nfc 2888 df-ne 2943 df-nel 3049 df-ral 3064 df-rex 3073 df-rmo 3352 df-reu 3353 df-rab 3407 df-v 3446 df-sbc 3739 df-csb 3855 df-dif 3912 df-un 3914 df-in 3916 df-ss 3926 df-pss 3928 df-nul 4282 df-if 4486 df-pw 4561 df-sn 4586 df-pr 4588 df-op 4592 df-uni 4865 df-iun 4955 df-br 5105 df-opab 5167 df-mpt 5188 df-tr 5222 df-id 5529 df-eprel 5535 df-po 5543 df-so 5544 df-fr 5586 df-we 5588 df-xp 5637 df-rel 5638 df-cnv 5639 df-co 5640 df-dm 5641 df-rn 5642 df-res 5643 df-ima 5644 df-pred 6250 df-ord 6317 df-on 6318 df-lim 6319 df-suc 6320 df-iota 6444 df-fun 6494 df-fn 6495 df-f 6496 df-f1 6497 df-fo 6498 df-f1o 6499 df-fv 6500 df-riota 7306 df-ov 7353 df-oprab 7354 df-mpo 7355 df-om 7794 df-2nd 7913 df-frecs 8180 df-wrecs 8211 df-recs 8285 df-rdg 8324 df-1o 8380 df-2o 8381 df-er 8582 df-en 8818 df-dom 8819 df-sdom 8820 df-fin 8821 df-sup 9312 df-inf 9313 df-pnf 11125 df-mnf 11126 df-xr 11127 df-ltxr 11128 df-le 11129 df-sub 11321 df-neg 11322 df-div 11747 df-nn 12088 df-2 12150 df-3 12151 df-n0 12348 df-z 12434 df-uz 12698 df-rp 12846 df-fl 13627 df-mod 13705 df-seq 13837 df-exp 13898 df-cj 14919 df-re 14920 df-im 14921 df-sqrt 15055 df-abs 15056 df-dvds 16073 df-gcd 16311 df-prm 16484 df-gz 16738 |
This theorem is referenced by: 2sqlem6 26699 |
Copyright terms: Public domain | W3C validator |