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

Theorem refeq 16756
Description: Equality of two real functions which agree at negative numbers, positive numbers, and zero. This holds even without real trichotomy. From an online post by Martin Escardo. (Contributed by Jim Kingdon, 9-Jul-2023.)
Hypotheses
Ref Expression
refeq.f  |-  ( ph  ->  F : RR --> RR )
refeq.g  |-  ( ph  ->  G : RR --> RR )
refeq.lt0  |-  ( ph  ->  A. x  e.  RR  ( x  <  0  ->  ( F `  x
)  =  ( G `
 x ) ) )
refeq.gt0  |-  ( ph  ->  A. x  e.  RR  ( 0  <  x  ->  ( F `  x
)  =  ( G `
 x ) ) )
refeq.0  |-  ( ph  ->  ( F `  0
)  =  ( G `
 0 ) )
Assertion
Ref Expression
refeq  |-  ( ph  ->  F  =  G )
Distinct variable groups:    x, F    x, G    ph, x

Proof of Theorem refeq
StepHypRef Expression
1 refeq.f . . 3  |-  ( ph  ->  F : RR --> RR )
21ffnd 5490 . 2  |-  ( ph  ->  F  Fn  RR )
3 refeq.g . . 3  |-  ( ph  ->  G : RR --> RR )
43ffnd 5490 . 2  |-  ( ph  ->  G  Fn  RR )
5 refeq.0 . . . . . 6  |-  ( ph  ->  ( F `  0
)  =  ( G `
 0 ) )
65ad2antrr 488 . . . . 5  |-  ( ( ( ph  /\  x  e.  RR )  /\  ( F `  x ) #  ( G `  x ) )  ->  ( F `  0 )  =  ( G `  0
) )
7 simplr 529 . . . . . . . 8  |-  ( ( ( ph  /\  x  e.  RR )  /\  ( F `  x ) #  ( G `  x ) )  ->  x  e.  RR )
8 0red 8240 . . . . . . . 8  |-  ( ( ( ph  /\  x  e.  RR )  /\  ( F `  x ) #  ( G `  x ) )  ->  0  e.  RR )
9 simpr 110 . . . . . . . . . . 11  |-  ( ( ( ph  /\  x  e.  RR )  /\  ( F `  x ) #  ( G `  x ) )  ->  ( F `  x ) #  ( G `
 x ) )
101ffvelcdmda 5790 . . . . . . . . . . . . . 14  |-  ( (
ph  /\  x  e.  RR )  ->  ( F `
 x )  e.  RR )
1110recnd 8267 . . . . . . . . . . . . 13  |-  ( (
ph  /\  x  e.  RR )  ->  ( F `
 x )  e.  CC )
1211adantr 276 . . . . . . . . . . . 12  |-  ( ( ( ph  /\  x  e.  RR )  /\  ( F `  x ) #  ( G `  x ) )  ->  ( F `  x )  e.  CC )
133ffvelcdmda 5790 . . . . . . . . . . . . . 14  |-  ( (
ph  /\  x  e.  RR )  ->  ( G `
 x )  e.  RR )
