Users' Mathboxes Mathbox for Jim Kingdon < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >   Mathboxes  >  dceqnconst GIF version

Theorem dceqnconst 15036
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 15031 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.
StepHypRef Expression
1 reex 7958 . . . 4 ℝ ∈ V
21mptex 5755 . . 3 (𝑦 ∈ ℝ ↦ if(𝑦 = 0, 0, 1)) ∈ V
32a1i 9 . 2 (βˆ€π‘₯ ∈ ℝ DECID π‘₯ = 0 β†’ (𝑦 ∈ ℝ ↦ if(𝑦 = 0, 0, 1)) ∈ V)
4 0zd 9278 . . . . 5 ((βˆ€π‘₯ ∈ ℝ DECID π‘₯ = 0 ∧ 𝑦 ∈ ℝ) β†’ 0 ∈ β„€)
5 1zzd 9293 . . . . 5 ((βˆ€π‘₯ ∈ ℝ DECID π‘₯ = 0 ∧ 𝑦 ∈ ℝ) β†’ 1 ∈ β„€)
6 eqeq1 2194 . . . . . . 7 (π‘₯ = 𝑦 β†’ (π‘₯ = 0 ↔ 𝑦 = 0))
76dcbid 839 . . . . . 6 (π‘₯ = 𝑦 β†’ (DECID π‘₯ = 0 ↔ DECID 𝑦 = 0))
87rspccva 2852 . . . . 5 ((βˆ€π‘₯ ∈ ℝ DECID π‘₯ = 0 ∧ 𝑦 ∈ ℝ) β†’ DECID 𝑦 = 0)
94, 5, 8ifcldcd 3582 . . . 4 ((βˆ€π‘₯ ∈ ℝ DECID π‘₯ = 0 ∧ 𝑦 ∈ ℝ) β†’ if(𝑦 = 0, 0, 1) ∈ β„€)
109fmpttd 5684 . . 3 (βˆ€π‘₯ ∈ ℝ DECID π‘₯ = 0 β†’ (𝑦 ∈ ℝ ↦ if(𝑦 = 0, 0, 1)):β„βŸΆβ„€)
11 0re 7970 . . . . . 6 0 ∈ ℝ
12 0zd 9278 . . . . . . . 8 (⊀ β†’ 0 ∈ β„€)
13 1zzd 9293 . . . . . . . 8 (⊀ β†’ 1 ∈ β„€)
14 eqid 2187 . . . . . . . . . . 11 0 = 0
1514orci 732 . . . . . . . . . 10 (0 = 0 ∨ Β¬ 0 = 0)
16 df-dc 836 . . . . . . . . . 10 (DECID 0 = 0 ↔ (0 = 0 ∨ Β¬ 0 = 0))
1715, 16mpbir 146 . . . . . . . . 9 DECID 0 = 0
1817a1i 9 . . . . . . . 8 (⊀ β†’ DECID 0 = 0)
1912, 13, 18ifcldcd 3582 . . . . . . 7 (⊀ β†’ if(0 = 0, 0, 1) ∈ β„€)
2019mptru 1372 . . . . . 6 if(0 = 0, 0, 1) ∈ β„€
21 eqeq1 2194 . . . . . . . 8 (𝑦 = 0 β†’ (𝑦 = 0 ↔ 0 = 0))
2221ifbid 3567 . . . . . . 7 (𝑦 = 0 β†’ if(𝑦 = 0, 0, 1) = if(0 = 0, 0, 1))
23 eqid 2187 . . . . . . 7 (𝑦 ∈ ℝ ↦ if(𝑦 = 0, 0, 1)) = (𝑦 ∈ ℝ ↦ if(𝑦 = 0, 0, 1))
2422, 23fvmptg 5605 . . . . . 6 ((0 ∈ ℝ ∧ if(0 = 0, 0, 1) ∈ β„€) β†’ ((𝑦 ∈ ℝ ↦ if(𝑦 = 0, 0, 1))β€˜0) = if(0 = 0, 0, 1))
2511, 20, 24mp2an 426 . . . . 5 ((𝑦 ∈ ℝ ↦ if(𝑦 = 0, 0, 1))β€˜0) = if(0 = 0, 0, 1)
2614iftruei 3552 . . . . 5 if(0 = 0, 0, 1) = 0
2725, 26eqtri 2208 . . . 4 ((𝑦 ∈ ℝ ↦ if(𝑦 = 0, 0, 1))β€˜0) = 0
2827a1i 9 . . 3 (βˆ€π‘₯ ∈ ℝ DECID π‘₯ = 0 β†’ ((𝑦 ∈ ℝ ↦ if(𝑦 = 0, 0, 1))β€˜0) = 0)
29 1ne0 9000 . . . . . 6 1 β‰  0
30 eqeq1 2194 . . . . . . . . . 10 (𝑦 = 𝑧 β†’ (𝑦 = 0 ↔ 𝑧 = 0))
3130ifbid 3567 . . . . . . . . 9 (𝑦 = 𝑧 β†’ if(𝑦 = 0, 0, 1) = if(𝑧 = 0, 0, 1))
32 rpre 9673 . . . . . . . . . 10 (𝑧 ∈ ℝ+ β†’ 𝑧 ∈ ℝ)
3332adantl 277 . . . . . . . . 9 ((βˆ€π‘₯ ∈ ℝ DECID π‘₯ = 0 ∧ 𝑧 ∈ ℝ+) β†’ 𝑧 ∈ ℝ)
34 0zd 9278 . . . . . . . . . 10 ((βˆ€π‘₯ ∈ ℝ DECID π‘₯ = 0 ∧ 𝑧 ∈ ℝ+) β†’ 0 ∈ β„€)
35 1zzd 9293 . . . . . . . . . 10 ((βˆ€π‘₯ ∈ ℝ DECID π‘₯ = 0 ∧ 𝑧 ∈ ℝ+) β†’ 1 ∈ β„€)
36 eqeq1 2194 . . . . . . . . . . . 12 (π‘₯ = 𝑧 β†’ (π‘₯ = 0 ↔ 𝑧 = 0))
3736dcbid 839 . . . . . . . . . . 11 (π‘₯ = 𝑧 β†’ (DECID π‘₯ = 0 ↔ DECID 𝑧 = 0))
38 simpl 109 . . . . . . . . . . 11 ((βˆ€π‘₯ ∈ ℝ DECID π‘₯ = 0 ∧ 𝑧 ∈ ℝ+) β†’ βˆ€π‘₯ ∈ ℝ DECID π‘₯ = 0)
3937, 38, 33rspcdva 2858 . . . . . . . . . 10 ((βˆ€π‘₯ ∈ ℝ DECID π‘₯ = 0 ∧ 𝑧 ∈ ℝ+) β†’ DECID 𝑧 = 0)
4034, 35, 39ifcldcd 3582 . . . . . . . . 9 ((βˆ€π‘₯ ∈ ℝ DECID π‘₯ = 0 ∧ 𝑧 ∈ ℝ+) β†’ if(𝑧 = 0, 0, 1) ∈ β„€)
4123, 31, 33, 40fvmptd3 5622 . . . . . . . 8 ((βˆ€π‘₯ ∈ ℝ DECID π‘₯ = 0 ∧ 𝑧 ∈ ℝ+) β†’ ((𝑦 ∈ ℝ ↦ if(𝑦 = 0, 0, 1))β€˜π‘§) = if(𝑧 = 0, 0, 1))
42 rpne0 9682 . . . . . . . . . . 11 (𝑧 ∈ ℝ+ β†’ 𝑧 β‰  0)
4342neneqd 2378 . . . . . . . . . 10 (𝑧 ∈ ℝ+ β†’ Β¬ 𝑧 = 0)
4443iffalsed 3556 . . . . . . . . 9 (𝑧 ∈ ℝ+ β†’ if(𝑧 = 0, 0, 1) = 1)
4544adantl 277 . . . . . . . 8 ((βˆ€π‘₯ ∈ ℝ DECID π‘₯ = 0 ∧ 𝑧 ∈ ℝ+) β†’ if(𝑧 = 0, 0, 1) = 1)
4641, 45eqtrd 2220 . . . . . . 7 ((βˆ€π‘₯ ∈ ℝ DECID π‘₯ = 0 ∧ 𝑧 ∈ ℝ+) β†’ ((𝑦 ∈ ℝ ↦ if(𝑦 = 0, 0, 1))β€˜π‘§) = 1)
4746neeq1d 2375 . . . . . 6 ((βˆ€π‘₯ ∈ ℝ DECID π‘₯ = 0 ∧ 𝑧 ∈ ℝ+) β†’ (((𝑦 ∈ ℝ ↦ if(𝑦 = 0, 0, 1))β€˜π‘§) β‰  0 ↔ 1 β‰  0))
4829, 47mpbiri 168 . . . . 5 ((βˆ€π‘₯ ∈ ℝ DECID π‘₯ = 0 ∧ 𝑧 ∈ ℝ+) β†’ ((𝑦 ∈ ℝ ↦ if(𝑦 = 0, 0, 1))β€˜π‘§) β‰  0)
4948ralrimiva 2560 . . . 4 (βˆ€π‘₯ ∈ ℝ DECID π‘₯ = 0 β†’ βˆ€π‘§ ∈ ℝ+ ((𝑦 ∈ ℝ ↦ if(𝑦 = 0, 0, 1))β€˜π‘§) β‰  0)
50 fveq2 5527 . . . . . 6 (𝑧 = π‘₯ β†’ ((𝑦 ∈ ℝ ↦ if(𝑦 = 0, 0, 1))β€˜π‘§) = ((𝑦 ∈ ℝ ↦ if(𝑦 = 0, 0, 1))β€˜π‘₯))
5150neeq1d 2375 . . . . 5 (𝑧 = π‘₯ β†’ (((𝑦 ∈ ℝ ↦ if(𝑦 = 0, 0, 1))β€˜π‘§) β‰  0 ↔ ((𝑦 ∈ ℝ ↦ if(𝑦 = 0, 0, 1))β€˜π‘₯) β‰  0))
5251cbvralv 2715 . . . 4 (βˆ€π‘§ ∈ ℝ+ ((𝑦 ∈ ℝ ↦ if(𝑦 = 0, 0, 1))β€˜π‘§) β‰  0 ↔ βˆ€π‘₯ ∈ ℝ+ ((𝑦 ∈ ℝ ↦ if(𝑦 = 0, 0, 1))β€˜π‘₯) β‰  0)
5349, 52sylib 122 . . 3 (βˆ€π‘₯ ∈ ℝ DECID π‘₯ = 0 β†’ βˆ€π‘₯ ∈ ℝ+ ((𝑦 ∈ ℝ ↦ if(𝑦 = 0, 0, 1))β€˜π‘₯) β‰  0)
5410, 28, 533jca 1178 . 2 (βˆ€π‘₯ ∈ ℝ DECID π‘₯ = 0 β†’ ((𝑦 ∈ ℝ ↦ if(𝑦 = 0, 0, 1)):β„βŸΆβ„€ ∧ ((𝑦 ∈ ℝ ↦ if(𝑦 = 0, 0, 1))β€˜0) = 0 ∧ βˆ€π‘₯ ∈ ℝ+ ((𝑦 ∈ ℝ ↦ if(𝑦 = 0, 0, 1))β€˜π‘₯) β‰  0))
55 feq1 5360 . . 3 (𝑓 = (𝑦 ∈ ℝ ↦ if(𝑦 = 0, 0, 1)) β†’ (𝑓:β„βŸΆβ„€ ↔ (𝑦 ∈ ℝ ↦ if(𝑦 = 0, 0, 1)):β„βŸΆβ„€))
56 fveq1 5526 . . . 4 (𝑓 = (𝑦 ∈ ℝ ↦ if(𝑦 = 0, 0, 1)) β†’ (π‘“β€˜0) = ((𝑦 ∈ ℝ ↦ if(𝑦 = 0, 0, 1))β€˜0))
5756eqeq1d 2196 . . 3 (𝑓 = (𝑦 ∈ ℝ ↦ if(𝑦 = 0, 0, 1)) β†’ ((π‘“β€˜0) = 0 ↔ ((𝑦 ∈ ℝ ↦ if(𝑦 = 0, 0, 1))β€˜0) = 0))
58 fveq1 5526 . . . . 5 (𝑓 = (𝑦 ∈ ℝ ↦ if(𝑦 = 0, 0, 1)) β†’ (π‘“β€˜π‘₯) = ((𝑦 ∈ ℝ ↦ if(𝑦 = 0, 0, 1))β€˜π‘₯))
5958neeq1d 2375 . . . 4 (𝑓 = (𝑦 ∈ ℝ ↦ if(𝑦 = 0, 0, 1)) β†’ ((π‘“β€˜π‘₯) β‰  0 ↔ ((𝑦 ∈ ℝ ↦ if(𝑦 = 0, 0, 1))β€˜π‘₯) β‰  0))
6059ralbidv 2487 . . 3 (𝑓 = (𝑦 ∈ ℝ ↦ if(𝑦 = 0, 0, 1)) β†’ (βˆ€π‘₯ ∈ ℝ+ (π‘“β€˜π‘₯) β‰  0 ↔ βˆ€π‘₯ ∈ ℝ+ ((𝑦 ∈ ℝ ↦ if(𝑦 = 0, 0, 1))β€˜π‘₯) β‰  0))
6155, 57, 603anbi123d 1322 . 2 (𝑓 = (𝑦 ∈ ℝ ↦ if(𝑦 = 0, 0, 1)) β†’ ((𝑓:β„βŸΆβ„€ ∧ (π‘“β€˜0) = 0 ∧ βˆ€π‘₯ ∈ ℝ+ (π‘“β€˜π‘₯) β‰  0) ↔ ((𝑦 ∈ ℝ ↦ if(𝑦 = 0, 0, 1)):β„βŸΆβ„€ ∧ ((𝑦 ∈ ℝ ↦ if(𝑦 = 0, 0, 1))β€˜0) = 0 ∧ βˆ€π‘₯ ∈ ℝ+ ((𝑦 ∈ ℝ ↦ if(𝑦 = 0, 0, 1))β€˜π‘₯) β‰  0)))
623, 54, 61elabd 2894 1 (βˆ€π‘₯ ∈ ℝ DECID π‘₯ = 0 β†’ βˆƒπ‘“(𝑓:β„βŸΆβ„€ ∧ (π‘“β€˜0) = 0 ∧ βˆ€π‘₯ ∈ ℝ+ (π‘“β€˜π‘₯) β‰  0))
Colors of variables: wff set class
Syntax hints:  Β¬ wn 3   β†’ wi 4   ∧ wa 104   ∨ wo 709  DECID wdc 835   ∧ w3a 979   = wceq 1363  βŠ€wtru 1364  βˆƒwex 1502   ∈ wcel 2158   β‰  wne 2357  βˆ€wral 2465  Vcvv 2749  ifcif 3546   ↦ cmpt 4076  βŸΆwf 5224  β€˜cfv 5228  β„cr 7823  0cc0 7824  1c1 7825  β„€cz 9266  β„+crp 9666
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 1457  ax-7 1458  ax-gen 1459  ax-ie1 1503  ax-ie2 1504  ax-8 1514  ax-10 1515  ax-11 1516  ax-i12 1517  ax-bndl 1519  ax-4 1520  ax-17 1536  ax-i9 1540  ax-ial 1544  ax-i5r 1545  ax-13 2160  ax-14 2161  ax-ext 2169  ax-coll 4130  ax-sep 4133  ax-pow 4186  ax-pr 4221  ax-un 4445  ax-setind 4548  ax-cnex 7915  ax-resscn 7916  ax-1cn 7917  ax-1re 7918  ax-icn 7919  ax-addcl 7920  ax-addrcl 7921  ax-mulcl 7922  ax-addcom 7924  ax-addass 7926  ax-distr 7928  ax-i2m1 7929  ax-0lt1 7930  ax-0id 7932  ax-rnegex 7933  ax-cnre 7935  ax-pre-ltirr 7936  ax-pre-ltwlin 7937  ax-pre-lttrn 7938  ax-pre-ltadd 7940
This theorem depends on definitions:  df-bi 117  df-dc 836  df-3or 980  df-3an 981  df-tru 1366  df-fal 1369  df-nf 1471  df-sb 1773  df-eu 2039  df-mo 2040  df-clab 2174  df-cleq 2180  df-clel 2183  df-nfc 2318  df-ne 2358  df-nel 2453  df-ral 2470  df-rex 2471  df-reu 2472  df-rab 2474  df-v 2751  df-sbc 2975  df-csb 3070  df-dif 3143  df-un 3145  df-in 3147  df-ss 3154  df-if 3547  df-pw 3589  df-sn 3610  df-pr 3611  df-op 3613  df-uni 3822  df-int 3857  df-iun 3900  df-br 4016  df-opab 4077  df-mpt 4078  df-id 4305  df-xp 4644  df-rel 4645  df-cnv 4646  df-co 4647  df-dm 4648  df-rn 4649  df-res 4650  df-ima 4651  df-iota 5190  df-fun 5230  df-fn 5231  df-f 5232  df-f1 5233  df-fo 5234  df-f1o 5235  df-fv 5236  df-riota 5844  df-ov 5891  df-oprab 5892  df-mpo 5893  df-pnf 8007  df-mnf 8008  df-xr 8009  df-ltxr 8010  df-le 8011  df-sub 8143  df-neg 8144  df-inn 8933  df-z 9267  df-rp 9667
This theorem is referenced by:  dcapnconstALT  15038
  Copyright terms: Public domain W3C validator