Theorem dceqnconst 15620

Description: Decidability of real number equality implies the existence of a certain non-constant function from real numbers to integers. Variation of Exercise 11.6(i) of [HoTT], p. (varies). See redcwlpo 15615 for more discussion of decidability of real number equality. (Contributed by BJ and Jim Kingdon, 24-Jun-2024.) (Revised by Jim Kingdon, 23-Jul-2024.)

Assertion

Ref	Expression
dceqnconst	⊢ (∀𝑥 ∈ ℝ DECID 𝑥 = 0 → ∃𝑓(𝑓:ℝ⟶ℤ ∧ (𝑓‘0) = 0 ∧ ∀𝑥 ∈ ℝ+ (𝑓‘𝑥) ≠ 0))

Distinct variable group:   𝑥,𝑓

Proof of Theorem dceqnconst

Dummy variables 𝑦 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		reex 8008	. . . 4 ⊢ ℝ ∈ V
2	1	mptex 5785	. . 3 ⊢ (𝑦 ∈ ℝ ↦ if(𝑦 = 0, 0, 1)) ∈ V
3	2	a1i 9	. 2 ⊢ (∀𝑥 ∈ ℝ DECID 𝑥 = 0 → (𝑦 ∈ ℝ ↦ if(𝑦 = 0, 0, 1)) ∈ V)
4		0zd 9332	. . . . 5 ⊢ ((∀𝑥 ∈ ℝ DECID 𝑥 = 0 ∧ 𝑦 ∈ ℝ) → 0 ∈ ℤ)
5		1zzd 9347	. . . . 5 ⊢ ((∀𝑥 ∈ ℝ DECID 𝑥 = 0 ∧ 𝑦 ∈ ℝ) → 1 ∈ ℤ)
6		eqeq1 2200	. . . . . . 7 ⊢ (𝑥 = 𝑦 → (𝑥 = 0 ↔ 𝑦 = 0))
7	6	dcbid 839	. . . . . 6 ⊢ (𝑥 = 𝑦 → (DECID 𝑥 = 0 ↔ DECID 𝑦 = 0))
8	7	rspccva 2864	. . . . 5 ⊢ ((∀𝑥 ∈ ℝ DECID 𝑥 = 0 ∧ 𝑦 ∈ ℝ) → DECID 𝑦 = 0)
9	4, 5, 8	ifcldcd 3594	. . . 4 ⊢ ((∀𝑥 ∈ ℝ DECID 𝑥 = 0 ∧ 𝑦 ∈ ℝ) → if(𝑦 = 0, 0, 1) ∈ ℤ)
10	9	fmpttd 5714	. . 3 ⊢ (∀𝑥 ∈ ℝ DECID 𝑥 = 0 → (𝑦 ∈ ℝ ↦ if(𝑦 = 0, 0, 1)):ℝ⟶ℤ)
11		0re 8021	. . . . . 6 ⊢ 0 ∈ ℝ
12		0zd 9332	. . . . . . . 8 ⊢ (⊤ → 0 ∈ ℤ)
13		1zzd 9347	. . . . . . . 8 ⊢ (⊤ → 1 ∈ ℤ)
14		eqid 2193	. . . . . . . . . . 11 ⊢ 0 = 0
15	14	orci 732	. . . . . . . . . 10 ⊢ (0 = 0 ∨ ¬ 0 = 0)
16		df-dc 836	. . . . . . . . . 10 ⊢ (DECID 0 = 0 ↔ (0 = 0 ∨ ¬ 0 = 0))
17	15, 16	mpbir 146	. . . . . . . . 9 ⊢ DECID 0 = 0
18	17	a1i 9	. . . . . . . 8 ⊢ (⊤ → DECID 0 = 0)
19	12, 13, 18	ifcldcd 3594	. . . . . . 7 ⊢ (⊤ → if(0 = 0, 0, 1) ∈ ℤ)
20	19	mptru 1373	. . . . . 6 ⊢ if(0 = 0, 0, 1) ∈ ℤ
21		eqeq1 2200	. . . . . . . 8 ⊢ (𝑦 = 0 → (𝑦 = 0 ↔ 0 = 0))
22	21	ifbid 3579	. . . . . . 7 ⊢ (𝑦 = 0 → if(𝑦 = 0, 0, 1) = if(0 = 0, 0, 1))
23		eqid 2193	. . . . . . 7 ⊢ (𝑦 ∈ ℝ ↦ if(𝑦 = 0, 0, 1)) = (𝑦 ∈ ℝ ↦ if(𝑦 = 0, 0, 1))
24	22, 23	fvmptg 5634	. . . . . 6 ⊢ ((0 ∈ ℝ ∧ if(0 = 0, 0, 1) ∈ ℤ) → ((𝑦 ∈ ℝ ↦ if(𝑦 = 0, 0, 1))‘0) = if(0 = 0, 0, 1))
25	11, 20, 24	mp2an 426	. . . . 5 ⊢ ((𝑦 ∈ ℝ ↦ if(𝑦 = 0, 0, 1))‘0) = if(0 = 0, 0, 1)
26	14	iftruei 3564	. . . . 5 ⊢ if(0 = 0, 0, 1) = 0
27	25, 26	eqtri 2214	. . . 4 ⊢ ((𝑦 ∈ ℝ ↦ if(𝑦 = 0, 0, 1))‘0) = 0
28	27	a1i 9	. . 3 ⊢ (∀𝑥 ∈ ℝ DECID 𝑥 = 0 → ((𝑦 ∈ ℝ ↦ if(𝑦 = 0, 0, 1))‘0) = 0)
29		1ne0 9052	. . . . . 6 ⊢ 1 ≠ 0
30		eqeq1 2200	. . . . . . . . . 10 ⊢ (𝑦 = 𝑧 → (𝑦 = 0 ↔ 𝑧 = 0))
31	30	ifbid 3579	. . . . . . . . 9 ⊢ (𝑦 = 𝑧 → if(𝑦 = 0, 0, 1) = if(𝑧 = 0, 0, 1))
32		rpre 9729	. . . . . . . . . 10 ⊢ (𝑧 ∈ ℝ+ → 𝑧 ∈ ℝ)
33	32	adantl 277	. . . . . . . . 9 ⊢ ((∀𝑥 ∈ ℝ DECID 𝑥 = 0 ∧ 𝑧 ∈ ℝ+) → 𝑧 ∈ ℝ)
34		0zd 9332	. . . . . . . . . 10 ⊢ ((∀𝑥 ∈ ℝ DECID 𝑥 = 0 ∧ 𝑧 ∈ ℝ+) → 0 ∈ ℤ)
35		1zzd 9347	. . . . . . . . . 10 ⊢ ((∀𝑥 ∈ ℝ DECID 𝑥 = 0 ∧ 𝑧 ∈ ℝ+) → 1 ∈ ℤ)
36		eqeq1 2200	. . . . . . . . . . . 12 ⊢ (𝑥 = 𝑧 → (𝑥 = 0 ↔ 𝑧 = 0))
37	36	dcbid 839	. . . . . . . . . . 11 ⊢ (𝑥 = 𝑧 → (DECID 𝑥 = 0 ↔ DECID 𝑧 = 0))
38		simpl 109	. . . . . . . . . . 11 ⊢ ((∀𝑥 ∈ ℝ DECID 𝑥 = 0 ∧ 𝑧 ∈ ℝ+) → ∀𝑥 ∈ ℝ DECID 𝑥 = 0)
39	37, 38, 33	rspcdva 2870	. . . . . . . . . 10 ⊢ ((∀𝑥 ∈ ℝ DECID 𝑥 = 0 ∧ 𝑧 ∈ ℝ+) → DECID 𝑧 = 0)
40	34, 35, 39	ifcldcd 3594	. . . . . . . . 9 ⊢ ((∀𝑥 ∈ ℝ DECID 𝑥 = 0 ∧ 𝑧 ∈ ℝ+) → if(𝑧 = 0, 0, 1) ∈ ℤ)
41	23, 31, 33, 40	fvmptd3 5652	. . . . . . . 8 ⊢ ((∀𝑥 ∈ ℝ DECID 𝑥 = 0 ∧ 𝑧 ∈ ℝ+) → ((𝑦 ∈ ℝ ↦ if(𝑦 = 0, 0, 1))‘𝑧) = if(𝑧 = 0, 0, 1))
42		rpne0 9738	. . . . . . . . . . 11 ⊢ (𝑧 ∈ ℝ+ → 𝑧 ≠ 0)
43	42	neneqd 2385	. . . . . . . . . 10 ⊢ (𝑧 ∈ ℝ+ → ¬ 𝑧 = 0)
44	43	iffalsed 3568	. . . . . . . . 9 ⊢ (𝑧 ∈ ℝ+ → if(𝑧 = 0, 0, 1) = 1)
45	44	adantl 277	. . . . . . . 8 ⊢ ((∀𝑥 ∈ ℝ DECID 𝑥 = 0 ∧ 𝑧 ∈ ℝ+) → if(𝑧 = 0, 0, 1) = 1)
46	41, 45	eqtrd 2226	. . . . . . 7 ⊢ ((∀𝑥 ∈ ℝ DECID 𝑥 = 0 ∧ 𝑧 ∈ ℝ+) → ((𝑦 ∈ ℝ ↦ if(𝑦 = 0, 0, 1))‘𝑧) = 1)
47	46	neeq1d 2382	. . . . . 6 ⊢ ((∀𝑥 ∈ ℝ DECID 𝑥 = 0 ∧ 𝑧 ∈ ℝ+) → (((𝑦 ∈ ℝ ↦ if(𝑦 = 0, 0, 1))‘𝑧) ≠ 0 ↔ 1 ≠ 0))
48	29, 47	mpbiri 168	. . . . 5 ⊢ ((∀𝑥 ∈ ℝ DECID 𝑥 = 0 ∧ 𝑧 ∈ ℝ+) → ((𝑦 ∈ ℝ ↦ if(𝑦 = 0, 0, 1))‘𝑧) ≠ 0)
49	48	ralrimiva 2567	. . . 4 ⊢ (∀𝑥 ∈ ℝ DECID 𝑥 = 0 → ∀𝑧 ∈ ℝ+ ((𝑦 ∈ ℝ ↦ if(𝑦 = 0, 0, 1))‘𝑧) ≠ 0)
50		fveq2 5555	. . . . . 6 ⊢ (𝑧 = 𝑥 → ((𝑦 ∈ ℝ ↦ if(𝑦 = 0, 0, 1))‘𝑧) = ((𝑦 ∈ ℝ ↦ if(𝑦 = 0, 0, 1))‘𝑥))
51	50	neeq1d 2382	. . . . 5 ⊢ (𝑧 = 𝑥 → (((𝑦 ∈ ℝ ↦ if(𝑦 = 0, 0, 1))‘𝑧) ≠ 0 ↔ ((𝑦 ∈ ℝ ↦ if(𝑦 = 0, 0, 1))‘𝑥) ≠ 0))
52	51	cbvralv 2726	. . . 4 ⊢ (∀𝑧 ∈ ℝ+ ((𝑦 ∈ ℝ ↦ if(𝑦 = 0, 0, 1))‘𝑧) ≠ 0 ↔ ∀𝑥 ∈ ℝ+ ((𝑦 ∈ ℝ ↦ if(𝑦 = 0, 0, 1))‘𝑥) ≠ 0)
53	49, 52	sylib 122	. . 3 ⊢ (∀𝑥 ∈ ℝ DECID 𝑥 = 0 → ∀𝑥 ∈ ℝ+ ((𝑦 ∈ ℝ ↦ if(𝑦 = 0, 0, 1))‘𝑥) ≠ 0)
54	10, 28, 53	3jca 1179	. 2 ⊢ (∀𝑥 ∈ ℝ DECID 𝑥 = 0 → ((𝑦 ∈ ℝ ↦ if(𝑦 = 0, 0, 1)):ℝ⟶ℤ ∧ ((𝑦 ∈ ℝ ↦ if(𝑦 = 0, 0, 1))‘0) = 0 ∧ ∀𝑥 ∈ ℝ+ ((𝑦 ∈ ℝ ↦ if(𝑦 = 0, 0, 1))‘𝑥) ≠ 0))
55		feq1 5387	. . 3 ⊢ (𝑓 = (𝑦 ∈ ℝ ↦ if(𝑦 = 0, 0, 1)) → (𝑓:ℝ⟶ℤ ↔ (𝑦 ∈ ℝ ↦ if(𝑦 = 0, 0, 1)):ℝ⟶ℤ))
56		fveq1 5554	. . . 4 ⊢ (𝑓 = (𝑦 ∈ ℝ ↦ if(𝑦 = 0, 0, 1)) → (𝑓‘0) = ((𝑦 ∈ ℝ ↦ if(𝑦 = 0, 0, 1))‘0))
57	56	eqeq1d 2202	. . 3 ⊢ (𝑓 = (𝑦 ∈ ℝ ↦ if(𝑦 = 0, 0, 1)) → ((𝑓‘0) = 0 ↔ ((𝑦 ∈ ℝ ↦ if(𝑦 = 0, 0, 1))‘0) = 0))
58		fveq1 5554	. . . . 5 ⊢ (𝑓 = (𝑦 ∈ ℝ ↦ if(𝑦 = 0, 0, 1)) → (𝑓‘𝑥) = ((𝑦 ∈ ℝ ↦ if(𝑦 = 0, 0, 1))‘𝑥))
59	58	neeq1d 2382	. . . 4 ⊢ (𝑓 = (𝑦 ∈ ℝ ↦ if(𝑦 = 0, 0, 1)) → ((𝑓‘𝑥) ≠ 0 ↔ ((𝑦 ∈ ℝ ↦ if(𝑦 = 0, 0, 1))‘𝑥) ≠ 0))
60	59	ralbidv 2494	. . 3 ⊢ (𝑓 = (𝑦 ∈ ℝ ↦ if(𝑦 = 0, 0, 1)) → (∀𝑥 ∈ ℝ+ (𝑓‘𝑥) ≠ 0 ↔ ∀𝑥 ∈ ℝ+ ((𝑦 ∈ ℝ ↦ if(𝑦 = 0, 0, 1))‘𝑥) ≠ 0))
61	55, 57, 60	3anbi123d 1323	. 2 ⊢ (𝑓 = (𝑦 ∈ ℝ ↦ if(𝑦 = 0, 0, 1)) → ((𝑓:ℝ⟶ℤ ∧ (𝑓‘0) = 0 ∧ ∀𝑥 ∈ ℝ+ (𝑓‘𝑥) ≠ 0) ↔ ((𝑦 ∈ ℝ ↦ if(𝑦 = 0, 0, 1)):ℝ⟶ℤ ∧ ((𝑦 ∈ ℝ ↦ if(𝑦 = 0, 0, 1))‘0) = 0 ∧ ∀𝑥 ∈ ℝ+ ((𝑦 ∈ ℝ ↦ if(𝑦 = 0, 0, 1))‘𝑥) ≠ 0)))
62	3, 54, 61	elabd 2906	1 ⊢ (∀𝑥 ∈ ℝ DECID 𝑥 = 0 → ∃𝑓(𝑓:ℝ⟶ℤ ∧ (𝑓‘0) = 0 ∧ ∀𝑥 ∈ ℝ+ (𝑓‘𝑥) ≠ 0))

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 104   ∨ wo 709  DECID wdc 835   ∧ w3a 980   = wceq 1364  ⊤wtru 1365  ∃wex 1503   ∈ wcel 2164   ≠ wne 2364  ∀wral 2472  Vcvv 2760  ifcif 3558   ↦ cmpt 4091  ⟶wf 5251  ‘cfv 5255  ℝcr 7873  0cc0 7874  1c1 7875  ℤcz 9320  ℝ⁺crp 9722

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 615  ax-in2 616  ax-io 710  ax-5 1458  ax-7 1459  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-10 1516  ax-11 1517  ax-i12 1518  ax-bndl 1520  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-i5r 1546  ax-13 2166  ax-14 2167  ax-ext 2175  ax-coll 4145  ax-sep 4148  ax-pow 4204  ax-pr 4239  ax-un 4465  ax-setind 4570  ax-cnex 7965  ax-resscn 7966  ax-1cn 7967  ax-1re 7968  ax-icn 7969  ax-addcl 7970  ax-addrcl 7971  ax-mulcl 7972  ax-addcom 7974  ax-addass 7976  ax-distr 7978  ax-i2m1 7979  ax-0lt1 7980  ax-0id 7982  ax-rnegex 7983  ax-cnre 7985  ax-pre-ltirr 7986  ax-pre-ltwlin 7987  ax-pre-lttrn 7988  ax-pre-ltadd 7990

