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

Theorem 4sqexercise1 12929
Description: Exercise which may help in understanding the proof of 4sqlemsdc 12931. (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 9488 . . . 4 (𝐴 ∈ ℕ0 → -𝐴 ∈ ℤ)
2 nn0z 9474 . . . 4 (𝐴 ∈ ℕ0𝐴 ∈ ℤ)
3 elfzelz 10229 . . . . . . 7 (𝑥 ∈ (-𝐴...𝐴) → 𝑥 ∈ ℤ)
43adantl 277 . . . . . 6 ((𝐴 ∈ ℕ0𝑥 ∈ (-𝐴...𝐴)) → 𝑥 ∈ ℤ)
5 zsqcl 10840 . . . . . 6 (𝑥 ∈ ℤ → (𝑥↑2) ∈ ℤ)
64, 5syl 14 . . . . 5 ((𝐴 ∈ ℕ0𝑥 ∈ (-𝐴...𝐴)) → (𝑥↑2) ∈ ℤ)
7 zdceq 9530 . . . . 5 ((𝐴 ∈ ℤ ∧ (𝑥↑2) ∈ ℤ) → DECID 𝐴 = (𝑥↑2))
82, 6, 7syl2an2r 597 . . . 4 ((𝐴 ∈ ℕ0𝑥 ∈ (-𝐴...𝐴)) → DECID 𝐴 = (𝑥↑2))
91, 2, 8exfzdc 10454 . . 3 (𝐴 ∈ ℕ0DECID𝑥 ∈ (-𝐴...𝐴)𝐴 = (𝑥↑2))
10 simpr 110 . . . . . . . . . . 11 ((𝑥 ∈ ℤ ∧ 𝐴 = (𝑥↑2)) → 𝐴 = (𝑥↑2))
11 zsqcl2 10847 . . . . . . . . . . . 12 (𝑥 ∈ ℤ → (𝑥↑2) ∈ ℕ0)
1211adantr 276 . . . . . . . . . . 11 ((𝑥 ∈ ℤ ∧ 𝐴 = (𝑥↑2)) → (𝑥↑2) ∈ ℕ0)
1310, 12eqeltrd 2306 . . . . . . . . . 10 ((𝑥 ∈ ℤ ∧ 𝐴 = (𝑥↑2)) → 𝐴 ∈ ℕ0)
1413nn0zd 9575 . . . . . . . . 9 ((𝑥 ∈ ℤ ∧ 𝐴 = (𝑥↑2)) → 𝐴 ∈ ℤ)
1514znegcld 9579 . . . . . . . 8 ((𝑥 ∈ ℤ ∧ 𝐴 = (𝑥↑2)) → -𝐴 ∈ ℤ)
16 simpl 109 . . . . . . . 8 ((𝑥 ∈ ℤ ∧ 𝐴 = (𝑥↑2)) → 𝑥 ∈ ℤ)
17 zre 9458 . . . . . . . . . 10 (𝑥 ∈ ℤ → 𝑥 ∈ ℝ)
1817adantr 276 . . . . . . . . 9 ((𝑥 ∈ ℤ ∧ 𝐴 = (𝑥↑2)) → 𝑥 ∈ ℝ)
1913nn0red 9431 . . . . . . . . 9 ((𝑥 ∈ ℤ ∧ 𝐴 = (𝑥↑2)) → 𝐴 ∈ ℝ)
20 znegcl 9485 . . . . . . . . . . . . 13 (𝑥 ∈ ℤ → -𝑥 ∈ ℤ)
21 zzlesq 10938 . . . . . . . . . . . . 13 (-𝑥 ∈ ℤ → -𝑥 ≤ (-𝑥↑2))
2220, 21syl 14 . . . . . . . . . . . 12 (𝑥 ∈ ℤ → -𝑥 ≤ (-𝑥↑2))
2322adantr 276 . . . . . . . . . . 11 ((𝑥 ∈ ℤ ∧ 𝐴 = (𝑥↑2)) → -𝑥 ≤ (-𝑥↑2))
24 zcn 9459 . . . . . . . . . . . . 13 (𝑥 ∈ ℤ → 𝑥 ∈ ℂ)
25 sqneg 10828 . . . . . . . . . . . . 13 (𝑥 ∈ ℂ → (-𝑥↑2) = (𝑥↑2))
2624, 25syl 14 . . . . . . . . . . . 12 (𝑥 ∈ ℤ → (-𝑥↑2) = (𝑥↑2))
2726adantr 276 . . . . . . . . . . 11 ((𝑥 ∈ ℤ ∧ 𝐴 = (𝑥↑2)) → (-𝑥↑2) = (𝑥↑2))
2823, 27breqtrd 4109 . . . . . . . . . 10 ((𝑥 ∈ ℤ ∧ 𝐴 = (𝑥↑2)) → -𝑥 ≤ (𝑥↑2))
2928, 10breqtrrd 4111 . . . . . . . . 9 ((𝑥 ∈ ℤ ∧ 𝐴 = (𝑥↑2)) → -𝑥𝐴)
3018, 19, 29lenegcon1d 8682 . . . . . . . 8 ((𝑥 ∈ ℤ ∧ 𝐴 = (𝑥↑2)) → -𝐴𝑥)
31 zzlesq 10938 . . . . . . . . . 10 (𝑥 ∈ ℤ → 𝑥 ≤ (𝑥↑2))
3231adantr 276 . . . . . . . . 9 ((𝑥 ∈ ℤ ∧ 𝐴 = (𝑥↑2)) → 𝑥 ≤ (𝑥↑2))
3332, 10breqtrrd 4111 . . . . . . . 8 ((𝑥 ∈ ℤ ∧ 𝐴 = (𝑥↑2)) → 𝑥𝐴)
3415, 14, 16, 30, 33elfzd 10220 . . . . . . 7 ((𝑥 ∈ ℤ ∧ 𝐴 = (𝑥↑2)) → 𝑥 ∈ (-𝐴...𝐴))
3534, 10jca 306 . . . . . 6 ((𝑥 ∈ ℤ ∧ 𝐴 = (𝑥↑2)) → (𝑥 ∈ (-𝐴...𝐴) ∧ 𝐴 = (𝑥↑2)))
363anim1i 340 . . . . . 6 ((𝑥 ∈ (-𝐴...𝐴) ∧ 𝐴 = (𝑥↑2)) → (𝑥 ∈ ℤ ∧ 𝐴 = (𝑥↑2)))
3735, 36impbii 126 . . . . 5 ((𝑥 ∈ ℤ ∧ 𝐴 = (𝑥↑2)) ↔ (𝑥 ∈ (-𝐴...𝐴) ∧ 𝐴 = (𝑥↑2)))
3837rexbii2 2541 . . . 4 (∃𝑥 ∈ ℤ 𝐴 = (𝑥↑2) ↔ ∃𝑥 ∈ (-𝐴...𝐴)𝐴 = (𝑥↑2))
3938dcbii 845 . . 3 (DECID𝑥 ∈ ℤ 𝐴 = (𝑥↑2) ↔ DECID𝑥 ∈ (-𝐴...𝐴)𝐴 = (𝑥↑2))
409, 39sylibr 134 . 2 (𝐴 ∈ ℕ0DECID𝑥 ∈ ℤ 𝐴 = (𝑥↑2))
41 eqeq1 2236 . . . . 5 (𝑛 = 𝐴 → (𝑛 = (𝑥↑2) ↔ 𝐴 = (𝑥↑2)))
4241rexbidv 2531 . . . 4 (𝑛 = 𝐴 → (∃𝑥 ∈ ℤ 𝑛 = (𝑥↑2) ↔ ∃𝑥 ∈ ℤ 𝐴 = (𝑥↑2)))
43 4sqexercise1.s . . . 4 𝑆 = {𝑛 ∣ ∃𝑥 ∈ ℤ 𝑛 = (𝑥↑2)}
4442, 43elab2g 2950 . . 3 (𝐴 ∈ ℕ0 → (𝐴𝑆 ↔ ∃𝑥 ∈ ℤ 𝐴 = (𝑥↑2)))
4544dcbid 843 . 2 (𝐴 ∈ ℕ0 → (DECID 𝐴𝑆DECID𝑥 ∈ ℤ 𝐴 = (𝑥↑2)))
4640, 45mpbird 167 1 (𝐴 ∈ ℕ0DECID 𝐴𝑆)
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  DECID wdc 839   = wceq 1395  wcel 2200  {cab 2215  wrex 2509   class class class wbr 4083  (class class class)co 6007  cc 8005  cr 8006  cle 8190  -cneg 8326  2c2 9169  0cn0 9377  cz 9454  ...cfz 10212  cexp 10768
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 617  ax-in2 618  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-13 2202  ax-14 2203  ax-ext 2211  ax-coll 4199  ax-sep 4202  ax-nul 4210  ax-pow 4258  ax-pr 4293  ax-un 4524  ax-setind 4629  ax-iinf 4680  ax-cnex 8098  ax-resscn 8099  ax-1cn 8100  ax-1re 8101  ax-icn 8102  ax-addcl 8103  ax-addrcl 8104  ax-mulcl 8105  ax-mulrcl 8106  ax-addcom 8107  ax-mulcom 8108  ax-addass 8109  ax-mulass 8110  ax-distr 8111  ax-i2m1 8112  ax-0lt1 8113  ax-1rid 8114  ax-0id 8115  ax-rnegex 8116  ax-precex 8117  ax-cnre 8118  ax-pre-ltirr 8119  ax-pre-ltwlin 8120  ax-pre-lttrn 8121  ax-pre-apti 8122  ax-pre-ltadd 8123  ax-pre-mulgt0 8124  ax-pre-mulext 8125
This theorem depends on definitions:  df-bi 117  df-dc 840  df-3or 1003  df-3an 1004  df-tru 1398  df-fal 1401  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ne 2401  df-nel 2496  df-ral 2513  df-rex 2514  df-reu 2515  df-rmo 2516  df-rab 2517  df-v 2801  df-sbc 3029  df-csb 3125  df-dif 3199  df-un 3201  df-in 3203  df-ss 3210  df-nul 3492  df-if 3603  df-pw 3651  df-sn 3672  df-pr 3673  df-op 3675  df-uni 3889  df-int 3924  df-iun 3967  df-br 4084  df-opab 4146  df-mpt 4147  df-tr 4183  df-id 4384  df-po 4387  df-iso 4388  df-iord 4457  df-on 4459  df-ilim 4460  df-suc 4462  df-iom 4683  df-xp 4725  df-rel 4726  df-cnv 4727  df-co 4728  df-dm 4729  df-rn 4730  df-res 4731  df-ima 4732  df-iota 5278  df-fun 5320  df-fn 5321  df-f 5322  df-f1 5323  df-fo 5324  df-f1o 5325  df-fv 5326  df-riota 5960  df-ov 6010  df-oprab 6011  df-mpo 6012  df-1st 6292  df-2nd 6293  df-recs 6457  df-frec 6543  df-pnf 8191  df-mnf 8192  df-xr 8193  df-ltxr 8194  df-le 8195  df-sub 8327  df-neg 8328  df-reap 8730  df-ap 8737  df-div 8828  df-inn 9119  df-2 9177  df-n0 9378  df-z 9455  df-uz 9731  df-fz 10213  df-fzo 10347  df-seqfrec 10678  df-exp 10769
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator