ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  4sqexercise1 GIF version

Theorem 4sqexercise1 12973
Description: Exercise which may help in understanding the proof of 4sqlemsdc 12975. (Contributed by Jim Kingdon, 25-May-2025.)
Hypothesis
Ref Expression
4sqexercise1.s 𝑆 = {𝑛 ∣ ∃𝑥 ∈ ℤ 𝑛 = (𝑥↑2)}
Assertion
Ref Expression
4sqexercise1 (𝐴 ∈ ℕ0DECID 𝐴𝑆)
Distinct variable group:   𝐴,𝑛,𝑥
Allowed substitution hints:   𝑆(𝑥,𝑛)

Proof of Theorem 4sqexercise1
StepHypRef Expression
1 nn0negz 9513 . . . 4 (𝐴 ∈ ℕ0 → -𝐴 ∈ ℤ)
2 nn0z 9499 . . . 4 (𝐴 ∈ ℕ0𝐴 ∈ ℤ)
3 elfzelz 10260 . . . . . . 7 (𝑥 ∈ (-𝐴...𝐴) → 𝑥 ∈ ℤ)
43adantl 277 . . . . . 6 ((𝐴 ∈ ℕ0𝑥 ∈ (-𝐴...𝐴)) → 𝑥 ∈ ℤ)
5 zsqcl 10873 . . . . . 6 (𝑥 ∈ ℤ → (𝑥↑2) ∈ ℤ)
64, 5syl 14 . . . . 5 ((𝐴 ∈ ℕ0𝑥 ∈ (-𝐴...𝐴)) → (𝑥↑2) ∈ ℤ)
7 zdceq 9555 . . . . 5 ((𝐴 ∈ ℤ ∧ (𝑥↑2) ∈ ℤ) → DECID 𝐴 = (𝑥↑2))
82, 6, 7syl2an2r 599 . . . 4 ((𝐴 ∈ ℕ0𝑥 ∈ (-𝐴...𝐴)) → DECID 𝐴 = (𝑥↑2))
91, 2, 8exfzdc 10487 . . 3 (𝐴 ∈ ℕ0DECID𝑥 ∈ (-𝐴...𝐴)𝐴 = (𝑥↑2))
10 simpr 110 . . . . . . . . . . 11 ((𝑥 ∈ ℤ ∧ 𝐴 = (𝑥↑2)) → 𝐴 = (𝑥↑2))
11 zsqcl2 10880 . . . . . . . . . . . 12 (𝑥 ∈ ℤ → (𝑥↑2) ∈ ℕ0)
1211adantr 276 . . . . . . . . . . 11 ((𝑥 ∈ ℤ ∧ 𝐴 = (𝑥↑2)) → (𝑥↑2) ∈ ℕ0)
1310, 12eqeltrd 2308 . . . . . . . . . 10 ((𝑥 ∈ ℤ ∧ 𝐴 = (𝑥↑2)) → 𝐴 ∈ ℕ0)
1413nn0zd 9600 . . . . . . . . 9 ((𝑥 ∈ ℤ ∧ 𝐴 = (𝑥↑2)) → 𝐴 ∈ ℤ)
1514znegcld 9604 . . . . . . . 8 ((𝑥 ∈ ℤ ∧ 𝐴 = (𝑥↑2)) → -𝐴 ∈ ℤ)
16 simpl 109 . . . . . . . 8 ((𝑥 ∈ ℤ ∧ 𝐴 = (𝑥↑2)) → 𝑥 ∈ ℤ)
17 zre 9483 . . . . . . . . . 10 (𝑥 ∈ ℤ → 𝑥 ∈ ℝ)
1817adantr 276 . . . . . . . . 9 ((𝑥 ∈ ℤ ∧ 𝐴 = (𝑥↑2)) → 𝑥 ∈ ℝ)
1913nn0red 9456 . . . . . . . . 9 ((𝑥 ∈ ℤ ∧ 𝐴 = (𝑥↑2)) → 𝐴 ∈ ℝ)
20 znegcl 9510 . . . . . . . . . . . . 13 (𝑥 ∈ ℤ → -𝑥 ∈ ℤ)
21 zzlesq 10971 . . . . . . . . . . . . 13 (-𝑥 ∈ ℤ → -𝑥 ≤ (-𝑥↑2))
2220, 21syl 14 . . . . . . . . . . . 12 (𝑥 ∈ ℤ → -𝑥 ≤ (-𝑥↑2))
2322adantr 276 . . . . . . . . . . 11 ((𝑥 ∈ ℤ ∧ 𝐴 = (𝑥↑2)) → -𝑥 ≤ (-𝑥↑2))
24 zcn 9484 . . . . . . . . . . . . 13 (𝑥 ∈ ℤ → 𝑥 ∈ ℂ)
25 sqneg 10861 . . . . . . . . . . . . 13 (𝑥 ∈ ℂ → (-𝑥↑2) = (𝑥↑2))
2624, 25syl 14 . . . . . . . . . . . 12 (𝑥 ∈ ℤ → (-𝑥↑2) = (𝑥↑2))
2726adantr 276 . . . . . . . . . . 11 ((𝑥 ∈ ℤ ∧ 𝐴 = (𝑥↑2)) → (-𝑥↑2) = (𝑥↑2))
2823, 27breqtrd 4114 . . . . . . . . . 10 ((𝑥 ∈ ℤ ∧ 𝐴 = (𝑥↑2)) → -𝑥 ≤ (𝑥↑2))
2928, 10breqtrrd 4116 . . . . . . . . 9 ((𝑥 ∈ ℤ ∧ 𝐴 = (𝑥↑2)) → -𝑥𝐴)
3018, 19, 29lenegcon1d 8707 . . . . . . . 8 ((𝑥 ∈ ℤ ∧ 𝐴 = (𝑥↑2)) → -𝐴𝑥)
31 zzlesq 10971 . . . . . . . . . 10 (𝑥 ∈ ℤ → 𝑥 ≤ (𝑥↑2))
3231adantr 276 . . . . . . . . 9 ((𝑥 ∈ ℤ ∧ 𝐴 = (𝑥↑2)) → 𝑥 ≤ (𝑥↑2))
3332, 10breqtrrd 4116 . . . . . . . 8 ((𝑥 ∈ ℤ ∧ 𝐴 = (𝑥↑2)) → 𝑥𝐴)
3415, 14, 16, 30, 33elfzd 10251 . . . . . . 7 ((𝑥 ∈ ℤ ∧ 𝐴 = (𝑥↑2)) → 𝑥 ∈ (-𝐴...𝐴))
3534, 10jca 306 . . . . . 6 ((𝑥 ∈ ℤ ∧ 𝐴 = (𝑥↑2)) → (𝑥 ∈ (-𝐴...𝐴) ∧ 𝐴 = (𝑥↑2)))
363anim1i 340 . . . . . 6 ((𝑥 ∈ (-𝐴...𝐴) ∧ 𝐴 = (𝑥↑2)) → (𝑥 ∈ ℤ ∧ 𝐴 = (𝑥↑2)))
3735, 36impbii 126 . . . . 5 ((𝑥 ∈ ℤ ∧ 𝐴 = (𝑥↑2)) ↔ (𝑥 ∈ (-𝐴...𝐴) ∧ 𝐴 = (𝑥↑2)))
3837rexbii2 2543 . . . 4 (∃𝑥 ∈ ℤ 𝐴 = (𝑥↑2) ↔ ∃𝑥 ∈ (-𝐴...𝐴)𝐴 = (𝑥↑2))
3938dcbii 847 . . 3 (DECID𝑥 ∈ ℤ 𝐴 = (𝑥↑2) ↔ DECID𝑥 ∈ (-𝐴...𝐴)𝐴 = (𝑥↑2))
409, 39sylibr 134 . 2 (𝐴 ∈ ℕ0DECID𝑥 ∈ ℤ 𝐴 = (𝑥↑2))
41 eqeq1 2238 . . . . 5 (𝑛 = 𝐴 → (𝑛 = (𝑥↑2) ↔ 𝐴 = (𝑥↑2)))
4241rexbidv 2533 . . . 4 (𝑛 = 𝐴 → (∃𝑥 ∈ ℤ 𝑛 = (𝑥↑2) ↔ ∃𝑥 ∈ ℤ 𝐴 = (𝑥↑2)))
43 4sqexercise1.s . . . 4 𝑆 = {𝑛 ∣ ∃𝑥 ∈ ℤ 𝑛 = (𝑥↑2)}
4442, 43elab2g 2953 . . 3 (𝐴 ∈ ℕ0 → (𝐴𝑆 ↔ ∃𝑥 ∈ ℤ 𝐴 = (𝑥↑2)))
4544dcbid 845 . 2 (𝐴 ∈ ℕ0 → (DECID 𝐴𝑆DECID𝑥 ∈ ℤ 𝐴 = (𝑥↑2)))
4640, 45mpbird 167 1 (𝐴 ∈ ℕ0DECID 𝐴𝑆)
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  DECID wdc 841   = wceq 1397  wcel 2202  {cab 2217  wrex 2511   class class class wbr 4088  (class class class)co 6018  cc 8030  cr 8031  cle 8215  -cneg 8351  2c2 9194  0cn0 9402  cz 9479  ...cfz 10243  cexp 10801
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 619  ax-in2 620  ax-io 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-13 2204  ax-14 2205  ax-ext 2213  ax-coll 4204  ax-sep 4207  ax-nul 4215  ax-pow 4264  ax-pr 4299  ax-un 4530  ax-setind 4635  ax-iinf 4686  ax-cnex 8123  ax-resscn 8124  ax-1cn 8125  ax-1re 8126  ax-icn 8127  ax-addcl 8128  ax-addrcl 8129  ax-mulcl 8130  ax-mulrcl 8131  ax-addcom 8132  ax-mulcom 8133  ax-addass 8134  ax-mulass 8135  ax-distr 8136  ax-i2m1 8137  ax-0lt1 8138  ax-1rid 8139  ax-0id 8140  ax-rnegex 8141  ax-precex 8142  ax-cnre 8143  ax-pre-ltirr 8144  ax-pre-ltwlin 8145  ax-pre-lttrn 8146  ax-pre-apti 8147  ax-pre-ltadd 8148  ax-pre-mulgt0 8149  ax-pre-mulext 8150
This theorem depends on definitions:  df-bi 117  df-dc 842  df-3or 1005  df-3an 1006  df-tru 1400  df-fal 1403  df-nf 1509  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ne 2403  df-nel 2498  df-ral 2515  df-rex 2516  df-reu 2517  df-rmo 2518  df-rab 2519  df-v 2804  df-sbc 3032  df-csb 3128  df-dif 3202  df-un 3204  df-in 3206  df-ss 3213  df-nul 3495  df-if 3606  df-pw 3654  df-sn 3675  df-pr 3676  df-op 3678  df-uni 3894  df-int 3929  df-iun 3972  df-br 4089  df-opab 4151  df-mpt 4152  df-tr 4188  df-id 4390  df-po 4393  df-iso 4394  df-iord 4463  df-on 4465  df-ilim 4466  df-suc 4468  df-iom 4689  df-xp 4731  df-rel 4732  df-cnv 4733  df-co 4734  df-dm 4735  df-rn 4736  df-res 4737  df-ima 4738  df-iota 5286  df-fun 5328  df-fn 5329  df-f 5330  df-f1 5331  df-fo 5332  df-f1o 5333  df-fv 5334  df-riota 5971  df-ov 6021  df-oprab 6022  df-mpo 6023  df-1st 6303  df-2nd 6304  df-recs 6471  df-frec 6557  df-pnf 8216  df-mnf 8217  df-xr 8218  df-ltxr 8219  df-le 8220  df-sub 8352  df-neg 8353  df-reap 8755  df-ap 8762  df-div 8853  df-inn 9144  df-2 9202  df-n0 9403  df-z 9480  df-uz 9756  df-fz 10244  df-fzo 10378  df-seqfrec 10711  df-exp 10802
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator