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

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

Proof of Theorem fliftfuns
StepHypRef Expression
1 flift.1 . . 3  |-  F  =  ran  ( x  e.  X  |->  <. A ,  B >. )
2 nfcv 2386 . . . . 5  |-  F/_ y <. A ,  B >.
3 nfcsb1v 3174 . . . . . 6  |-  F/_ x [_ y  /  x ]_ A
4 nfcsb1v 3174 . . . . . 6  |-  F/_ x [_ y  /  x ]_ B
53, 4nfop 3904 . . . . 5  |-  F/_ x <. [_ y  /  x ]_ A ,  [_ y  /  x ]_ B >.
6 csbeq1a 3150 . . . . . 6  |-  ( x  =  y  ->  A  =  [_ y  /  x ]_ A )
7 csbeq1a 3150 . . . . . 6  |-  ( x  =  y  ->  B  =  [_ y  /  x ]_ B )
86, 7opeq12d 3896 . . . . 5  |-  ( x  =  y  ->  <. A ,  B >.  =  <. [_ y  /  x ]_ A ,  [_ y  /  x ]_ B >. )
92, 5, 8cbvmpt 4210 . . . 4  |-  ( x  e.  X  |->  <. A ,  B >. )  =  ( y  e.  X  |->  <. [_ y  /  x ]_ A ,  [_ y  /  x ]_ B >. )
109rneqi 4990 . . 3  |-  ran  (
x  e.  X  |->  <. A ,  B >. )  =  ran  ( y  e.  X  |->  <. [_ y  /  x ]_ A ,  [_ y  /  x ]_ B >. )
111, 10eqtri 2255 . 2  |-  F  =  ran  ( y  e.  X  |->  <. [_ y  /  x ]_ A ,  [_ y  /  x ]_ B >. )
12 flift.2 . . . 4  |-  ( (
ph  /\  x  e.  X )  ->  A  e.  R )
1312ralrimiva 2617 . . 3  |-  ( ph  ->  A. x  e.  X  A  e.  R )
143nfel1 2397 . . . 4  |-  F/ x [_ y  /  x ]_ A  e.  R
156eleq1d 2303 . . . 4  |-  ( x  =  y  ->  ( A  e.  R  <->  [_ y  /  x ]_ A  e.  R
) )
1614, 15rspc 2917 . . 3  |-  ( y  e.  X  ->  ( A. x  e.  X  A  e.  R  ->  [_ y  /  x ]_ A  e.  R )
)
1713, 16mpan9 281 . 2  |-  ( (
ph  /\  y  e.  X )  ->  [_ y  /  x ]_ A  e.  R )
18 flift.3 . . . 4  |-  ( (
ph  /\  x  e.  X )  ->  B  e.  S )
1918ralrimiva 2617 . . 3  |-  ( ph  ->  A. x  e.  X  B  e.  S )
204nfel1 2397 . . . 4  |-  F/ x [_ y  /  x ]_ B  e.  S
217eleq1d 2303 . . . 4  |-  ( x  =  y  ->  ( B  e.  S  <->  [_ y  /  x ]_ B  e.  S
) )
2220, 21rspc 2917 . . 3  |-  ( y  e.  X  ->  ( A. x  e.  X  B  e.  S  ->  [_ y  /  x ]_ B  e.  S )
)
2319, 22mpan9 281 . 2  |-  ( (
ph  /\  y  e.  X )  ->  [_ y  /  x ]_ B  e.  S )
24 csbeq1 3144 . 2  |-  ( y  =  z  ->  [_ y  /  x ]_ A  = 
[_ z  /  x ]_ A )
25 csbeq1 3144 . 2  |-  ( y  =  z  ->  [_ y  /  x ]_ B  = 
[_ z  /  x ]_ B )
2611, 17, 23, 24, 25fliftfun 5975 1  |-  ( ph  ->  ( Fun  F  <->  A. y  e.  X  A. z  e.  X  ( [_ y  /  x ]_ A  =  [_ z  /  x ]_ A  ->  [_ y  /  x ]_ B  = 
[_ z  /  x ]_ B ) ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105    = wceq 1398    e. wcel 2205   A.wral 2522   [_csb 3141   <.cop 3697    |-> cmpt 4176   ran crn 4755   Fun wfun 5351
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-14 2208  ax-ext 2216  ax-sep 4233  ax-pow 4292  ax-pr 4327
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1812  df-eu 2085  df-mo 2086  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ral 2527  df-rex 2528  df-rab 2531  df-v 2817  df-sbc 3046  df-csb 3142  df-un 3218  df-in 3220  df-ss 3227  df-pw 3676  df-sn 3700  df-pr 3701  df-op 3703  df-uni 3920  df-br 4115  df-opab 4177  df-mpt 4178  df-id 4419  df-xp 4760  df-rel 4761  df-cnv 4762  df-co 4763  df-dm 4764  df-rn 4765  df-res 4766  df-ima 4767  df-iota 5317  df-fun 5359  df-fn 5360  df-f 5361  df-fv 5365
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator