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

Theorem 4sqexercise1 13177
Description: Exercise which may help in understanding the proof of 4sqlemsdc 13179. (Contributed by Jim Kingdon, 25-May-2025.)
Hypothesis
Ref Expression
4sqexercise1.s  |-  S  =  { n  |  E. x  e.  ZZ  n  =  ( x ^
2 ) }
Assertion
Ref Expression
4sqexercise1  |-  ( A  e.  NN0  -> DECID  A  e.  S
)
Distinct variable group:    A, n, x
Allowed substitution hints:    S( x,  n)

Proof of Theorem 4sqexercise1
StepHypRef Expression
1 nn0negz 9678 . . . 4  |-  ( A  e.  NN0  ->  -u A  e.  ZZ )
2 nn0z 9664 . . . 4  |-  ( A  e.  NN0  ->  A  e.  ZZ )
3 elfzelz 10428 . . . . . . 7  |-  ( x  e.  ( -u A ... A )  ->  x  e.  ZZ )
43adantl 277 . . . . . 6  |-  ( ( A  e.  NN0  /\  x  e.  ( -u A ... A ) )  ->  x  e.  ZZ )
5 zsqcl 11047 . . . . . 6  |-  ( x  e.  ZZ  ->  (
x ^ 2 )  e.  ZZ )
64, 5syl 14 . . . . 5  |-  ( ( A  e.  NN0  /\  x  e.  ( -u A ... A ) )  -> 
( x ^ 2 )  e.  ZZ )
7 zdceq 9720 . . . . 5  |-  ( ( A  e.  ZZ  /\  ( x ^ 2 )  e.  ZZ )  -> DECID 
A  =  ( x ^ 2 ) )
82, 6, 7syl2an2r 603 . . . 4  |-  ( ( A  e.  NN0  /\  x  e.  ( -u A ... A ) )  -> DECID  A  =  ( x ^
2 ) )
91, 2, 8exfzdc 10659 . . 3  |-  ( A  e.  NN0  -> DECID  E. x  e.  (
-u A ... A
) A  =  ( x ^ 2 ) )
10 simpr 110 . . . . . . . . . . 11  |-  ( ( x  e.  ZZ  /\  A  =  ( x ^ 2 ) )  ->  A  =  ( x ^ 2 ) )
11 zsqcl2 11054 . . . . . . . . . . . 12  |-  ( x  e.  ZZ  ->  (
x ^ 2 )  e.  NN0 )
1211adantr 276 . . . . . . . . . . 11  |-  ( ( x  e.  ZZ  /\  A  =  ( x ^ 2 ) )  ->  ( x ^
2 )  e.  NN0 )
1310, 12eqeltrd 2315 . . . . . . . . . 10  |-  ( ( x  e.  ZZ  /\  A  =  ( x ^ 2 ) )  ->  A  e.  NN0 )
1413nn0zd 9766 . . . . . . . . 9  |-  ( ( x  e.  ZZ  /\  A  =  ( x ^ 2 ) )  ->  A  e.  ZZ )
1514znegcld 9770 . . . . . . . 8  |-  ( ( x  e.  ZZ  /\  A  =  ( x ^ 2 ) )  ->  -u A  e.  ZZ )
16 simpl 109 . . . . . . . 8  |-  ( ( x  e.  ZZ  /\  A  =  ( x ^ 2 ) )  ->  x  e.  ZZ )
17 zre 9648 . . . . . . . . . 10  |-  ( x  e.  ZZ  ->  x  e.  RR )
1817adantr 276 . . . . . . . . 9  |-  ( ( x  e.  ZZ  /\  A  =  ( x ^ 2 ) )  ->  x  e.  RR )
1913nn0red 9621 . . . . . . . . 9  |-  ( ( x  e.  ZZ  /\  A  =  ( x ^ 2 ) )  ->  A  e.  RR )
20 znegcl 9675 . . . . . . . . . . . . 13  |-  ( x  e.  ZZ  ->  -u x  e.  ZZ )
21 zzlesq 11146 . . . . . . . . . . . . 13  |-  ( -u x  e.  ZZ  ->  -u x  <_  ( -u x ^ 2 ) )
2220, 21syl 14 . . . . . . . . . . . 12  |-  ( x  e.  ZZ  ->  -u x  <_  ( -u x ^
2 ) )
2322adantr 276 . . . . . . . . . . 11  |-  ( ( x  e.  ZZ  /\  A  =  ( x ^ 2 ) )  ->  -u x  <_  ( -u x ^ 2 ) )
24 zcn 9649 . . . . . . . . . . . . 13  |-  ( x  e.  ZZ  ->  x  e.  CC )
25 sqneg 11035 . . . . . . . . . . . . 13  |-  ( x  e.  CC  ->  ( -u x ^ 2 )  =  ( x ^
2 ) )
2624, 25syl 14 . . . . . . . . . . . 12  |-  ( x  e.  ZZ  ->  ( -u x ^ 2 )  =  ( x ^
2 ) )
2726adantr 276 . . . . . . . . . . 11  |-  ( ( x  e.  ZZ  /\  A  =  ( x ^ 2 ) )  ->  ( -u x ^ 2 )  =  ( x ^ 2 ) )
2823, 27breqtrd 4156 . . . . . . . . . 10  |-  ( ( x  e.  ZZ  /\  A  =  ( x ^ 2 ) )  ->  -u x  <_  (
x ^ 2 ) )
2928, 10breqtrrd 4158 . . . . . . . . 9  |-  ( ( x  e.  ZZ  /\  A  =  ( x ^ 2 ) )  ->  -u x  <_  A
)
3018, 19, 29lenegcon1d 8855 . . . . . . . 8  |-  ( ( x  e.  ZZ  /\  A  =  ( x ^ 2 ) )  ->  -u A  <_  x
)
31 zzlesq 11146 . . . . . . . . . 10  |-  ( x  e.  ZZ  ->  x  <_  ( x ^ 2 ) )
3231adantr 276 . . . . . . . . 9  |-  ( ( x  e.  ZZ  /\  A  =  ( x ^ 2 ) )  ->  x  <_  (
x ^ 2 ) )
3332, 10breqtrrd 4158 . . . . . . . 8  |-  ( ( x  e.  ZZ  /\  A  =  ( x ^ 2 ) )  ->  x  <_  A
)
3415, 14, 16, 30, 33elfzd 10419 . . . . . . 7  |-  ( ( x  e.  ZZ  /\  A  =  ( x ^ 2 ) )  ->  x  e.  (
-u A ... A
) )
3534, 10jca 306 . . . . . 6  |-  ( ( x  e.  ZZ  /\  A  =  ( x ^ 2 ) )  ->  ( x  e.  ( -u A ... A )  /\  A  =  ( x ^
2 ) ) )
363anim1i 340 . . . . . 6  |-  ( ( x  e.  ( -u A ... A )  /\  A  =  ( x ^ 2 ) )  ->  ( x  e.  ZZ  /\  A  =  ( x ^ 2 ) ) )
3735, 36impbii 126 . . . . 5  |-  ( ( x  e.  ZZ  /\  A  =  ( x ^ 2 ) )  <-> 
( x  e.  (
-u A ... A
)  /\  A  =  ( x ^ 2 ) ) )
3837rexbii2 2561 . . . 4  |-  ( E. x  e.  ZZ  A  =  ( x ^
2 )  <->  E. x  e.  ( -u A ... A ) A  =  ( x ^ 2 ) )
3938dcbii 852 . . 3  |-  (DECID  E. x  e.  ZZ  A  =  ( x ^ 2 )  <-> DECID  E. x  e.  ( -u A ... A ) A  =  ( x ^ 2 ) )
409, 39sylibr 134 . 2  |-  ( A  e.  NN0  -> DECID  E. x  e.  ZZ  A  =  ( x ^ 2 ) )
41 eqeq1 2245 . . . . 5  |-  ( n  =  A  ->  (
n  =  ( x ^ 2 )  <->  A  =  ( x ^ 2 ) ) )
4241rexbidv 2551 . . . 4  |-  ( n  =  A  ->  ( E. x  e.  ZZ  n  =  ( x ^ 2 )  <->  E. x  e.  ZZ  A  =  ( x ^ 2 ) ) )
43 4sqexercise1.s . . . 4  |-  S  =  { n  |  E. x  e.  ZZ  n  =  ( x ^
2 ) }
4442, 43elab2g 2973 . . 3  |-  ( A  e.  NN0  ->  ( A  e.  S  <->  E. x  e.  ZZ  A  =  ( x ^ 2 ) ) )
4544dcbid 850 . 2  |-  ( A  e.  NN0  ->  (DECID  A  e.  S  <-> DECID  E. x  e.  ZZ  A  =  ( x ^ 2 ) ) )
4640, 45mpbird 167 1  |-  ( A  e.  NN0  -> DECID  A  e.  S
)
Colors of variables:    wff set class
This proof depends on syntax axioms:    -> wi 4    /\ wa 104  DECID wdc 846    = wceq 1402    e. wcel 2209   {cab 2224   E.wrex 2529   class class class wbr 4130  (class class class)co 6085   CCcc 8177   RRcr 8178    <_ cle 8361   -ucneg 8498   2c2 9355   NN0cn0 9563   ZZcz 9644   ...cfz 10411   ^cexp 10975
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-coll 4246  ax-sep 4249  ax-nul 4259  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-setind 4684  ax-iinf 4735  ax-cnex 8270  ax-resscn 8271  ax-1cn 8272  ax-1re 8273  ax-icn 8274  ax-addcl 8275  ax-addrcl 8276  ax-mulcl 8277  ax-mulrcl 8278  ax-addcom 8279  ax-mulcom 8280  ax-addass 8281  ax-mulass 8282  ax-distr 8283  ax-i2m1 8284  ax-0lt1 8285  ax-1rid 8286  ax-0id 8287  ax-rnegex 8288  ax-precex 8289  ax-cnre 8290  ax-pre-ltirr 8291  ax-pre-ltwlin 8292  ax-pre-lttrn 8293  ax-pre-apti 8294  ax-pre-ltadd 8295  ax-pre-mulgt0 8296  ax-pre-mulext 8297
This proof depends on definitions:  df-bi 117  df-dc 847  df-3or 1010  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-nel 2516  df-ral 2533  df-rex 2534  df-reu 2535  df-rmo 2536  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-if 3639  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-iun 4014  df-br 4131  df-opab 4193  df-mpt 4194  df-tr 4230  df-id 4438  df-po 4441  df-iso 4442  df-iord 4511  df-on 4513  df-ilim 4514  df-suc 4516  df-iom 4738  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-ima 4787  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-f1 5382  df-fo 5383  df-f1o 5384  df-fv 5385  df-riota 6038  df-ov 6088  df-oprab 6089  df-mpo 6090  df-1st 6374  df-2nd 6375  df-recs 6576  df-frec 6662  df-pnf 8362  df-mnf 8363  df-xr 8364  df-ltxr 8365  df-le 8366  df-sub 8499  df-neg 8500  df-reap 8903  df-ap 8910  df-div 9003  df-inn 9305  df-2 9363  df-n0 9564  df-z 9645  df-uz 9922  df-fz 10412  df-fzo 10550  df-seqfrec 10885  df-exp 10976
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator