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

Theorem qliftfuns 6853
Description: The function  F is the unique function defined by  F `  [
x ]  =  A, provided that the well-definedness condition holds. (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
qliftfuns  |-  ( ph  ->  ( Fun  F  <->  A. y A. z ( y R z  ->  [_ y  /  x ]_ A  =  [_ z  /  x ]_ A
) ) )
Distinct variable groups:    y, z, A   
x, y, z, ph    x, R, y, z    y, F, z    x, X, y, z    x, Y, y, z
Allowed substitution hints:    A( x)    F( x)

Proof of Theorem qliftfuns
StepHypRef Expression
1 qlift.1 . . 3  |-  F  =  ran  ( x  e.  X  |->  <. [ x ] R ,  A >. )
2 nfcv 2384 . . . . 5  |-  F/_ y <. [ x ] R ,  A >.
3 nfcv 2384 . . . . . 6  |-  F/_ x [ y ] R
4 nfcsb1v 3171 . . . . . 6  |-  F/_ x [_ y  /  x ]_ A
53, 4nfop 3899 . . . . 5  |-  F/_ x <. [ y ] R ,  [_ y  /  x ]_ A >.
6 eceq1 6802 . . . . . 6  |-  ( x  =  y  ->  [ x ] R  =  [
y ] R )
7 csbeq1a 3147 . . . . . 6  |-  ( x  =  y  ->  A  =  [_ y  /  x ]_ A )
86, 7opeq12d 3891 . . . . 5  |-  ( x  =  y  ->  <. [ x ] R ,  A >.  = 
<. [ y ] R ,  [_ y  /  x ]_ A >. )
92, 5, 8cbvmpt 4205 . . . 4  |-  ( x  e.  X  |->  <. [ x ] R ,  A >. )  =  ( y  e.  X  |->  <. [ y ] R ,  [_ y  /  x ]_ A >. )
109rneqi 4985 . . 3  |-  ran  (
x  e.  X  |->  <. [ x ] R ,  A >. )  =  ran  ( y  e.  X  |-> 
<. [ y ] R ,  [_ y  /  x ]_ A >. )
111, 10eqtri 2253 . 2  |-  F  =  ran  ( y  e.  X  |->  <. [ y ] R ,  [_ y  /  x ]_ A >. )
12 qlift.2 . . . 4  |-  ( (
ph  /\  x  e.  X )  ->  A  e.  Y )
1312ralrimiva 2615 . . 3  |-  ( ph  ->  A. x  e.  X  A  e.  Y )
144nfel1 2395 . . . 4  |-  F/ x [_ y  /  x ]_ A  e.  Y
157eleq1d 2301 . . . 4  |-  ( x  =  y  ->  ( A  e.  Y  <->  [_ y  /  x ]_ A  e.  Y
) )
1614, 15rspc 2915 . . 3  |-  ( y  e.  X  ->  ( A. x  e.  X  A  e.  Y  ->  [_ y  /  x ]_ A  e.  Y )
)
1713, 16mpan9 281 . 2  |-  ( (
ph  /\  y  e.  X )  ->  [_ y  /  x ]_ A  e.  Y )
18 qlift.3 . 2  |-  ( ph  ->  R  Er  X )
19 qlift.4 . 2  |-  ( ph  ->  X  e.  _V )
20 csbeq1 3141 . 2  |-  ( y  =  z  ->  [_ y  /  x ]_ A  = 
[_ z  /  x ]_ A )
2111, 17, 18, 19, 20qliftfun 6851 1  |-  ( ph  ->  ( Fun  F  <->  A. y A. z ( y R z  ->  [_ y  /  x ]_ A  =  [_ z  /  x ]_ A
) ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105   A.wal 1396    = wceq 1398    e. wcel 2203   A.wral 2520   _Vcvv 2813   [_csb 3138   <.cop 3692   class class class wbr 4109    |-> cmpt 4171   ran crn 4750   Fun wfun 5346    Er wer 6764   [cec 6765
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 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2205  ax-14 2206  ax-ext 2214  ax-sep 4228  ax-pow 4287  ax-pr 4322  ax-un 4554
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1812  df-eu 2083  df-mo 2084  df-clab 2219  df-cleq 2225  df-clel 2228  df-nfc 2373  df-ral 2525  df-rex 2526  df-rab 2529  df-v 2815  df-sbc 3043  df-csb 3139  df-un 3215  df-in 3217  df-ss 3224  df-pw 3671  df-sn 3695  df-pr 3696  df-op 3698  df-uni 3915  df-br 4110  df-opab 4172  df-mpt 4173  df-id 4414  df-xp 4755  df-rel 4756  df-cnv 4757  df-co 4758  df-dm 4759  df-rn 4760  df-res 4761  df-ima 4762  df-iota 5312  df-fun 5354  df-fn 5355  df-f 5356  df-fv 5360  df-er 6767  df-ec 6769  df-qs 6773
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator