Theorem 4sqexercise1 13207

Description: Exercise which may help in understanding the proof of 4sqlemsdc 13209. (Contributed by Jim Kingdon, 25-May-2025.)

Hypothesis

Ref	Expression
4sqexercise1.s	⊢ 𝑆 = {𝑛 ∣ ∃𝑥 ∈ ℤ 𝑛 = (𝑥↑2)}

Assertion

Ref	Expression
4sqexercise1	⊢ (𝐴 ∈ ℕ0 → DECID 𝐴 ∈ 𝑆)

Distinct variable group:   𝐴,𝑛,𝑥

Allowed substitution hints:   𝑆(𝑥, 𝑛)

Proof of Theorem 4sqexercise1

Step	Hyp	Ref	Expression
1		nn0negz 9690	. . . 4 ⊢ (𝐴 ∈ ℕ0 → -𝐴 ∈ ℤ)
2		nn0z 9676	. . . 4 ⊢ (𝐴 ∈ ℕ0 → 𝐴 ∈ ℤ)
3		elfzelz 10446	. . . . . . 7 ⊢ (𝑥 ∈ ( -𝐴...𝐴) → 𝑥 ∈ ℤ)
4	3	adantl 277	. . . . . 6 ⊢ ((𝐴 ∈ ℕ0 ∧ 𝑥 ∈ ( -𝐴...𝐴)) → 𝑥 ∈ ℤ)
5		zsqcl 11069	. . . . . 6 ⊢ (𝑥 ∈ ℤ → (𝑥↑2) ∈ ℤ)
6	4, 5	syl 14	. . . . 5 ⊢ ((𝐴 ∈ ℕ0 ∧ 𝑥 ∈ ( -𝐴...𝐴)) → (𝑥↑2) ∈ ℤ)
7		zdceq 9732	. . . . 5 ⊢ ((𝐴 ∈ ℤ ∧ (𝑥↑2) ∈ ℤ) → DECID 𝐴 = (𝑥↑2))
8	2, 6, 7	syl2an2r 603	. . . 4 ⊢ ((𝐴 ∈ ℕ0 ∧ 𝑥 ∈ ( -𝐴...𝐴)) → DECID 𝐴 = (𝑥↑2))
9	1, 2, 8	exfzdc 10677	. . 3 ⊢ (𝐴 ∈ ℕ0 → DECID ∃𝑥 ∈ ( -𝐴...𝐴)𝐴 = (𝑥↑2))
10		simpr 110	. . . . . . . . . . 11 ⊢ ((𝑥 ∈ ℤ ∧ 𝐴 = (𝑥↑2)) → 𝐴 = (𝑥↑2))
11		zsqcl2 11076	. . . . . . . . . . . 12 ⊢ (𝑥 ∈ ℤ → (𝑥↑2) ∈ ℕ0)
12	11	adantr 276	. . . . . . . . . . 11 ⊢ ((𝑥 ∈ ℤ ∧ 𝐴 = (𝑥↑2)) → (𝑥↑2) ∈ ℕ0)
13	10, 12	eqeltrd 2315	. . . . . . . . . 10 ⊢ ((𝑥 ∈ ℤ ∧ 𝐴 = (𝑥↑2)) → 𝐴 ∈ ℕ0)
14	13	nn0zd 9778	. . . . . . . . 9 ⊢ ((𝑥 ∈ ℤ ∧ 𝐴 = (𝑥↑2)) → 𝐴 ∈ ℤ)
15	14	znegcld 9782	. . . . . . . 8 ⊢ ((𝑥 ∈ ℤ ∧ 𝐴 = (𝑥↑2)) → -𝐴 ∈ ℤ)
16		simpl 109	. . . . . . . 8 ⊢ ((𝑥 ∈ ℤ ∧ 𝐴 = (𝑥↑2)) → 𝑥 ∈ ℤ)
17		zre 9660	. . . . . . . . . 10 ⊢ (𝑥 ∈ ℤ → 𝑥 ∈ ℝ)
18	17	adantr 276	. . . . . . . . 9 ⊢ ((𝑥 ∈ ℤ ∧ 𝐴 = (𝑥↑2)) → 𝑥 ∈ ℝ)
19	13	nn0red 9633	. . . . . . . . 9 ⊢ ((𝑥 ∈ ℤ ∧ 𝐴 = (𝑥↑2)) → 𝐴 ∈ ℝ)
20		znegcl 9687	. . . . . . . . . . . . 13 ⊢ (𝑥 ∈ ℤ → -𝑥 ∈ ℤ)
21		zzlesq 11168	. . . . . . . . . . . . 13 ⊢ ( -𝑥 ∈ ℤ → -𝑥 ≤ ( -𝑥↑2))
22	20, 21	syl 14	. . . . . . . . . . . 12 ⊢ (𝑥 ∈ ℤ → -𝑥 ≤ ( -𝑥↑2))
23	22	adantr 276	. . . . . . . . . . 11 ⊢ ((𝑥 ∈ ℤ ∧ 𝐴 = (𝑥↑2)) → -𝑥 ≤ ( -𝑥↑2))
24		zcn 9661	. . . . . . . . . . . . 13 ⊢ (𝑥 ∈ ℤ → 𝑥 ∈ ℂ)
25		sqneg 11057	. . . . . . . . . . . . 13 ⊢ (𝑥 ∈ ℂ → ( -𝑥↑2) = (𝑥↑2))
26	24, 25	syl 14	. . . . . . . . . . . 12 ⊢ (𝑥 ∈ ℤ → ( -𝑥↑2) = (𝑥↑2))
27	26	adantr 276	. . . . . . . . . . 11 ⊢ ((𝑥 ∈ ℤ ∧ 𝐴 = (𝑥↑2)) → ( -𝑥↑2) = (𝑥↑2))
28	23, 27	breqtrd 4157	. . . . . . . . . 10 ⊢ ((𝑥 ∈ ℤ ∧ 𝐴 = (𝑥↑2)) → -𝑥 ≤ (𝑥↑2))
29	28, 10	breqtrrd 4159	. . . . . . . . 9 ⊢ ((𝑥 ∈ ℤ ∧ 𝐴 = (𝑥↑2)) → -𝑥 ≤ 𝐴)
30	18, 19, 29	lenegcon1d 8863	. . . . . . . 8 ⊢ ((𝑥 ∈ ℤ ∧ 𝐴 = (𝑥↑2)) → -𝐴 ≤ 𝑥)
31		zzlesq 11168	. . . . . . . . . 10 ⊢ (𝑥 ∈ ℤ → 𝑥 ≤ (𝑥↑2))
32	31	adantr 276	. . . . . . . . 9 ⊢ ((𝑥 ∈ ℤ ∧ 𝐴 = (𝑥↑2)) → 𝑥 ≤ (𝑥↑2))
33	32, 10	breqtrrd 4159	. . . . . . . 8 ⊢ ((𝑥 ∈ ℤ ∧ 𝐴 = (𝑥↑2)) → 𝑥 ≤ 𝐴)
34	15, 14, 16, 30, 33	elfzd 10437	. . . . . . 7 ⊢ ((𝑥 ∈ ℤ ∧ 𝐴 = (𝑥↑2)) → 𝑥 ∈ ( -𝐴...𝐴))
35	34, 10	jca 306	. . . . . 6 ⊢ ((𝑥 ∈ ℤ ∧ 𝐴 = (𝑥↑2)) → (𝑥 ∈ ( -𝐴...𝐴) ∧ 𝐴 = (𝑥↑2)))
36	3	anim1i 340	. . . . . 6 ⊢ ((𝑥 ∈ ( -𝐴...𝐴) ∧ 𝐴 = (𝑥↑2)) → (𝑥 ∈ ℤ ∧ 𝐴 = (𝑥↑2)))
37	35, 36	impbii 126	. . . . 5 ⊢ ((𝑥 ∈ ℤ ∧ 𝐴 = (𝑥↑2)) ↔ (𝑥 ∈ ( -𝐴...𝐴) ∧ 𝐴 = (𝑥↑2)))
38	37	rexbii2 2561	. . . 4 ⊢ (∃𝑥 ∈ ℤ 𝐴 = (𝑥↑2) ↔ ∃𝑥 ∈ ( -𝐴...𝐴)𝐴 = (𝑥↑2))
39	38	dcbii 852	. . 3 ⊢ (DECID ∃𝑥 ∈ ℤ 𝐴 = (𝑥↑2) ↔ DECID ∃𝑥 ∈ ( -𝐴...𝐴)𝐴 = (𝑥↑2))
40	9, 39	sylibr 134	. 2 ⊢ (𝐴 ∈ ℕ0 → DECID ∃𝑥 ∈ ℤ 𝐴 = (𝑥↑2))
41		eqeq1 2245	. . . . 5 ⊢ (𝑛 = 𝐴 → (𝑛 = (𝑥↑2) ↔ 𝐴 = (𝑥↑2)))
42	41	rexbidv 2551	. . . 4 ⊢ (𝑛 = 𝐴 → (∃𝑥 ∈ ℤ 𝑛 = (𝑥↑2) ↔ ∃𝑥 ∈ ℤ 𝐴 = (𝑥↑2)))
43		4sqexercise1.s	. . . 4 ⊢ 𝑆 = {𝑛 ∣ ∃𝑥 ∈ ℤ 𝑛 = (𝑥↑2)}
44	42, 43	elab2g 2973	. . 3 ⊢ (𝐴 ∈ ℕ0 → (𝐴 ∈ 𝑆 ↔ ∃𝑥 ∈ ℤ 𝐴 = (𝑥↑2)))
45	44	dcbid 850	. 2 ⊢ (𝐴 ∈ ℕ0 → (DECID 𝐴 ∈ 𝑆 ↔ DECID ∃𝑥 ∈ ℤ 𝐴 = (𝑥↑2)))
46	40, 45	mpbird 167	1 ⊢ (𝐴 ∈ ℕ0 → DECID 𝐴 ∈ 𝑆)

