ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  elcncf2 Unicode version
Theorem elcncf2 15264
Description: Version of elcncf 15263 with arguments commuted. (Contributed by Mario Carneiro, 28-Apr-2014.)
Assertion
Ref Expression
elcncf2 |- ( ( A C_ CC /\ B C_ CC ) -> ( F e. ( A -cn-> B ) <-> ( F : A --> B /\ A. x e. A A. y e. RR+ E. z e. RR+ A. w e. A ( ( abs ` ( w - x ) ) < z -> ( abs ` ( ( F ` w ) - ( F ` x ) ) ) < y ) ) ) )
Distinct variable groups:   x, w, y, z, A   w, F, x, y, z   w, B, x, y, z
Proof of Theorem elcncf2
StepHypRef Expression
1 elcncf 15263 . 2 |- ( ( A C_ CC /\ B C_ CC ) -> ( F e. ( A -cn-> B ) <-> ( F : A --> B /\ A. x e. A A. y e. RR+ E. z e. RR+ A. w e. A ( ( abs ` ( x - w ) ) < z -> ( abs ` ( ( F ` x ) - ( F ` w ) ) ) < y ) ) ) )
2 simplll 533 . . . . . . . . . . . 12 |- ( ( ( ( A C_ CC /\ B C_ CC ) /\ F : A --> B ) /\ ( x e. A /\ w e. A ) ) -> A C_ CC )
3 simprl 529 . . . . . . . . . . . 12 |- ( ( ( ( A C_ CC /\ B C_ CC ) /\ F : A --> B ) /\ ( x e. A /\ w e. A ) ) -> x e. A )
42, 3sseldd 3225 . . . . . . . . . . 11 |- ( ( ( ( A C_ CC /\ B C_ CC ) /\ F : A --> B ) /\ ( x e. A /\ w e. A ) ) -> x e. CC )
5 simprr 531 . . . . . . . . . . . 12 |- ( ( ( ( A C_ CC /\ B C_ CC ) /\ F : A --> B ) /\ ( x e. A /\ w e. A ) ) -> w e. A )
62, 5sseldd 3225 . . . . . . . . . . 11 |- ( ( ( ( A C_ CC /\ B C_ CC ) /\ F : A --> B ) /\ ( x e. A /\ w e. A ) ) -> w e. CC )
74, 6abssubd 11720 . . . . . . . . . 10 |- ( ( ( ( A C_ CC /\ B C_ CC ) /\ F : A --> B ) /\ ( x e. A /\ w e. A ) ) -> ( abs ` ( x - w ) ) = ( abs ` ( w - x ) ) )
87breq1d 4093 . . . . . . . . 9 |- ( ( ( ( A C_ CC /\ B C_ CC ) /\ F : A --> B ) /\ ( x e. A /\ w e. A ) ) -> ( ( abs ` ( x - w ) ) < z <-> ( abs ` ( w - x ) ) < z ) )
9 simpllr 534 . . . . . . . . . . . 12 |- ( ( ( ( A C_ CC /\ B C_ CC ) /\ F : A --> B ) /\ ( x e. A /\ w e. A ) ) -> B C_ CC )
10 simplr 528 . . . . . . . . . . . . 13 |- ( ( ( ( A C_ CC /\ B C_ CC ) /\ F : A --> B ) /\ ( x e. A /\ w e. A ) ) -> F : A --> B )
1110, 3ffvelcdmd 5773 . . . . . . . . . . . 12 |- ( ( ( ( A C_ CC /\ B C_ CC ) /\ F : A --> B ) /\ ( x e. A /\ w e. A ) ) -> ( F ` x ) e. B )
129, 11sseldd 3225 . . . . . . . . . . 11 |- ( ( ( ( A C_ CC /\ B C_ CC ) /\ F : A --> B ) /\ ( x e. A /\ w e. A ) ) -> ( F ` x ) e. CC )
1310, 5ffvelcdmd 5773 . . . . . . . . . . . 12 |- ( ( ( ( A C_ CC /\ B C_ CC ) /\ F : A --> B ) /\ ( x e. A /\ w e. A ) ) -> ( F ` w ) e. B )
149, 13sseldd 3225 . . . . . . . . . . 11 |- ( ( ( ( A C_ CC /\ B C_ CC ) /\ F : A --> B ) /\ ( x e. A /\ w e. A ) ) -> ( F ` w ) e. CC )
1512, 14abssubd 11720 . . . . . . . . . 10 |- ( ( ( ( A C_ CC /\ B C_ CC ) /\ F : A --> B ) /\ ( x e. A /\ w e. A ) ) -> ( abs ` ( ( F ` x ) - ( F ` w ) ) ) = ( abs ` ( ( F ` w ) - ( F ` x ) ) ) )
1615breq1d 4093 . . . . . . . . 9 |- ( ( ( ( A C_ CC /\ B C_ CC ) /\ F : A --> B ) /\ ( x e. A /\ w e. A ) ) -> ( ( abs ` ( ( F ` x ) - ( F ` w ) ) ) < y <-> ( abs ` ( ( F ` w ) - ( F ` x ) ) ) < y ) )
178, 16imbi12d 234 . . . . . . . 8 |- ( ( ( ( A C_ CC /\ B C_ CC ) /\ F : A --> B ) /\ ( x e. A /\ w e. A ) ) -> ( ( ( abs ` ( x - w ) ) < z -> ( abs ` ( ( F ` x ) - ( F ` w ) ) ) < y ) <-> ( ( abs ` ( w - x ) ) < z -> ( abs ` ( ( F ` w ) - ( F ` x ) ) ) < y ) ) )
1817anassrs 400 . . . . . . 7 |- ( ( ( ( ( A C_ CC /\ B C_ CC ) /\ F : A --> B ) /\ x e. A ) /\ w e. A ) -> ( ( ( abs ` ( x - w ) ) < z -> ( abs ` ( ( F ` x ) - ( F ` w ) ) ) < y ) <-> ( ( abs ` ( w - x ) ) < z -> ( abs ` ( ( F ` w ) - ( F ` x ) ) ) < y ) ) )
1918ralbidva 2526 . . . . . 6 |- ( ( ( ( A C_ CC /\ B C_ CC ) /\ F : A --> B ) /\ x e. A ) -> ( A. w e. A ( ( abs ` ( x - w ) ) < z -> ( abs ` ( ( F ` x ) - ( F ` w ) ) ) < y ) <-> A. w e. A ( ( abs ` ( w - x ) ) < z -> ( abs ` ( ( F ` w ) - ( F ` x ) ) ) < y ) ) )
2019rexbidv 2531 . . . . 5 |- ( ( ( ( A C_ CC /\ B C_ CC ) /\ F : A --> B ) /\ x e. A ) -> ( E. z e. RR+ A. w e. A ( ( abs ` ( x - w ) ) < z -> ( abs ` ( ( F ` x ) - ( F ` w ) ) ) < y ) <-> E. z e. RR+ A. w e. A ( ( abs ` ( w - x ) ) < z -> ( abs ` ( ( F ` w ) - ( F ` x ) ) ) < y ) ) )
2120ralbidv 2530 . . . 4 |- ( ( ( ( A C_ CC /\ B C_ CC ) /\ F : A --> B ) /\ x e. A ) -> ( A. y e. RR+ E. z e. RR+ A. w e. A ( ( abs ` ( x - w ) ) < z -> ( abs ` ( ( F ` x ) - ( F ` w ) ) ) < y ) <-> A. y e. RR+ E. z e. RR+ A. w e. A ( ( abs ` ( w - x ) ) < z -> ( abs ` ( ( F ` w ) - ( F ` x ) ) ) < y ) ) )
2221ralbidva 2526 . . 3 |- ( ( ( A C_ CC /\ B C_ CC ) /\ F : A --> B ) -> ( A. x e. A A. y e. RR+ E. z e. RR+ A. w e. A ( ( abs ` ( x - w ) ) < z -> ( abs ` ( ( F ` x ) - ( F ` w ) ) ) < y ) <-> A. x e. A A. y e. RR+ E. z e. RR+ A. w e. A ( ( abs ` ( w - x ) ) < z -> ( abs ` ( ( F ` w ) - ( F ` x ) ) ) < y ) ) )
2322pm5.32da 452 . 2 |- ( ( A C_ CC /\ B C_ CC ) -> ( ( F : A --> B /\ A. x e. A A. y e. RR+ E. z e. RR+ A. w e. A ( ( abs ` ( x - w ) ) < z -> ( abs ` ( ( F ` x ) - ( F ` w ) ) ) < y ) ) <-> ( F : A --> B /\ A. x e. A A. y e. RR+ E. z e. RR+ A. w e. A ( ( abs ` ( w - x ) ) < z -> ( abs ` ( ( F ` w ) - ( F ` x ) ) ) < y ) ) ) )
241, 23bitrd 188 1 |- ( ( A C_ CC /\ B C_ CC ) -> ( F e. ( A -cn-> B ) <-> ( F : A --> B /\ A. x e. A A. y e. RR+ E. z e. RR+ A. w e. A ( ( abs ` ( w - x ) ) < z -> ( abs ` ( ( F ` w ) - ( F ` x ) ) ) < y ) ) ) )
Colors of variables: wff set class
Syntax hints:   -> wi 4   /\ wa 104   <-> wb 105   e. wcel 2200   A.wral 2508   E.wrex 2509   C_ wss 3197   class class class wbr 4083   -->wf 5314   ` cfv 5318  (class class class)co 6007   CCcc 8008   < clt 8192   - cmin 8328   RR+crp 9861   abscabs 11524   -cn->ccncf 15260
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 617  ax-in2 618  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-13 2202  ax-14 2203  ax-ext 2211  ax-coll 4199  ax-sep 4202  ax-pow 4258  ax-pr 4293  ax-un 4524  ax-setind 4629  ax-cnex 8101  ax-resscn 8102  ax-1cn 8103  ax-1re 8104  ax-icn 8105  ax-addcl 8106  ax-addrcl 8107  ax-mulcl 8108  ax-mulrcl 8109  ax-addcom 8110  ax-mulcom 8111  ax-addass 8112  ax-mulass 8113  ax-distr 8114  ax-i2m1 8115  ax-0lt1 8116  ax-1rid 8117  ax-0id 8118  ax-rnegex 8119  ax-precex 8120  ax-cnre 8121  ax-pre-ltirr 8122  ax-pre-ltwlin 8123  ax-pre-lttrn 8124  ax-pre-apti 8125  ax-pre-ltadd 8126  ax-pre-mulgt0 8127  ax-pre-mulext 8128
This theorem depends on definitions:  df-bi 117  df-3an 1004  df-tru 1398  df-fal 1401  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ne 2401  df-nel 2496  df-ral 2513  df-rex 2514  df-reu 2515  df-rmo 2516  df-rab 2517  df-v 2801  df-sbc 3029  df-csb 3125  df-dif 3199  df-un 3201  df-in 3203  df-ss 3210  df-pw 3651  df-sn 3672  df-pr 3673  df-op 3675  df-uni 3889  df-iun 3967  df-br 4084  df-opab 4146  df-mpt 4147  df-id 4384  df-po 4387  df-iso 4388  df-xp 4725  df-rel 4726  df-cnv 4727  df-co 4728  df-dm 4729  df-rn 4730  df-res 4731  df-ima 4732  df-iota 5278  df-fun 5320  df-fn 5321  df-f 5322  df-f1 5323  df-fo 5324  df-f1o 5325  df-fv 5326  df-riota 5960  df-ov 6010  df-oprab 6011  df-mpo 6012  df-map 6805  df-pnf 8194  df-mnf 8195  df-xr 8196  df-ltxr 8197  df-le 8198  df-sub 8330  df-neg 8331  df-reap 8733  df-ap 8740  df-div 8831  df-2 9180  df-cj 11369  df-re 11370  df-im 11371  df-rsqrt 11525  df-abs 11526  df-cncf 15261
This theorem is referenced by:  cncfi  15268  cncfcdm  15272  abscncf  15275  recncf  15276  imcncf  15277  cjcncf  15278  mulc1cncf  15279  cncfco  15281  cdivcncfap  15294  mulcncf  15298
  Copyright terms: Public domain W3C validator