This theorem depends on definitions:  df-bi 117  df-dc 836  df-3or 981  df-3an 982  df-tru 1367  df-fal 1370  df-nf 1472  df-sb 1774  df-eu 2045  df-mo 2046  df-clab 2180  df-cleq 2186  df-clel 2189  df-nfc 2325  df-ne 2365  df-nel 2460  df-ral 2477  df-rex 2478  df-reu 2479  df-rab 2481  df-v 2762  df-sbc 2987  df-csb 3082  df-dif 3156  df-un 3158  df-in 3160  df-ss 3167  df-if 3559  df-pw 3604  df-sn 3625  df-pr 3626  df-op 3628  df-uni 3837  df-int 3872  df-iun 3915  df-br 4031  df-opab 4092  df-mpt 4093  df-id 4325  df-xp 4666  df-rel 4667  df-cnv 4668  df-co 4669  df-dm 4670  df-rn 4671  df-res 4672  df-ima 4673  df-iota 5216  df-fun 5257  df-fn 5258  df-f 5259  df-f1 5260  df-fo 5261  df-f1o 5262  df-fv 5263  df-riota 5874  df-ov 5922  df-oprab 5923  df-mpo 5924  df-pnf 8058  df-mnf 8059  df-xr 8060  df-ltxr 8061  df-le 8062  df-sub 8194  df-neg 8195  df-inn 8985  df-z 9321  df-rp 9723

This theorem is referenced by:  dcapnconstALT  15622