This proof depends on syntax axioms:   → wi 4   ∧ wa 104  DECID wdc 846   = wceq 1402   ∈ wcel 2209  {cab 2224  ∃wrex 2529   class class class wbr 4131  (class class class)co 6088  ℂcc 8184  ℝcr 8185   ≤ cle 8368   -cneg 8506  2c2 9365  ℕ₀cn0 9575  ℤcz 9656  ...cfz 10429  ↑cexp 10997

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 4248  ax-sep 4251  ax-nul 4261  ax-pow 4313  ax-pr 4348  ax-un 4580  ax-setind 4686  ax-iinf 4737  ax-cnex 8277  ax-resscn 8278  ax-1cn 8279  ax-1re 8280  ax-icn 8281  ax-addcl 8282  ax-addrcl 8283  ax-mulcl 8284  ax-mulrcl 8285  ax-addcom 8286  ax-mulcom 8287  ax-addass 8288  ax-mulass 8289  ax-distr 8290  ax-i2m1 8291  ax-0lt1 8292  ax-1rid 8293  ax-0id 8294  ax-rnegex 8295  ax-precex 8296  ax-cnre 8297  ax-pre-ltirr 8298  ax-pre-ltwlin 8299  ax-pre-lttrn 8300  ax-pre-apti 8301  ax-pre-ltadd 8302  ax-pre-mulgt0 8303  ax-pre-mulext 8304

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 4132  df-opab 4194  df-mpt 4195  df-tr 4232  df-id 4440  df-po 4443  df-iso 4444  df-iord 4513  df-on 4515  df-ilim 4516  df-suc 4518  df-iom 4740  df-xp 4782  df-rel 4783  df-cnv 4784  df-co 4785  df-dm 4786  df-rn 4787  df-res 4788  df-ima 4789  df-iota 5340  df-fun 5382  df-fn 5383  df-f 5384  df-f1 5385  df-fo 5386  df-f1o 5387  df-fv 5388  df-riota 6041  df-ov 6091  df-oprab 6092  df-mpo 6093  df-1st 6378  df-2nd 6379  df-recs 6580  df-frec 6666  df-pnf 8369  df-mnf 8370  df-xr 8371  df-ltxr 8372  df-le 8373  df-sub 8507  df-neg 8508  df-reap 8912  df-ap 8919  df-div 9012  df-inn 9315  df-2 9373  df-n0 9576  df-z 9657  df-uz 9939  df-fz 10430  df-fzo 10568  df-seqfrec 10907  df-exp 10998

This theorem is used by: (None)