Mathbox for Stefan O'Rear |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > Mathboxes > rmspecnonsq | Structured version Visualization version GIF version |
Description: The discriminant used to define the X and Y sequences is a nonsquare positive integer and thus a valid Pell equation discriminant. (Contributed by Stefan O'Rear, 21-Sep-2014.) |
Ref | Expression |
---|---|
rmspecnonsq | ⊢ (𝐴 ∈ (ℤ≥‘2) → ((𝐴↑2) − 1) ∈ (ℕ ∖ ◻NN)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | eluzelz 12327 | . . . . 5 ⊢ (𝐴 ∈ (ℤ≥‘2) → 𝐴 ∈ ℤ) | |
2 | zsqcl 13579 | . . . . 5 ⊢ (𝐴 ∈ ℤ → (𝐴↑2) ∈ ℤ) | |
3 | 1, 2 | syl 17 | . . . 4 ⊢ (𝐴 ∈ (ℤ≥‘2) → (𝐴↑2) ∈ ℤ) |
4 | 1zzd 12087 | . . . 4 ⊢ (𝐴 ∈ (ℤ≥‘2) → 1 ∈ ℤ) | |
5 | 3, 4 | zsubcld 12166 | . . 3 ⊢ (𝐴 ∈ (ℤ≥‘2) → ((𝐴↑2) − 1) ∈ ℤ) |
6 | sq1 13643 | . . . . 5 ⊢ (1↑2) = 1 | |
7 | eluz2b2 12396 | . . . . . . 7 ⊢ (𝐴 ∈ (ℤ≥‘2) ↔ (𝐴 ∈ ℕ ∧ 1 < 𝐴)) | |
8 | 7 | simprbi 500 | . . . . . 6 ⊢ (𝐴 ∈ (ℤ≥‘2) → 1 < 𝐴) |
9 | 1red 10713 | . . . . . . 7 ⊢ (𝐴 ∈ (ℤ≥‘2) → 1 ∈ ℝ) | |
10 | eluzelre 12328 | . . . . . . 7 ⊢ (𝐴 ∈ (ℤ≥‘2) → 𝐴 ∈ ℝ) | |
11 | 0le1 11234 | . . . . . . . 8 ⊢ 0 ≤ 1 | |
12 | 11 | a1i 11 | . . . . . . 7 ⊢ (𝐴 ∈ (ℤ≥‘2) → 0 ≤ 1) |
13 | eluzge2nn0 12362 | . . . . . . . 8 ⊢ (𝐴 ∈ (ℤ≥‘2) → 𝐴 ∈ ℕ0) | |
14 | 13 | nn0ge0d 12032 | . . . . . . 7 ⊢ (𝐴 ∈ (ℤ≥‘2) → 0 ≤ 𝐴) |
15 | 9, 10, 12, 14 | lt2sqd 13704 | . . . . . 6 ⊢ (𝐴 ∈ (ℤ≥‘2) → (1 < 𝐴 ↔ (1↑2) < (𝐴↑2))) |
16 | 8, 15 | mpbid 235 | . . . . 5 ⊢ (𝐴 ∈ (ℤ≥‘2) → (1↑2) < (𝐴↑2)) |
17 | 6, 16 | eqbrtrrid 5063 | . . . 4 ⊢ (𝐴 ∈ (ℤ≥‘2) → 1 < (𝐴↑2)) |
18 | 10 | resqcld 13696 | . . . . 5 ⊢ (𝐴 ∈ (ℤ≥‘2) → (𝐴↑2) ∈ ℝ) |
19 | 9, 18 | posdifd 11298 | . . . 4 ⊢ (𝐴 ∈ (ℤ≥‘2) → (1 < (𝐴↑2) ↔ 0 < ((𝐴↑2) − 1))) |
20 | 17, 19 | mpbid 235 | . . 3 ⊢ (𝐴 ∈ (ℤ≥‘2) → 0 < ((𝐴↑2) − 1)) |
21 | elnnz 12065 | . . 3 ⊢ (((𝐴↑2) − 1) ∈ ℕ ↔ (((𝐴↑2) − 1) ∈ ℤ ∧ 0 < ((𝐴↑2) − 1))) | |
22 | 5, 20, 21 | sylanbrc 586 | . 2 ⊢ (𝐴 ∈ (ℤ≥‘2) → ((𝐴↑2) − 1) ∈ ℕ) |
23 | rmspecsqrtnq 40284 | . . . . 5 ⊢ (𝐴 ∈ (ℤ≥‘2) → (√‘((𝐴↑2) − 1)) ∈ (ℂ ∖ ℚ)) | |
24 | 23 | eldifbd 3854 | . . . 4 ⊢ (𝐴 ∈ (ℤ≥‘2) → ¬ (√‘((𝐴↑2) − 1)) ∈ ℚ) |
25 | 24 | intnand 492 | . . 3 ⊢ (𝐴 ∈ (ℤ≥‘2) → ¬ (((𝐴↑2) − 1) ∈ ℕ ∧ (√‘((𝐴↑2) − 1)) ∈ ℚ)) |
26 | df-squarenn 40219 | . . . . 5 ⊢ ◻NN = {𝑎 ∈ ℕ ∣ (√‘𝑎) ∈ ℚ} | |
27 | 26 | eleq2i 2824 | . . . 4 ⊢ (((𝐴↑2) − 1) ∈ ◻NN ↔ ((𝐴↑2) − 1) ∈ {𝑎 ∈ ℕ ∣ (√‘𝑎) ∈ ℚ}) |
28 | fveq2 6668 | . . . . . 6 ⊢ (𝑎 = ((𝐴↑2) − 1) → (√‘𝑎) = (√‘((𝐴↑2) − 1))) | |
29 | 28 | eleq1d 2817 | . . . . 5 ⊢ (𝑎 = ((𝐴↑2) − 1) → ((√‘𝑎) ∈ ℚ ↔ (√‘((𝐴↑2) − 1)) ∈ ℚ)) |
30 | 29 | elrab 3585 | . . . 4 ⊢ (((𝐴↑2) − 1) ∈ {𝑎 ∈ ℕ ∣ (√‘𝑎) ∈ ℚ} ↔ (((𝐴↑2) − 1) ∈ ℕ ∧ (√‘((𝐴↑2) − 1)) ∈ ℚ)) |
31 | 27, 30 | bitr2i 279 | . . 3 ⊢ ((((𝐴↑2) − 1) ∈ ℕ ∧ (√‘((𝐴↑2) − 1)) ∈ ℚ) ↔ ((𝐴↑2) − 1) ∈ ◻NN) |
32 | 25, 31 | sylnib 331 | . 2 ⊢ (𝐴 ∈ (ℤ≥‘2) → ¬ ((𝐴↑2) − 1) ∈ ◻NN) |
33 | 22, 32 | eldifd 3852 | 1 ⊢ (𝐴 ∈ (ℤ≥‘2) → ((𝐴↑2) − 1) ∈ (ℕ ∖ ◻NN)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 399 = wceq 1542 ∈ wcel 2113 {crab 3057 ∖ cdif 3838 class class class wbr 5027 ‘cfv 6333 (class class class)co 7164 ℂcc 10606 0cc0 10608 1c1 10609 < clt 10746 ≤ cle 10747 − cmin 10941 ℕcn 11709 2c2 11764 ℤcz 12055 ℤ≥cuz 12317 ℚcq 12423 ↑cexp 13514 √csqrt 14675 ◻NNcsquarenn 40214 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1916 ax-6 1974 ax-7 2019 ax-8 2115 ax-9 2123 ax-10 2144 ax-11 2161 ax-12 2178 ax-ext 2710 ax-sep 5164 ax-nul 5171 ax-pow 5229 ax-pr 5293 ax-un 7473 ax-cnex 10664 ax-resscn 10665 ax-1cn 10666 ax-icn 10667 ax-addcl 10668 ax-addrcl 10669 ax-mulcl 10670 ax-mulrcl 10671 ax-mulcom 10672 ax-addass 10673 ax-mulass 10674 ax-distr 10675 ax-i2m1 10676 ax-1ne0 10677 ax-1rid 10678 ax-rnegex 10679 ax-rrecex 10680 ax-cnre 10681 ax-pre-lttri 10682 ax-pre-lttrn 10683 ax-pre-ltadd 10684 ax-pre-mulgt0 10685 ax-pre-sup 10686 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 847 df-3or 1089 df-3an 1090 df-tru 1545 df-fal 1555 df-ex 1787 df-nf 1791 df-sb 2074 df-mo 2540 df-eu 2570 df-clab 2717 df-cleq 2730 df-clel 2811 df-nfc 2881 df-ne 2935 df-nel 3039 df-ral 3058 df-rex 3059 df-reu 3060 df-rmo 3061 df-rab 3062 df-v 3399 df-sbc 3680 df-csb 3789 df-dif 3844 df-un 3846 df-in 3848 df-ss 3858 df-pss 3860 df-nul 4210 df-if 4412 df-pw 4487 df-sn 4514 df-pr 4516 df-tp 4518 df-op 4520 df-uni 4794 df-iun 4880 df-br 5028 df-opab 5090 df-mpt 5108 df-tr 5134 df-id 5425 df-eprel 5430 df-po 5438 df-so 5439 df-fr 5478 df-we 5480 df-xp 5525 df-rel 5526 df-cnv 5527 df-co 5528 df-dm 5529 df-rn 5530 df-res 5531 df-ima 5532 df-pred 6123 df-ord 6169 df-on 6170 df-lim 6171 df-suc 6172 df-iota 6291 df-fun 6335 df-fn 6336 df-f 6337 df-f1 6338 df-fo 6339 df-f1o 6340 df-fv 6341 df-riota 7121 df-ov 7167 df-oprab 7168 df-mpo 7169 df-om 7594 df-1st 7707 df-2nd 7708 df-wrecs 7969 df-recs 8030 df-rdg 8068 df-er 8313 df-en 8549 df-dom 8550 df-sdom 8551 df-sup 8972 df-inf 8973 df-pnf 10748 df-mnf 10749 df-xr 10750 df-ltxr 10751 df-le 10752 df-sub 10943 df-neg 10944 df-div 11369 df-nn 11710 df-2 11772 df-3 11773 df-n0 11970 df-z 12056 df-uz 12318 df-q 12424 df-rp 12466 df-fl 13246 df-mod 13322 df-seq 13454 df-exp 13515 df-cj 14541 df-re 14542 df-im 14543 df-sqrt 14677 df-abs 14678 df-dvds 15693 df-gcd 15931 df-numer 16168 df-denom 16169 df-squarenn 40219 |
This theorem is referenced by: rmspecfund 40287 rmxyelqirr 40288 rmxycomplete 40295 rmbaserp 40297 rmxyneg 40298 rmxm1 40312 rmxluc 40314 rmxdbl 40317 ltrmxnn0 40327 jm2.19lem1 40367 jm2.23 40374 rmxdiophlem 40393 |
Copyright terms: Public domain | W3C validator |