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

Theorem qliftf 6894
Description: The domain and codomain of the function  F. (Contributed by Mario Carneiro, 23-Dec-2016.)
Hypotheses
Ref Expression
qlift.1  |-  F  =  ran  ( x  e.  X  |->  <. [ x ] R ,  A >. )
qlift.2  |-  ( (
ph  /\  x  e.  X )  ->  A  e.  Y )
qlift.3  |-  ( ph  ->  R  Er  X )
qlift.4  |-  ( ph  ->  X  e.  _V )
Assertion
Ref Expression
qliftf  |-  ( ph  ->  ( Fun  F  <->  F :
( X /. R
) --> Y ) )
Distinct variable groups:    ph, x    x, R    x, X    x, Y
Allowed substitution hints:    A( x)    F( x)

Proof of Theorem qliftf
Dummy variable  y is distinct from all other variables.
StepHypRef Expression
1 qlift.1 . . 3  |-  F  =  ran  ( x  e.  X  |->  <. [ x ] R ,  A >. )
2 qlift.2 . . . 4  |-  ( (
ph  /\  x  e.  X )  ->  A  e.  Y )
3 qlift.3 . . . 4  |-  ( ph  ->  R  Er  X )
4 qlift.4 . . . 4  |-  ( ph  ->  X  e.  _V )
51, 2, 3, 4qliftlem 6887 . . 3  |-  ( (
ph  /\  x  e.  X )  ->  [ x ] R  e.  ( X /. R ) )
61, 5, 2fliftf 6005 . 2  |-  ( ph  ->  ( Fun  F  <->  F : ran  ( x  e.  X  |->  [ x ] R
) --> Y ) )
7 df-qs 6813 . . . . 5  |-  ( X /. R )  =  { y  |  E. x  e.  X  y  =  [ x ] R }
8 eqid 2238 . . . . . 6  |-  ( x  e.  X  |->  [ x ] R )  =  ( x  e.  X  |->  [ x ] R )
98rnmpt 5030 . . . . 5  |-  ran  (
x  e.  X  |->  [ x ] R )  =  { y  |  E. x  e.  X  y  =  [ x ] R }
107, 9eqtr4i 2262 . . . 4  |-  ( X /. R )  =  ran  ( x  e.  X  |->  [ x ] R )
1110a1i 9 . . 3  |-  ( ph  ->  ( X /. R
)  =  ran  (
x  e.  X  |->  [ x ] R ) )
1211feq2d 5521 . 2  |-  ( ph  ->  ( F : ( X /. R ) --> Y  <->  F : ran  (
x  e.  X  |->  [ x ] R ) --> Y ) )
136, 12bitr4d 191 1  |-  ( ph  ->  ( Fun  F  <->  F :
( X /. R
) --> Y ) )
Colors of variables:    wff set class
This proof depends on syntax axioms:    -> wi 4    /\ wa 104    <-> wb 105    = wceq 1402    e. wcel 2209   {cab 2224   E.wrex 2529   _Vcvv 2821   <.cop 3712    |-> cmpt 4192   ran crn 4775   Fun wfun 5371   -->wf 5373    Er wer 6804   [cec 6805   /.cqs 6806
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4249  ax-pow 4311  ax-pr 4346  ax-un 4578
This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-rex 2534  df-rab 2537  df-v 2823  df-sbc 3052  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-br 4131  df-opab 4193  df-mpt 4194  df-id 4438  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-ima 4787  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-fv 5385  df-er 6807  df-ec 6809  df-qs 6813
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator