![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > 2sqreunnltblem | Structured version Visualization version GIF version |
Description: Lemma for 2sqreunnltb 26891. (Contributed by AV, 11-Jun-2023.) The prime needs not be odd, as observed by WL. (Revised by AV, 18-Jun-2023.) |
Ref | Expression |
---|---|
2sqreunnltblem | ⊢ (𝑃 ∈ ℙ → ((𝑃 mod 4) = 1 ↔ ∃!𝑎 ∈ ℕ ∃!𝑏 ∈ ℕ (𝑎 < 𝑏 ∧ ((𝑎↑2) + (𝑏↑2)) = 𝑃))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | 2sqreunnltlem 26880 | . . 3 ⊢ ((𝑃 ∈ ℙ ∧ (𝑃 mod 4) = 1) → ∃!𝑎 ∈ ℕ ∃!𝑏 ∈ ℕ (𝑎 < 𝑏 ∧ ((𝑎↑2) + (𝑏↑2)) = 𝑃)) | |
2 | 1 | ex 413 | . 2 ⊢ (𝑃 ∈ ℙ → ((𝑃 mod 4) = 1 → ∃!𝑎 ∈ ℕ ∃!𝑏 ∈ ℕ (𝑎 < 𝑏 ∧ ((𝑎↑2) + (𝑏↑2)) = 𝑃))) |
3 | 2reu2rex 3389 | . . . . 5 ⊢ (∃!𝑎 ∈ ℕ ∃!𝑏 ∈ ℕ (𝑎 < 𝑏 ∧ ((𝑎↑2) + (𝑏↑2)) = 𝑃) → ∃𝑎 ∈ ℕ ∃𝑏 ∈ ℕ (𝑎 < 𝑏 ∧ ((𝑎↑2) + (𝑏↑2)) = 𝑃)) | |
4 | eqeq2 2743 | . . . . . . . . 9 ⊢ (𝑃 = 2 → (((𝑎↑2) + (𝑏↑2)) = 𝑃 ↔ ((𝑎↑2) + (𝑏↑2)) = 2)) | |
5 | 4 | adantr 481 | . . . . . . . 8 ⊢ ((𝑃 = 2 ∧ (𝑎 ∈ ℕ ∧ 𝑏 ∈ ℕ)) → (((𝑎↑2) + (𝑏↑2)) = 𝑃 ↔ ((𝑎↑2) + (𝑏↑2)) = 2)) |
6 | nnnn0 12461 | . . . . . . . . . . 11 ⊢ (𝑎 ∈ ℕ → 𝑎 ∈ ℕ0) | |
7 | nnnn0 12461 | . . . . . . . . . . 11 ⊢ (𝑏 ∈ ℕ → 𝑏 ∈ ℕ0) | |
8 | 2sq2 26863 | . . . . . . . . . . 11 ⊢ ((𝑎 ∈ ℕ0 ∧ 𝑏 ∈ ℕ0) → (((𝑎↑2) + (𝑏↑2)) = 2 ↔ (𝑎 = 1 ∧ 𝑏 = 1))) | |
9 | 6, 7, 8 | syl2an 596 | . . . . . . . . . 10 ⊢ ((𝑎 ∈ ℕ ∧ 𝑏 ∈ ℕ) → (((𝑎↑2) + (𝑏↑2)) = 2 ↔ (𝑎 = 1 ∧ 𝑏 = 1))) |
10 | breq12 5146 | . . . . . . . . . . 11 ⊢ ((𝑎 = 1 ∧ 𝑏 = 1) → (𝑎 < 𝑏 ↔ 1 < 1)) | |
11 | 1re 11196 | . . . . . . . . . . . . 13 ⊢ 1 ∈ ℝ | |
12 | 11 | ltnri 11305 | . . . . . . . . . . . 12 ⊢ ¬ 1 < 1 |
13 | 12 | pm2.21i 119 | . . . . . . . . . . 11 ⊢ (1 < 1 → (𝑃 mod 4) = 1) |
14 | 10, 13 | syl6bi 252 | . . . . . . . . . 10 ⊢ ((𝑎 = 1 ∧ 𝑏 = 1) → (𝑎 < 𝑏 → (𝑃 mod 4) = 1)) |
15 | 9, 14 | syl6bi 252 | . . . . . . . . 9 ⊢ ((𝑎 ∈ ℕ ∧ 𝑏 ∈ ℕ) → (((𝑎↑2) + (𝑏↑2)) = 2 → (𝑎 < 𝑏 → (𝑃 mod 4) = 1))) |
16 | 15 | adantl 482 | . . . . . . . 8 ⊢ ((𝑃 = 2 ∧ (𝑎 ∈ ℕ ∧ 𝑏 ∈ ℕ)) → (((𝑎↑2) + (𝑏↑2)) = 2 → (𝑎 < 𝑏 → (𝑃 mod 4) = 1))) |
17 | 5, 16 | sylbid 239 | . . . . . . 7 ⊢ ((𝑃 = 2 ∧ (𝑎 ∈ ℕ ∧ 𝑏 ∈ ℕ)) → (((𝑎↑2) + (𝑏↑2)) = 𝑃 → (𝑎 < 𝑏 → (𝑃 mod 4) = 1))) |
18 | 17 | impcomd 412 | . . . . . 6 ⊢ ((𝑃 = 2 ∧ (𝑎 ∈ ℕ ∧ 𝑏 ∈ ℕ)) → ((𝑎 < 𝑏 ∧ ((𝑎↑2) + (𝑏↑2)) = 𝑃) → (𝑃 mod 4) = 1)) |
19 | 18 | rexlimdvva 3210 | . . . . 5 ⊢ (𝑃 = 2 → (∃𝑎 ∈ ℕ ∃𝑏 ∈ ℕ (𝑎 < 𝑏 ∧ ((𝑎↑2) + (𝑏↑2)) = 𝑃) → (𝑃 mod 4) = 1)) |
20 | 3, 19 | syl5 34 | . . . 4 ⊢ (𝑃 = 2 → (∃!𝑎 ∈ ℕ ∃!𝑏 ∈ ℕ (𝑎 < 𝑏 ∧ ((𝑎↑2) + (𝑏↑2)) = 𝑃) → (𝑃 mod 4) = 1)) |
21 | 20 | a1d 25 | . . 3 ⊢ (𝑃 = 2 → (𝑃 ∈ ℙ → (∃!𝑎 ∈ ℕ ∃!𝑏 ∈ ℕ (𝑎 < 𝑏 ∧ ((𝑎↑2) + (𝑏↑2)) = 𝑃) → (𝑃 mod 4) = 1))) |
22 | nnssz 12562 | . . . . . . . . 9 ⊢ ℕ ⊆ ℤ | |
23 | id 22 | . . . . . . . . . . . . . 14 ⊢ (((𝑎↑2) + (𝑏↑2)) = 𝑃 → ((𝑎↑2) + (𝑏↑2)) = 𝑃) | |
24 | 23 | eqcomd 2737 | . . . . . . . . . . . . 13 ⊢ (((𝑎↑2) + (𝑏↑2)) = 𝑃 → 𝑃 = ((𝑎↑2) + (𝑏↑2))) |
25 | 24 | adantl 482 | . . . . . . . . . . . 12 ⊢ ((𝑎 < 𝑏 ∧ ((𝑎↑2) + (𝑏↑2)) = 𝑃) → 𝑃 = ((𝑎↑2) + (𝑏↑2))) |
26 | 25 | reximi 3083 | . . . . . . . . . . 11 ⊢ (∃𝑏 ∈ ℕ (𝑎 < 𝑏 ∧ ((𝑎↑2) + (𝑏↑2)) = 𝑃) → ∃𝑏 ∈ ℕ 𝑃 = ((𝑎↑2) + (𝑏↑2))) |
27 | 26 | reximi 3083 | . . . . . . . . . 10 ⊢ (∃𝑎 ∈ ℕ ∃𝑏 ∈ ℕ (𝑎 < 𝑏 ∧ ((𝑎↑2) + (𝑏↑2)) = 𝑃) → ∃𝑎 ∈ ℕ ∃𝑏 ∈ ℕ 𝑃 = ((𝑎↑2) + (𝑏↑2))) |
28 | ssrexv 4047 | . . . . . . . . . . . 12 ⊢ (ℕ ⊆ ℤ → (∃𝑏 ∈ ℕ 𝑃 = ((𝑎↑2) + (𝑏↑2)) → ∃𝑏 ∈ ℤ 𝑃 = ((𝑎↑2) + (𝑏↑2)))) | |
29 | 22, 28 | ax-mp 5 | . . . . . . . . . . 11 ⊢ (∃𝑏 ∈ ℕ 𝑃 = ((𝑎↑2) + (𝑏↑2)) → ∃𝑏 ∈ ℤ 𝑃 = ((𝑎↑2) + (𝑏↑2))) |
30 | 29 | reximi 3083 | . . . . . . . . . 10 ⊢ (∃𝑎 ∈ ℕ ∃𝑏 ∈ ℕ 𝑃 = ((𝑎↑2) + (𝑏↑2)) → ∃𝑎 ∈ ℕ ∃𝑏 ∈ ℤ 𝑃 = ((𝑎↑2) + (𝑏↑2))) |
31 | 3, 27, 30 | 3syl 18 | . . . . . . . . 9 ⊢ (∃!𝑎 ∈ ℕ ∃!𝑏 ∈ ℕ (𝑎 < 𝑏 ∧ ((𝑎↑2) + (𝑏↑2)) = 𝑃) → ∃𝑎 ∈ ℕ ∃𝑏 ∈ ℤ 𝑃 = ((𝑎↑2) + (𝑏↑2))) |
32 | ssrexv 4047 | . . . . . . . . 9 ⊢ (ℕ ⊆ ℤ → (∃𝑎 ∈ ℕ ∃𝑏 ∈ ℤ 𝑃 = ((𝑎↑2) + (𝑏↑2)) → ∃𝑎 ∈ ℤ ∃𝑏 ∈ ℤ 𝑃 = ((𝑎↑2) + (𝑏↑2)))) | |
33 | 22, 31, 32 | mpsyl 68 | . . . . . . . 8 ⊢ (∃!𝑎 ∈ ℕ ∃!𝑏 ∈ ℕ (𝑎 < 𝑏 ∧ ((𝑎↑2) + (𝑏↑2)) = 𝑃) → ∃𝑎 ∈ ℤ ∃𝑏 ∈ ℤ 𝑃 = ((𝑎↑2) + (𝑏↑2))) |
34 | 33 | adantl 482 | . . . . . . 7 ⊢ ((𝑃 ∈ ℙ ∧ ∃!𝑎 ∈ ℕ ∃!𝑏 ∈ ℕ (𝑎 < 𝑏 ∧ ((𝑎↑2) + (𝑏↑2)) = 𝑃)) → ∃𝑎 ∈ ℤ ∃𝑏 ∈ ℤ 𝑃 = ((𝑎↑2) + (𝑏↑2))) |
35 | 2sqb 26862 | . . . . . . . 8 ⊢ (𝑃 ∈ ℙ → (∃𝑎 ∈ ℤ ∃𝑏 ∈ ℤ 𝑃 = ((𝑎↑2) + (𝑏↑2)) ↔ (𝑃 = 2 ∨ (𝑃 mod 4) = 1))) | |
36 | 35 | adantr 481 | . . . . . . 7 ⊢ ((𝑃 ∈ ℙ ∧ ∃!𝑎 ∈ ℕ ∃!𝑏 ∈ ℕ (𝑎 < 𝑏 ∧ ((𝑎↑2) + (𝑏↑2)) = 𝑃)) → (∃𝑎 ∈ ℤ ∃𝑏 ∈ ℤ 𝑃 = ((𝑎↑2) + (𝑏↑2)) ↔ (𝑃 = 2 ∨ (𝑃 mod 4) = 1))) |
37 | 34, 36 | mpbid 231 | . . . . . 6 ⊢ ((𝑃 ∈ ℙ ∧ ∃!𝑎 ∈ ℕ ∃!𝑏 ∈ ℕ (𝑎 < 𝑏 ∧ ((𝑎↑2) + (𝑏↑2)) = 𝑃)) → (𝑃 = 2 ∨ (𝑃 mod 4) = 1)) |
38 | 37 | ord 862 | . . . . 5 ⊢ ((𝑃 ∈ ℙ ∧ ∃!𝑎 ∈ ℕ ∃!𝑏 ∈ ℕ (𝑎 < 𝑏 ∧ ((𝑎↑2) + (𝑏↑2)) = 𝑃)) → (¬ 𝑃 = 2 → (𝑃 mod 4) = 1)) |
39 | 38 | expcom 414 | . . . 4 ⊢ (∃!𝑎 ∈ ℕ ∃!𝑏 ∈ ℕ (𝑎 < 𝑏 ∧ ((𝑎↑2) + (𝑏↑2)) = 𝑃) → (𝑃 ∈ ℙ → (¬ 𝑃 = 2 → (𝑃 mod 4) = 1))) |
40 | 39 | com13 88 | . . 3 ⊢ (¬ 𝑃 = 2 → (𝑃 ∈ ℙ → (∃!𝑎 ∈ ℕ ∃!𝑏 ∈ ℕ (𝑎 < 𝑏 ∧ ((𝑎↑2) + (𝑏↑2)) = 𝑃) → (𝑃 mod 4) = 1))) |
41 | 21, 40 | pm2.61i 182 | . 2 ⊢ (𝑃 ∈ ℙ → (∃!𝑎 ∈ ℕ ∃!𝑏 ∈ ℕ (𝑎 < 𝑏 ∧ ((𝑎↑2) + (𝑏↑2)) = 𝑃) → (𝑃 mod 4) = 1)) |
42 | 2, 41 | impbid 211 | 1 ⊢ (𝑃 ∈ ℙ → ((𝑃 mod 4) = 1 ↔ ∃!𝑎 ∈ ℕ ∃!𝑏 ∈ ℕ (𝑎 < 𝑏 ∧ ((𝑎↑2) + (𝑏↑2)) = 𝑃))) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ↔ wb 205 ∧ wa 396 ∨ wo 845 = wceq 1541 ∈ wcel 2106 ∃wrex 3069 ∃!wreu 3373 ⊆ wss 3944 class class class wbr 5141 (class class class)co 7393 1c1 11093 + caddc 11095 < clt 11230 ℕcn 12194 2c2 12249 4c4 12251 ℕ0cn0 12454 ℤcz 12540 mod cmo 13816 ↑cexp 14009 ℙcprime 16590 |
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 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2702 ax-rep 5278 ax-sep 5292 ax-nul 5299 ax-pow 5356 ax-pr 5420 ax-un 7708 ax-cnex 11148 ax-resscn 11149 ax-1cn 11150 ax-icn 11151 ax-addcl 11152 ax-addrcl 11153 ax-mulcl 11154 ax-mulrcl 11155 ax-mulcom 11156 ax-addass 11157 ax-mulass 11158 ax-distr 11159 ax-i2m1 11160 ax-1ne0 11161 ax-1rid 11162 ax-rnegex 11163 ax-rrecex 11164 ax-cnre 11165 ax-pre-lttri 11166 ax-pre-lttrn 11167 ax-pre-ltadd 11168 ax-pre-mulgt0 11169 ax-pre-sup 11170 ax-addf 11171 ax-mulf 11172 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 846 df-3or 1088 df-3an 1089 df-tru 1544 df-fal 1554 df-ex 1782 df-nf 1786 df-sb 2068 df-mo 2533 df-eu 2562 df-clab 2709 df-cleq 2723 df-clel 2809 df-nfc 2884 df-ne 2940 df-nel 3046 df-ral 3061 df-rex 3070 df-rmo 3375 df-reu 3376 df-rab 3432 df-v 3475 df-sbc 3774 df-csb 3890 df-dif 3947 df-un 3949 df-in 3951 df-ss 3961 df-pss 3963 df-nul 4319 df-if 4523 df-pw 4598 df-sn 4623 df-pr 4625 df-tp 4627 df-op 4629 df-uni 4902 df-int 4944 df-iun 4992 df-iin 4993 df-br 5142 df-opab 5204 df-mpt 5225 df-tr 5259 df-id 5567 df-eprel 5573 df-po 5581 df-so 5582 df-fr 5624 df-se 5625 df-we 5626 df-xp 5675 df-rel 5676 df-cnv 5677 df-co 5678 df-dm 5679 df-rn 5680 df-res 5681 df-ima 5682 df-pred 6289 df-ord 6356 df-on 6357 df-lim 6358 df-suc 6359 df-iota 6484 df-fun 6534 df-fn 6535 df-f 6536 df-f1 6537 df-fo 6538 df-f1o 6539 df-fv 6540 df-isom 6541 df-riota 7349 df-ov 7396 df-oprab 7397 df-mpo 7398 df-of 7653 df-ofr 7654 df-om 7839 df-1st 7957 df-2nd 7958 df-supp 8129 df-tpos 8193 df-frecs 8248 df-wrecs 8279 df-recs 8353 df-rdg 8392 df-1o 8448 df-2o 8449 df-oadd 8452 df-er 8686 df-ec 8688 df-qs 8692 df-map 8805 df-pm 8806 df-ixp 8875 df-en 8923 df-dom 8924 df-sdom 8925 df-fin 8926 df-fsupp 9345 df-sup 9419 df-inf 9420 df-oi 9487 df-dju 9878 df-card 9916 df-pnf 11232 df-mnf 11233 df-xr 11234 df-ltxr 11235 df-le 11236 df-sub 11428 df-neg 11429 df-div 11854 df-nn 12195 df-2 12257 df-3 12258 df-4 12259 df-5 12260 df-6 12261 df-7 12262 df-8 12263 df-9 12264 df-n0 12455 df-xnn0 12527 df-z 12541 df-dec 12660 df-uz 12805 df-q 12915 df-rp 12957 df-fz 13467 df-fzo 13610 df-fl 13739 df-mod 13817 df-seq 13949 df-exp 14010 df-hash 14273 df-cj 15028 df-re 15029 df-im 15030 df-sqrt 15164 df-abs 15165 df-dvds 16180 df-gcd 16418 df-prm 16591 df-phi 16681 df-pc 16752 df-gz 16845 df-struct 17062 df-sets 17079 df-slot 17097 df-ndx 17109 df-base 17127 df-ress 17156 df-plusg 17192 df-mulr 17193 df-starv 17194 df-sca 17195 df-vsca 17196 df-ip 17197 df-tset 17198 df-ple 17199 df-ds 17201 df-unif 17202 df-hom 17203 df-cco 17204 df-0g 17369 df-gsum 17370 df-prds 17375 df-pws 17377 df-imas 17436 df-qus 17437 df-mre 17512 df-mrc 17513 df-acs 17515 df-mgm 18543 df-sgrp 18592 df-mnd 18603 df-mhm 18647 df-submnd 18648 df-grp 18797 df-minusg 18798 df-sbg 18799 df-mulg 18923 df-subg 18975 df-nsg 18976 df-eqg 18977 df-ghm 19056 df-cntz 19147 df-cmn 19614 df-abl 19615 df-mgp 19947 df-ur 19964 df-srg 19968 df-ring 20016 df-cring 20017 df-oppr 20102 df-dvdsr 20123 df-unit 20124 df-invr 20154 df-dvr 20165 df-rnghom 20201 df-nzr 20242 df-drng 20267 df-field 20268 df-subrg 20310 df-lmod 20422 df-lss 20492 df-lsp 20532 df-sra 20734 df-rgmod 20735 df-lidl 20736 df-rsp 20737 df-2idl 20803 df-rlreg 20835 df-domn 20836 df-idom 20837 df-cnfld 20879 df-zring 20952 df-zrh 20986 df-zn 20989 df-assa 21341 df-asp 21342 df-ascl 21343 df-psr 21393 df-mvr 21394 df-mpl 21395 df-opsr 21397 df-evls 21564 df-evl 21565 df-psr1 21633 df-vr1 21634 df-ply1 21635 df-coe1 21636 df-evl1 21764 df-mdeg 25499 df-deg1 25500 df-mon1 25577 df-uc1p 25578 df-q1p 25579 df-r1p 25580 df-lgs 26725 |
This theorem is referenced by: 2sqreunnltb 26891 |
Copyright terms: Public domain | W3C validator |