ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  fliftf Unicode version

Theorem fliftf 5868
Description: The domain and range of the function  F. (Contributed by Mario Carneiro, 23-Dec-2016.)
Hypotheses
Ref Expression
flift.1  |-  F  =  ran  ( x  e.  X  |->  <. A ,  B >. )
flift.2  |-  ( (
ph  /\  x  e.  X )  ->  A  e.  R )
flift.3  |-  ( (
ph  /\  x  e.  X )  ->  B  e.  S )
Assertion
Ref Expression
fliftf  |-  ( ph  ->  ( Fun  F  <->  F : ran  ( x  e.  X  |->  A ) --> S ) )
Distinct variable groups:    x, R    ph, x    x, X    x, S
Allowed substitution hints:    A( x)    B( x)    F( x)

Proof of Theorem fliftf
Dummy variables  y  z are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 simpr 110 . . . . 5  |-  ( (
ph  /\  Fun  F )  ->  Fun  F )
2 flift.1 . . . . . . . . . . 11  |-  F  =  ran  ( x  e.  X  |->  <. A ,  B >. )
3 flift.2 . . . . . . . . . . 11  |-  ( (
ph  /\  x  e.  X )  ->  A  e.  R )
4 flift.3 . . . . . . . . . . 11  |-  ( (
ph  /\  x  e.  X )  ->  B  e.  S )
52, 3, 4fliftel 5862 . . . . . . . . . 10  |-  ( ph  ->  ( y F z  <->  E. x  e.  X  ( y  =  A  /\  z  =  B ) ) )
65exbidv 1848 . . . . . . . . 9  |-  ( ph  ->  ( E. z  y F z  <->  E. z E. x  e.  X  ( y  =  A  /\  z  =  B ) ) )
76adantr 276 . . . . . . . 8  |-  ( (
ph  /\  Fun  F )  ->  ( E. z 
y F z  <->  E. z E. x  e.  X  ( y  =  A  /\  z  =  B ) ) )
8 rexcom4 2795 . . . . . . . . 9  |-  ( E. x  e.  X  E. z ( y  =  A  /\  z  =  B )  <->  E. z E. x  e.  X  ( y  =  A  /\  z  =  B ) )
9 19.42v 1930 . . . . . . . . . . . 12  |-  ( E. z ( y  =  A  /\  z  =  B )  <->  ( y  =  A  /\  E. z 
z  =  B ) )
10 elisset 2786 . . . . . . . . . . . . . 14  |-  ( B  e.  S  ->  E. z 
z  =  B )
114, 10syl 14 . . . . . . . . . . . . 13  |-  ( (
ph  /\  x  e.  X )  ->  E. z 
z  =  B )
1211biantrud 304 . . . . . . . . . . . 12  |-  ( (
ph  /\  x  e.  X )  ->  (
y  =  A  <->  ( y  =  A  /\  E. z 
z  =  B ) ) )
139, 12bitr4id 199 . . . . . . . . . . 11  |-  ( (
ph  /\  x  e.  X )  ->  ( E. z ( y  =  A  /\  z  =  B )  <->  y  =  A ) )
1413rexbidva 2503 . . . . . . . . . 10  |-  ( ph  ->  ( E. x  e.  X  E. z ( y  =  A  /\  z  =  B )  <->  E. x  e.  X  y  =  A ) )
1514adantr 276 . . . . . . . . 9  |-  ( (
ph  /\  Fun  F )  ->  ( E. x  e.  X  E. z
( y  =  A  /\  z  =  B )  <->  E. x  e.  X  y  =  A )
)
168, 15bitr3id 194 . . . . . . . 8  |-  ( (
ph  /\  Fun  F )  ->  ( E. z E. x  e.  X  ( y  =  A  /\  z  =  B )  <->  E. x  e.  X  y  =  A )
)
177, 16bitrd 188 . . . . . . 7  |-  ( (
ph  /\  Fun  F )  ->  ( E. z 
y F z  <->  E. x  e.  X  y  =  A ) )
1817abbidv 2323 . . . . . 6  |-  ( (
ph  /\  Fun  F )  ->  { y  |  E. z  y F z }  =  {
y  |  E. x  e.  X  y  =  A } )
19 df-dm 4685 . . . . . 6  |-  dom  F  =  { y  |  E. z  y F z }
20 eqid 2205 . . . . . . 7  |-  ( x  e.  X  |->  A )  =  ( x  e.  X  |->  A )
2120rnmpt 4926 . . . . . 6  |-  ran  (
x  e.  X  |->  A )  =  { y  |  E. x  e.  X  y  =  A }
2218, 19, 213eqtr4g 2263 . . . . 5  |-  ( (
ph  /\  Fun  F )  ->  dom  F  =  ran  ( x  e.  X  |->  A ) )
23 df-fn 5274 . . . . 5  |-  ( F  Fn  ran  ( x  e.  X  |->  A )  <-> 
( Fun  F  /\  dom  F  =  ran  (
x  e.  X  |->  A ) ) )
241, 22, 23sylanbrc 417 . . . 4  |-  ( (
ph  /\  Fun  F )  ->  F  Fn  ran  ( x  e.  X  |->  A ) )
252, 3, 4fliftrel 5861 . . . . . . 7  |-  ( ph  ->  F  C_  ( R  X.  S ) )
2625adantr 276 . . . . . 6  |-  ( (
ph  /\  Fun  F )  ->  F  C_  ( R  X.  S ) )
27 rnss 4908 . . . . . 6  |-  ( F 
C_  ( R  X.  S )  ->  ran  F 
C_  ran  ( R  X.  S ) )
2826, 27syl 14 . . . . 5  |-  ( (
ph  /\  Fun  F )  ->  ran  F  C_  ran  ( R  X.  S
) )
29 rnxpss 5114 . . . . 5  |-  ran  ( R  X.  S )  C_  S
3028, 29sstrdi 3205 . . . 4  |-  ( (
ph  /\  Fun  F )  ->  ran  F  C_  S
)
31 df-f 5275 . . . 4  |-  ( F : ran  ( x  e.  X  |->  A ) --> S  <->  ( F  Fn  ran  ( x  e.  X  |->  A )  /\  ran  F 
C_  S ) )
3224, 30, 31sylanbrc 417 . . 3  |-  ( (
ph  /\  Fun  F )  ->  F : ran  ( x  e.  X  |->  A ) --> S )
3332ex 115 . 2  |-  ( ph  ->  ( Fun  F  ->  F : ran  ( x  e.  X  |->  A ) --> S ) )
34 ffun 5428 . 2  |-  ( F : ran  ( x  e.  X  |->  A ) --> S  ->  Fun  F )
3533, 34impbid1 142 1  |-  ( ph  ->  ( Fun  F  <->  F : ran  ( x  e.  X  |->  A ) --> S ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105    = wceq 1373   E.wex 1515    e. wcel 2176   {cab 2191   E.wrex 2485    C_ wss 3166   <.cop 3636   class class class wbr 4044    |-> cmpt 4105    X. cxp 4673   dom cdm 4675   ran crn 4676   Fun wfun 5265    Fn wfn 5266   -->wf 5267
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-io 711  ax-5 1470  ax-7 1471  ax-gen 1472  ax-ie1 1516  ax-ie2 1517  ax-8 1527  ax-10 1528  ax-11 1529  ax-i12 1530  ax-bndl 1532  ax-4 1533  ax-17 1549  ax-i9 1553  ax-ial 1557  ax-i5r 1558  ax-14 2179  ax-ext 2187  ax-sep 4162  ax-pow 4218  ax-pr 4253
This theorem depends on definitions:  df-bi 117  df-3an 983  df-tru 1376  df-nf 1484  df-sb 1786  df-eu 2057  df-mo 2058  df-clab 2192  df-cleq 2198  df-clel 2201  df-nfc 2337  df-ral 2489  df-rex 2490  df-rab 2493  df-v 2774  df-sbc 2999  df-un 3170  df-in 3172  df-ss 3179  df-pw 3618  df-sn 3639  df-pr 3640  df-op 3642  df-uni 3851  df-br 4045  df-opab 4106  df-mpt 4107  df-id 4340  df-xp 4681  df-rel 4682  df-cnv 4683  df-co 4684  df-dm 4685  df-rn 4686  df-res 4687  df-ima 4688  df-iota 5232  df-fun 5273  df-fn 5274  df-f 5275  df-fv 5279
This theorem is referenced by:  qliftf  6707
  Copyright terms: Public domain W3C validator