MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  kqfvima Structured version   Unicode version

Theorem kqfvima 19994
Description: When the image set is open, the quotient map satisfies a partial converse to fnfvima 6138, which is normally only true for injective functions. (Contributed by Mario Carneiro, 25-Aug-2015.)
Hypothesis
Ref Expression
kqval.2  |-  F  =  ( x  e.  X  |->  { y  e.  J  |  x  e.  y } )
Assertion
Ref Expression
kqfvima  |-  ( ( J  e.  (TopOn `  X )  /\  U  e.  J  /\  A  e.  X )  ->  ( A  e.  U  <->  ( F `  A )  e.  ( F " U ) ) )
Distinct variable groups:    x, y, A    x, J, y    x, X, y
Allowed substitution hints:    U( x, y)    F( x, y)

Proof of Theorem kqfvima
Dummy variables  w  z are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 kqval.2 . . . . 5  |-  F  =  ( x  e.  X  |->  { y  e.  J  |  x  e.  y } )
21kqffn 19989 . . . 4  |-  ( J  e.  (TopOn `  X
)  ->  F  Fn  X )
323ad2ant1 1017 . . 3  |-  ( ( J  e.  (TopOn `  X )  /\  U  e.  J  /\  A  e.  X )  ->  F  Fn  X )
4 toponss 19225 . . . 4  |-  ( ( J  e.  (TopOn `  X )  /\  U  e.  J )  ->  U  C_  X )
543adant3 1016 . . 3  |-  ( ( J  e.  (TopOn `  X )  /\  U  e.  J  /\  A  e.  X )  ->  U  C_  X )
6 fnfvima 6138 . . . 4  |-  ( ( F  Fn  X  /\  U  C_  X  /\  A  e.  U )  ->  ( F `  A )  e.  ( F " U
) )
763expia 1198 . . 3  |-  ( ( F  Fn  X  /\  U  C_  X )  -> 
( A  e.  U  ->  ( F `  A
)  e.  ( F
" U ) ) )
83, 5, 7syl2anc 661 . 2  |-  ( ( J  e.  (TopOn `  X )  /\  U  e.  J  /\  A  e.  X )  ->  ( A  e.  U  ->  ( F `  A )  e.  ( F " U ) ) )
9 fnfun 5678 . . . 4  |-  ( F  Fn  X  ->  Fun  F )
10 fvelima 5919 . . . . 5  |-  ( ( Fun  F  /\  ( F `  A )  e.  ( F " U
) )  ->  E. z  e.  U  ( F `  z )  =  ( F `  A ) )
1110ex 434 . . . 4  |-  ( Fun 
F  ->  ( ( F `  A )  e.  ( F " U
)  ->  E. z  e.  U  ( F `  z )  =  ( F `  A ) ) )
123, 9, 113syl 20 . . 3  |-  ( ( J  e.  (TopOn `  X )  /\  U  e.  J  /\  A  e.  X )  ->  (
( F `  A
)  e.  ( F
" U )  ->  E. z  e.  U  ( F `  z )  =  ( F `  A ) ) )
13 simpr 461 . . . . 5  |-  ( ( ( J  e.  (TopOn `  X )  /\  U  e.  J  /\  A  e.  X )  /\  z  e.  U )  ->  z  e.  U )
14 simpl1 999 . . . . . . . . 9  |-  ( ( ( J  e.  (TopOn `  X )  /\  U  e.  J  /\  A  e.  X )  /\  z  e.  U )  ->  J  e.  (TopOn `  X )
)
155sselda 3504 . . . . . . . . 9  |-  ( ( ( J  e.  (TopOn `  X )  /\  U  e.  J  /\  A  e.  X )  /\  z  e.  U )  ->  z  e.  X )
16 simpl3 1001 . . . . . . . . 9  |-  ( ( ( J  e.  (TopOn `  X )  /\  U  e.  J  /\  A  e.  X )  /\  z  e.  U )  ->  A  e.  X )
171kqfeq 19988 . . . . . . . . 9  |-  ( ( J  e.  (TopOn `  X )  /\  z  e.  X  /\  A  e.  X )  ->  (
( F `  z
)  =  ( F `
 A )  <->  A. y  e.  J  ( z  e.  y  <->  A  e.  y
) ) )
1814, 15, 16, 17syl3anc 1228 . . . . . . . 8  |-  ( ( ( J  e.  (TopOn `  X )  /\  U  e.  J  /\  A  e.  X )  /\  z  e.  U )  ->  (
( F `  z
)  =  ( F `
 A )  <->  A. y  e.  J  ( z  e.  y  <->  A  e.  y
) ) )
19 eleq2 2540 . . . . . . . . . 10  |-  ( y  =  w  ->  (
z  e.  y  <->  z  e.  w ) )
20 eleq2 2540 . . . . . . . . . 10  |-  ( y  =  w  ->  ( A  e.  y  <->  A  e.  w ) )
2119, 20bibi12d 321 . . . . . . . . 9  |-  ( y  =  w  ->  (
( z  e.  y  <-> 
A  e.  y )  <-> 
( z  e.  w  <->  A  e.  w ) ) )
2221cbvralv 3088 . . . . . . . 8  |-  ( A. y  e.  J  (
z  e.  y  <->  A  e.  y )  <->  A. w  e.  J  ( z  e.  w  <->  A  e.  w
) )
2318, 22syl6bb 261 . . . . . . 7  |-  ( ( ( J  e.  (TopOn `  X )  /\  U  e.  J  /\  A  e.  X )  /\  z  e.  U )  ->  (
( F `  z
)  =  ( F `
 A )  <->  A. w  e.  J  ( z  e.  w  <->  A  e.  w
) ) )
24 simpl2 1000 . . . . . . . 8  |-  ( ( ( J  e.  (TopOn `  X )  /\  U  e.  J  /\  A  e.  X )  /\  z  e.  U )  ->  U  e.  J )
25 eleq2 2540 . . . . . . . . . 10  |-  ( w  =  U  ->  (
z  e.  w  <->  z  e.  U ) )
26 eleq2 2540 . . . . . . . . . 10  |-  ( w  =  U  ->  ( A  e.  w  <->  A  e.  U ) )
2725, 26bibi12d 321 . . . . . . . . 9  |-  ( w  =  U  ->  (
( z  e.  w  <->  A  e.  w )  <->  ( z  e.  U  <->  A  e.  U
) ) )
2827rspcv 3210 . . . . . . . 8  |-  ( U  e.  J  ->  ( A. w  e.  J  ( z  e.  w  <->  A  e.  w )  -> 
( z  e.  U  <->  A  e.  U ) ) )
2924, 28syl 16 . . . . . . 7  |-  ( ( ( J  e.  (TopOn `  X )  /\  U  e.  J  /\  A  e.  X )  /\  z  e.  U )  ->  ( A. w  e.  J  ( z  e.  w  <->  A  e.  w )  -> 
( z  e.  U  <->  A  e.  U ) ) )
3023, 29sylbid 215 . . . . . 6  |-  ( ( ( J  e.  (TopOn `  X )  /\  U  e.  J  /\  A  e.  X )  /\  z  e.  U )  ->  (
( F `  z
)  =  ( F `
 A )  -> 
( z  e.  U  <->  A  e.  U ) ) )
31 bi1 186 . . . . . 6  |-  ( ( z  e.  U  <->  A  e.  U )  ->  (
z  e.  U  ->  A  e.  U )
)
3230, 31syl6 33 . . . . 5  |-  ( ( ( J  e.  (TopOn `  X )  /\  U  e.  J  /\  A  e.  X )  /\  z  e.  U )  ->  (
( F `  z
)  =  ( F `
 A )  -> 
( z  e.  U  ->  A  e.  U ) ) )
3313, 32mpid 41 . . . 4  |-  ( ( ( J  e.  (TopOn `  X )  /\  U  e.  J  /\  A  e.  X )  /\  z  e.  U )  ->  (
( F `  z
)  =  ( F `
 A )  ->  A  e.  U )
)
3433rexlimdva 2955 . . 3  |-  ( ( J  e.  (TopOn `  X )  /\  U  e.  J  /\  A  e.  X )  ->  ( E. z  e.  U  ( F `  z )  =  ( F `  A )  ->  A  e.  U ) )
3512, 34syld 44 . 2  |-  ( ( J  e.  (TopOn `  X )  /\  U  e.  J  /\  A  e.  X )  ->  (
( F `  A
)  e.  ( F
" U )  ->  A  e.  U )
)
368, 35impbid 191 1  |-  ( ( J  e.  (TopOn `  X )  /\  U  e.  J  /\  A  e.  X )  ->  ( A  e.  U  <->  ( F `  A )  e.  ( F " U ) ) )
Colors of variables: wff setvar class
Syntax hints:    -> wi 4    <-> wb 184    /\ wa 369    /\ w3a 973    = wceq 1379    e. wcel 1767   A.wral 2814   E.wrex 2815   {crab 2818    C_ wss 3476    |-> cmpt 4505   "cima 5002   Fun wfun 5582    Fn wfn 5583   ` cfv 5588  TopOnctopon 19190
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1601  ax-4 1612  ax-5 1680  ax-6 1719  ax-7 1739  ax-8 1769  ax-9 1771  ax-10 1786  ax-11 1791  ax-12 1803  ax-13 1968  ax-ext 2445  ax-sep 4568  ax-nul 4576  ax-pow 4625  ax-pr 4686  ax-un 6576
This theorem depends on definitions:  df-bi 185  df-or 370  df-an 371  df-3an 975  df-tru 1382  df-ex 1597  df-nf 1600  df-sb 1712  df-eu 2279  df-mo 2280  df-clab 2453  df-cleq 2459  df-clel 2462  df-nfc 2617  df-ne 2664  df-ral 2819  df-rex 2820  df-rab 2823  df-v 3115  df-sbc 3332  df-dif 3479  df-un 3481  df-in 3483  df-ss 3490  df-nul 3786  df-if 3940  df-pw 4012  df-sn 4028  df-pr 4030  df-op 4034  df-uni 4246  df-br 4448  df-opab 4506  df-mpt 4507  df-id 4795  df-xp 5005  df-rel 5006  df-cnv 5007  df-co 5008  df-dm 5009  df-rn 5010  df-res 5011  df-ima 5012  df-iota 5551  df-fun 5590  df-fn 5591  df-f 5592  df-fv 5596  df-topon 19197
This theorem is referenced by:  kqsat  19995  kqdisj  19996  kqcldsat  19997  kqt0lem  20000  isr0  20001  regr1lem  20003  kqreglem1  20005  kqreglem2  20006
  Copyright terms: Public domain W3C validator