Theorem redc0 16773

Description: Two ways to express decidability of real number equality. (Contributed by Jim Kingdon, 23-Jul-2024.)

Assertion

Ref	Expression
redc0	|- ( A. x e. RR A. y e. RR DECID x = y <-> A. z e. RR DECID z = 0 )

Distinct variable group:   x, y, z

Proof of Theorem redc0

Step	Hyp	Ref	Expression
1		0re 8222	. . . . 5 |- 0 e. RR
2		eqeq1 2238	. . . . . . 7 |- ( x = z -> ( x = y <-> z = y ) )
3	2	dcbid 846	. . . . . 6 |- ( x = z -> (DECID x = y <-> DECID z = y ) )
4		eqeq2 2241	. . . . . . 7 |- ( y = 0 -> ( z = y <-> z = 0 ) )
5	4	dcbid 846	. . . . . 6 |- ( y = 0 -> (DECID z = y <-> DECID z = 0 ) )
6	3, 5	rspc2v 2924	. . . . 5 |- ( ( z e. RR /\ 0 e. RR ) -> ( A. x e. RR A. y e. RR DECID x = y -> DECID z = 0 ) )
7	1, 6	mpan2 425	. . . 4 |- ( z e. RR -> ( A. x e. RR A. y e. RR DECID x = y -> DECID z = 0 ) )
8	7	impcom 125	. . 3 |- ( ( A. x e. RR A. y e. RR DECID x = y /\ z e. RR ) -> DECID z = 0 )
9	8	ralrimiva 2606	. 2 |- ( A. x e. RR A. y e. RR DECID x = y -> A. z e. RR DECID z = 0 )
10		eqeq1 2238	. . . . . 6 |- ( z = ( x - y ) -> ( z = 0 <-> ( x - y ) = 0 ) )
11	10	dcbid 846	. . . . 5 |- ( z = ( x - y ) -> (DECID z = 0 <-> DECID ( x - y ) = 0 ) )
12		simpl 109	. . . . 5 |- ( ( A. z e. RR DECID z = 0 /\ ( x e. RR /\ y e. RR ) ) -> A. z e. RR DECID z = 0 )
13		resubcl 8485	. . . . . 6 |- ( ( x e. RR /\ y e. RR ) -> ( x - y ) e. RR )
14	13	adantl 277	. . . . 5 |- ( ( A. z e. RR DECID z = 0 /\ ( x e. RR /\ y e. RR ) ) -> ( x - y ) e. RR )
15	11, 12, 14	rspcdva 2916	. . . 4 |- ( ( A. z e. RR DECID z = 0 /\ ( x e. RR /\ y e. RR ) ) -> DECID ( x - y ) = 0 )
16		simprl 531	. . . . . . 7 |- ( ( A. z e. RR DECID z = 0 /\ ( x e. RR /\ y e. RR ) ) -> x e. RR )
17	16	recnd 8250	. . . . . 6 |- ( ( A. z e. RR DECID z = 0 /\ ( x e. RR /\ y e. RR ) ) -> x e. CC )
18		simprr 533	. . . . . . 7 |- ( ( A. z e. RR DECID z = 0 /\ ( x e. RR /\ y e. RR ) ) -> y e. RR )
19	18	recnd 8250	. . . . . 6 |- ( ( A. z e. RR DECID z = 0 /\ ( x e. RR /\ y e. RR ) ) -> y e. CC )
20	17, 19	subeq0ad 8542	. . . . 5 |- ( ( A. z e. RR DECID z = 0 /\ ( x e. RR /\ y e. RR ) ) -> ( ( x - y ) = 0 <-> x = y ) )
21	20	dcbid 846	. . . 4 |- ( ( A. z e. RR DECID z = 0 /\ ( x e. RR /\ y e. RR ) ) -> (DECID ( x - y ) = 0 <-> DECID x = y ) )
22	15, 21	mpbid 147	. . 3 |- ( ( A. z e. RR DECID z = 0 /\ ( x e. RR /\ y e. RR ) ) -> DECID x = y )
23	22	ralrimivva 2615	. 2 |- ( A. z e. RR DECID z = 0 -> A. x e. RR A. y e. RR DECID x = y )
24	9, 23	impbii 126	1 |- ( A. x e. RR A. y e. RR DECID x = y <-> A. z e. RR DECID z = 0 )

Syntax hints:   -> wi 4   /\ wa 104   <-> wb 105  DECID wdc 842   = wceq 1398   e. wcel 2202   A.wral 2511  (class class class)co 6028   RRcr 8074   0cc0 8075   - cmin 8392

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 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-14 2205  ax-ext 2213  ax-sep 4212  ax-pow 4270  ax-pr 4305  ax-setind 4641  ax-resscn 8167  ax-1cn 8168  ax-1re 8169  ax-icn 8170  ax-addcl 8171  ax-addrcl 8172  ax-mulcl 8173  ax-addcom 8175  ax-addass 8177  ax-distr 8179  ax-i2m1 8180  ax-0id 8183  ax-rnegex 8184  ax-cnre 8186

This theorem depends on definitions:  df-bi 117  df-dc 843  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-ne 2404  df-ral 2516  df-rex 2517  df-reu 2518  df-rab 2520  df-v 2805  df-sbc 3033  df-dif 3203  df-un 3205  df-in 3207  df-ss 3214  df-pw 3658  df-sn 3679  df-pr 3680  df-op 3682  df-uni 3899  df-br 4094  df-opab 4156  df-id 4396  df-xp 4737  df-rel 4738  df-cnv 4739  df-co 4740  df-dm 4741  df-iota 5293  df-fun 5335  df-fv 5341  df-riota 5981  df-ov 6031  df-oprab 6032  df-mpo 6033  df-sub 8394  df-neg 8395

This theorem is referenced by:  dcapnconstALT  16778