Users' Mathboxes Mathbox for Jim Kingdon < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >   Mathboxes  >  neap0mkv Unicode version
Theorem neap0mkv 16855
Description: The analytic Markov principle can be expressed either with two arbitrary real numbers, or one arbitrary number and zero. (Contributed by Jim Kingdon, 23-Feb-2025.)
Assertion
Ref Expression
neap0mkv |- ( A. x e. RR A. y e. RR ( x =/= y -> x # y ) <-> A. x e. RR ( x =/= 0 -> x # 0 ) )
Distinct variable group:   x, y
Proof of Theorem neap0mkv
Dummy variable z is distinct from all other variables.
StepHypRef Expression
1 0re 8274 . . . 4 |- 0 e. RR
2 neeq2 2426 . . . . . 6 |- ( y = 0 -> ( x =/= y <-> x =/= 0 ) )
3 breq2 4113 . . . . . 6 |- ( y = 0 -> ( x # y <-> x # 0 ) )
42, 3imbi12d 234 . . . . 5 |- ( y = 0 -> ( ( x =/= y -> x # y ) <-> ( x =/= 0 -> x # 0 ) ) )
54rspcv 2917 . . . 4 |- ( 0 e. RR -> ( A. y e. RR ( x =/= y -> x # y ) -> ( x =/= 0 -> x # 0 ) ) )
61, 5ax-mp 5 . . 3 |- ( A. y e. RR ( x =/= y -> x # y ) -> ( x =/= 0 -> x # 0 ) )
76ralimi 2605 . 2 |- ( A. x e. RR A. y e. RR ( x =/= y -> x # y ) -> A. x e. RR ( x =/= 0 -> x # 0 ) )
8 neeq1 2425 . . . . 5 |- ( x = z -> ( x =/= 0 <-> z =/= 0 ) )
9 breq1 4112 . . . . 5 |- ( x = z -> ( x # 0 <-> z # 0 ) )
108, 9imbi12d 234 . . . 4 |- ( x = z -> ( ( x =/= 0 -> x # 0 ) <-> ( z =/= 0 -> z # 0 ) ) )
1110cbvralv 2778 . . 3 |- ( A. x e. RR ( x =/= 0 -> x # 0 ) <-> A. z e. RR ( z =/= 0 -> z # 0 ) )
12 neeq1 2425 . . . . . . 7 |- ( z = ( x - y ) -> ( z =/= 0 <-> ( x - y ) =/= 0 ) )
13 breq1 4112 . . . . . . 7 |- ( z = ( x - y ) -> ( z # 0 <-> ( x - y ) # 0 ) )
1412, 13imbi12d 234 . . . . . 6 |- ( z = ( x - y ) -> ( ( z =/= 0 -> z # 0 ) <-> ( ( x - y ) =/= 0 -> ( x - y ) # 0 ) ) )
15 simpl 109 . . . . . 6 |- ( ( A. z e. RR ( z =/= 0 -> z # 0 ) /\ ( x e. RR /\ y e. RR ) ) -> A. z e. RR ( z =/= 0 -> z # 0 ) )
16 simprl 531 . . . . . . 7 |- ( ( A. z e. RR ( z =/= 0 -> z # 0 ) /\ ( x e. RR /\ y e. RR ) ) -> x e. RR )
17 simprr 533 . . . . . . 7 |- ( ( A. z e. RR ( z =/= 0 -> z # 0 ) /\ ( x e. RR /\ y e. RR ) ) -> y e. RR )
1816, 17resubcld 8654 . . . . . 6 |- ( ( A. z e. RR ( z =/= 0 -> z # 0 ) /\ ( x e. RR /\ y e. RR ) ) -> ( x - y ) e. RR )
1914, 15, 18rspcdva 2926 . . . . 5 |- ( ( A. z e. RR ( z =/= 0 -> z # 0 ) /\ ( x e. RR /\ y e. RR ) ) -> ( ( x - y ) =/= 0 -> ( x - y ) # 0 ) )
2016recnd 8302 . . . . . . 7 |- ( ( A. z e. RR ( z =/= 0 -> z # 0 ) /\ ( x e. RR /\ y e. RR ) ) -> x e. CC )
2117recnd 8302 . . . . . . 7 |- ( ( A. z e. RR ( z =/= 0 -> z # 0 ) /\ ( x e. RR /\ y e. RR ) ) -> y e. CC )
2220, 21subeq0ad 8594 . . . . . 6 |- ( ( A. z e. RR ( z =/= 0 -> z # 0 ) /\ ( x e. RR /\ y e. RR ) ) -> ( ( x - y ) = 0 <-> x = y ) )
2322necon3bid 2453 . . . . 5 |- ( ( A. z e. RR ( z =/= 0 -> z # 0 ) /\ ( x e. RR /\ y e. RR ) ) -> ( ( x - y ) =/= 0 <-> x =/= y ) )
24 subap0 8917 . . . . . 6 |- ( ( x e. CC /\ y e. CC ) -> ( ( x - y ) # 0 <-> x # y ) )
2520, 21, 24syl2anc 411 . . . . 5 |- ( ( A. z e. RR ( z =/= 0 -> z # 0 ) /\ ( x e. RR /\ y e. RR ) ) -> ( ( x - y ) # 0 <-> x # y ) )
2619, 23, 253imtr3d 202 . . . 4 |- ( ( A. z e. RR ( z =/= 0 -> z # 0 ) /\ ( x e. RR /\ y e. RR ) ) -> ( x =/= y -> x # y ) )
2726ralrimivva 2624 . . 3 |- ( A. z e. RR ( z =/= 0 -> z # 0 ) -> A. x e. RR A. y e. RR ( x =/= y -> x # y ) )
2811, 27sylbi 121 . 2 |- ( A. x e. RR ( x =/= 0 -> x # 0 ) -> A. x e. RR A. y e. RR ( x =/= y -> x # y ) )
297, 28impbii 126 1 |- ( A. x e. RR A. y e. RR ( x =/= y -> x # y ) <-> A. x e. RR ( x =/= 0 -> x # 0 ) )
Colors of variables: wff set class
Syntax hints:   -> wi 4   /\ wa 104   <-> wb 105   = wceq 1398   e. wcel 2203   =/= wne 2412   A.wral 2520   class class class wbr 4109  (class class class)co 6050   CCcc 8125   RRcr 8126   0cc0 8127   - cmin 8444   # cap 8855
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 2205  ax-14 2206  ax-ext 2214  ax-sep 4228  ax-pow 4287  ax-pr 4322  ax-un 4554  ax-setind 4659  ax-cnex 8218  ax-resscn 8219  ax-1cn 8220  ax-1re 8221  ax-icn 8222  ax-addcl 8223  ax-addrcl 8224  ax-mulcl 8225  ax-mulrcl 8226  ax-addcom 8227  ax-mulcom 8228  ax-addass 8229  ax-mulass 8230  ax-distr 8231  ax-i2m1 8232  ax-0lt1 8233  ax-1rid 8234  ax-0id 8235  ax-rnegex 8236  ax-precex 8237  ax-cnre 8238  ax-pre-ltirr 8239  ax-pre-lttrn 8241  ax-pre-apti 8242  ax-pre-ltadd 8243  ax-pre-mulgt0 8244
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1812  df-eu 2083  df-mo 2084  df-clab 2219  df-cleq 2225  df-clel 2228  df-nfc 2373  df-ne 2413  df-nel 2508  df-ral 2525  df-rex 2526  df-reu 2527  df-rab 2529  df-v 2815  df-sbc 3043  df-dif 3213  df-un 3215  df-in 3217  df-ss 3224  df-pw 3671  df-sn 3695  df-pr 3696  df-op 3698  df-uni 3915  df-br 4110  df-opab 4172  df-id 4414  df-xp 4755  df-rel 4756  df-cnv 4757  df-co 4758  df-dm 4759  df-iota 5312  df-fun 5354  df-fv 5360  df-riota 6003  df-ov 6053  df-oprab 6054  df-mpo 6055  df-pnf 8310  df-mnf 8311  df-ltxr 8313  df-sub 8446  df-neg 8447  df-reap 8849  df-ap 8856
This theorem is referenced by:  ltlenmkv  16856
  Copyright terms: Public domain W3C validator