1413recnd 8267 . . . . . . . . . . . . 13  |-  ( (
ph  /\  x  e.  RR )  ->  ( G `
 x )  e.  CC )
1514adantr 276 . . . . . . . . . . . 12  |-  ( ( ( ph  /\  x  e.  RR )  /\  ( F `  x ) #  ( G `  x ) )  ->  ( G `  x )  e.  CC )
16 apne 8862 . . . . . . . . . . . 12  |-  ( ( ( F `  x
)  e.  CC  /\  ( G `  x )  e.  CC )  -> 
( ( F `  x ) #  ( G `  x )  ->  ( F `  x )  =/=  ( G `  x
) ) )
1712, 15, 16syl2anc 411 . . . . . . . . . . 11  |-  ( ( ( ph  /\  x  e.  RR )  /\  ( F `  x ) #  ( G `  x ) )  ->  ( ( F `  x ) #  ( G `  x )  ->  ( F `  x )  =/=  ( G `  x )
) )
189, 17mpd 13 . . . . . . . . . 10  |-  ( ( ( ph  /\  x  e.  RR )  /\  ( F `  x ) #  ( G `  x ) )  ->  ( F `  x )  =/=  ( G `  x )
)
1918neneqd 2424 . . . . . . . . 9  |-  ( ( ( ph  /\  x  e.  RR )  /\  ( F `  x ) #  ( G `  x ) )  ->  -.  ( F `  x )  =  ( G `  x ) )
20 refeq.gt0 . . . . . . . . . . 11  |-  ( ph  ->  A. x  e.  RR  ( 0  <  x  ->  ( F `  x
)  =  ( G `
 x ) ) )
2120r19.21bi 2621 . . . . . . . . . 10  |-  ( (
ph  /\  x  e.  RR )  ->  ( 0  <  x  ->  ( F `  x )  =  ( G `  x ) ) )
2221adantr 276 . . . . . . . . 9  |-  ( ( ( ph  /\  x  e.  RR )  /\  ( F `  x ) #  ( G `  x ) )  ->  ( 0  <  x  ->  ( F `  x )  =  ( G `  x ) ) )
2319, 22mtod 669 . . . . . . . 8  |-  ( ( ( ph  /\  x  e.  RR )  /\  ( F `  x ) #  ( G `  x ) )  ->  -.  0  <  x )
247, 8, 23nltled 8359 . . . . . . 7  |-  ( ( ( ph  /\  x  e.  RR )  /\  ( F `  x ) #  ( G `  x ) )  ->  x  <_  0 )
25 refeq.lt0 . . . . . . . . . . 11  |-  ( ph  ->  A. x  e.  RR  ( x  <  0  ->  ( F `  x
)  =  ( G `
 x ) ) )
2625r19.21bi 2621 . . . . . . . . . 10  |-  ( (
ph  /\  x  e.  RR )  ->  ( x  <  0  ->  ( F `  x )  =  ( G `  x ) ) )
2726adantr 276 . . . . . . . . 9  |-  ( ( ( ph  /\  x  e.  RR )  /\  ( F `  x ) #  ( G `  x ) )  ->  ( x  <  0  ->  ( F `  x )  =  ( G `  x ) ) )
2819, 27mtod 669 . . . . . . . 8  |-  ( ( ( ph  /\  x  e.  RR )  /\  ( F `  x ) #  ( G `  x ) )  ->  -.  x  <  0 )
298, 7, 28nltled 8359 . . . . . . 7  |-  ( ( ( ph  /\  x  e.  RR )  /\  ( F `  x ) #  ( G `  x ) )  ->  0  <_  x )
307, 8letri3d 8354 . . . . . . 7  |-  ( ( ( ph  /\  x  e.  RR )  /\  ( F `  x ) #  ( G `  x ) )  ->  ( x  =  0  <->  ( x  <_  0  /\  0  <_  x ) ) )
3124, 29, 30mpbir2and 953 . . . . . 6  |-  ( ( ( ph  /\  x  e.  RR )  /\  ( F `  x ) #  ( G `  x ) )  ->  x  = 
0 )
3231fveq2d 5652 . . . . 5  |-  ( ( ( ph  /\  x  e.  RR )  /\  ( F `  x ) #  ( G `  x ) )  ->  ( F `  x )  =  ( F `  0 ) )
3331fveq2d 5652 . . . . 5  |-  ( ( ( ph  /\  x  e.  RR )  /\  ( F `  x ) #  ( G `  x ) )  ->  ( G `  x )  =  ( G `  0 ) )
346, 32, 333eqtr4d 2274 . . . 4  |-  ( ( ( ph  /\  x  e.  RR )  /\  ( F `  x ) #  ( G `  x ) )  ->  ( F `  x )  =  ( G `  x ) )
3534, 19pm2.65da 667 . . 3  |-  ( (
ph  /\  x  e.  RR )  ->  -.  ( F `  x ) #  ( G `  x ) )
36 apti 8861 . . . 4  |-  ( ( ( F `  x
)  e.  CC  /\  ( G `  x )  e.  CC )  -> 
( ( F `  x )  =  ( G `  x )  <->  -.  ( F `  x
) #  ( G `  x ) ) )
3711, 14, 36syl2anc 411 . . 3  |-  ( (
ph  /\  x  e.  RR )  ->  ( ( F `  x )  =  ( G `  x )  <->  -.  ( F `  x ) #  ( G `  x ) ) )
3835, 37mpbird 167 . 2  |-  ( (
ph  /\  x  e.  RR )  ->  ( F `
 x )  =  ( G `  x
) )
392, 4, 38eqfnfvd 5756 1  |-  ( ph  ->  F  =  G )
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    /\ wa 104    <-> wb 105    = wceq 1398    e. wcel 2202    =/= wne 2403   A.wral 2511   class class class wbr 4093   -->wf 5329   ` cfv 5333   CCcc 8090   RRcr 8091   0cc0 8092    < clt 8273    <_ cle 8274   # cap 8820
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-13 2204  ax-14 2205  ax-ext 2213  ax-sep 4212  ax-pow 4270  ax-pr 4305  ax-un 4536  ax-setind 4641  ax-cnex 8183  ax-resscn 8184  ax-1cn 8185  ax-1re 8186  ax-icn 8187  ax-addcl 8188  ax-addrcl 8189  ax-mulcl 8190  ax-mulrcl 8191  ax-addcom 8192  ax-mulcom 8193  ax-addass 8194  ax-mulass 8195  ax-distr 8196  ax-i2m1 8197  ax-0lt1 8198  ax-1rid 8199  ax-0id 8200  ax-rnegex 8201  ax-precex 8202  ax-cnre 8203  ax-pre-ltirr 8204  ax-pre-lttrn 8206  ax-pre-apti 8207  ax-pre-ltadd 8208  ax-pre-mulgt0 8209
This theorem depends on definitions:  df-bi 117  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-nel 2499  df-ral 2516  df-rex 2517  df-reu 2518  df-rab 2520  df-v 2805  df-sbc 3033  df-csb 3129  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-mpt 4157  df-id 4396  df-xp 4737  df-rel 4738  df-cnv 4739  df-co 4740  df-dm 4741  df-rn 4742  df-iota 5293  df-fun 5335  df-fn 5336  df-f 5337  df-fv 5341  df-riota 5981  df-ov 6031  df-oprab 6032  df-mpo 6033  df-pnf 8275  df-mnf 8276  df-xr 8277  df-ltxr 8278  df-le 8279  df-sub 8411  df-neg 8412  df-reap 8814  df-ap 8821
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator