Users' Mathboxes Mathbox for Jim Kingdon < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >   Mathboxes  >  neap0mkv Unicode version
Theorem neap0mkv 15559
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 8019 . . . 4 |- 0 e. RR
2 neeq2 2378 . . . . . 6 |- ( y = 0 -> ( x =/= y <-> x =/= 0 ) )
3 breq2 4033 . . . . . 6 |- ( y = 0 -> ( x # y <-> x # 0 ) )
42, 3imbi12d 234 . . . . 5 |- ( y = 0 -> ( ( x =/= y -> x # y ) <-> ( x =/= 0 -> x # 0 ) ) )
54rspcv 2860 . . . 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 2557 . 2 |- ( A. x e. RR A. y e. RR ( x =/= y -> x # y ) -> A. x e. RR ( x =/= 0 -> x # 0 ) )
8 neeq1 2377 . . . . 5 |- ( x = z -> ( x =/= 0 <-> z =/= 0 ) )
9 breq1 4032 . . . . 5 |- ( x = z -> ( x # 0 <-> z # 0 ) )
108, 9imbi12d 234 . . . 4 |- ( x = z -> ( ( x =/= 0 -> x # 0 ) <-> ( z =/= 0 -> z # 0 ) ) )
1110cbvralv 2726 . . 3 |- ( A. x e. RR ( x =/= 0 -> x # 0 ) <-> A. z e. RR ( z =/= 0 -> z # 0 ) )
12 neeq1 2377 . . . . . . 7 |- ( z = ( x - y ) -> ( z =/= 0 <-> ( x - y ) =/= 0 ) )
13 breq1 4032 . . . . . . 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 529 . . . . . . 7 |- ( ( A. z e. RR ( z =/= 0 -> z # 0 ) /\ ( x e. RR /\ y e. RR ) ) -> x e. RR )
17 simprr 531 . . . . . . 7 |- ( ( A. z e. RR ( z =/= 0 -> z # 0 ) /\ ( x e. RR /\ y e. RR ) ) -> y e. RR )
1816, 17resubcld 8400 . . . . . 6 |- ( ( A. z e. RR ( z =/= 0 -> z # 0 ) /\ ( x e. RR /\ y e. RR ) ) -> ( x - y ) e. RR )
1914, 15, 18rspcdva 2869 . . . . 5 |- ( ( A. z e. RR ( z =/= 0 -> z # 0 ) /\ ( x e. RR /\ y e. RR ) ) -> ( ( x - y ) =/= 0 -> ( x - y ) # 0 ) )
2016recnd 8048 . . . . . . 7 |- ( ( A. z e. RR ( z =/= 0 -> z # 0 ) /\ ( x e. RR /\ y e. RR ) ) -> x e. CC )
2117recnd 8048 . . . . . . 7 |- ( ( A. z e. RR ( z =/= 0 -> z # 0 ) /\ ( x e. RR /\ y e. RR ) ) -> y e. CC )
2220, 21subeq0ad 8340 . . . . . 6 |- ( ( A. z e. RR ( z =/= 0 -> z # 0 ) /\ ( x e. RR /\ y e. RR ) ) -> ( ( x - y ) = 0 <-> x = y ) )
2322necon3bid 2405 . . . . 5 |- ( ( A. z e. RR ( z =/= 0 -> z # 0 ) /\ ( x e. RR /\ y e. RR ) ) -> ( ( x - y ) =/= 0 <-> x =/= y ) )
24 subap0 8662 . . . . . 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 2576 . . 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 1364   e. wcel 2164   =/= wne 2364   A.wral 2472   class class class wbr 4029  (class class class)co 5918   CCcc 7870   RRcr 7871   0cc0 7872   - cmin 8190   # cap 8600
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-sep 4147  ax-pow 4203  ax-pr 4238  ax-un 4464  ax-setind 4569  ax-cnex 7963  ax-resscn 7964  ax-1cn 7965  ax-1re 7966  ax-icn 7967  ax-addcl 7968  ax-addrcl 7969  ax-mulcl 7970  ax-mulrcl 7971  ax-addcom 7972  ax-mulcom 7973  ax-addass 7974  ax-mulass 7975  ax-distr 7976  ax-i2m1 7977  ax-0lt1 7978  ax-1rid 7979  ax-0id 7980  ax-rnegex 7981  ax-precex 7982  ax-cnre 7983  ax-pre-ltirr 7984  ax-pre-lttrn 7986  ax-pre-apti 7987  ax-pre-ltadd 7988  ax-pre-mulgt0 7989
This theorem depends on definitions:  df-bi 117  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 2986  df-dif 3155  df-un 3157  df-in 3159  df-ss 3166  df-pw 3603  df-sn 3624  df-pr 3625  df-op 3627  df-uni 3836  df-br 4030  df-opab 4091  df-id 4324  df-xp 4665  df-rel 4666  df-cnv 4667  df-co 4668  df-dm 4669  df-iota 5215  df-fun 5256  df-fv 5262  df-riota 5873  df-ov 5921  df-oprab 5922  df-mpo 5923  df-pnf 8056  df-mnf 8057  df-ltxr 8059  df-sub 8192  df-neg 8193  df-reap 8594  df-ap 8601
This theorem is referenced by:  ltlenmkv  15560
  Copyright terms: Public domain W3C validator