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

Theorem fliftfuns 5438
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 2178 . . . . 5  |-  F/_ y <. A ,  B >.
3 nfcsb1v 2882 . . . . . 6  |-  F/_ x [_ y  /  x ]_ A
4 nfcsb1v 2882 . . . . . 6  |-  F/_ x [_ y  /  x ]_ B
53, 4nfop 3565 . . . . 5  |-  F/_ x <. [_ y  /  x ]_ A ,  [_ y  /  x ]_ B >.
6 csbeq1a 2860 . . . . . 6  |-  ( x  =  y  ->  A  =  [_ y  /  x ]_ A )
7 csbeq1a 2860 . . . . . 6  |-  ( x  =  y  ->  B  =  [_ y  /  x ]_ B )
86, 7opeq12d 3557 . . . . 5  |-  ( x  =  y  ->  <. A ,  B >.  =  <. [_ y  /  x ]_ A ,  [_ y  /  x ]_ B >. )
92, 5, 8cbvmpt 3851 . . . 4  |-  ( x  e.  X  |->  <. A ,  B >. )  =  ( y  e.  X  |->  <. [_ y  /  x ]_ A ,  [_ y  /  x ]_ B >. )
109rneqi 4562 . . 3  |-  ran  (
x  e.  X  |->  <. A ,  B >. )  =  ran  ( y  e.  X  |->  <. [_ y  /  x ]_ A ,  [_ y  /  x ]_ B >. )
111, 10eqtri 2060 . 2  |-  F  =  ran  ( y  e.  X  |->  <. [_ y  /  x ]_ A ,  [_ y  /  x ]_ B >. )
12 flift.2 . . . 4  |-  ( (
ph  /\  x  e.  X )  ->  A  e.  R )
1312ralrimiva 2392 . . 3  |-  ( ph  ->  A. x  e.  X  A  e.  R )
143nfel1 2188 . . . 4  |-  F/ x [_ y  /  x ]_ A  e.  R
156eleq1d 2106 . . . 4  |-  ( x  =  y  ->  ( A  e.  R  <->  [_ y  /  x ]_ A  e.  R
) )
1614, 15rspc 2650 . . 3  |-  ( y  e.  X  ->  ( A. x  e.  X  A  e.  R  ->  [_ y  /  x ]_ A  e.  R )
)
1713, 16mpan9 265 . 2  |-  ( (
ph  /\  y  e.  X )  ->  [_ y  /  x ]_ A  e.  R )
18 flift.3 . . . 4  |-  ( (
ph  /\  x  e.  X )  ->  B  e.  S )
1918ralrimiva 2392 . . 3  |-  ( ph  ->  A. x  e.  X  B  e.  S )
204nfel1 2188 . . . 4  |-  F/ x [_ y  /  x ]_ B  e.  S
217eleq1d 2106 . . . 4  |-  ( x  =  y  ->  ( B  e.  S  <->  [_ y  /  x ]_ B  e.  S
) )
2220, 21rspc 2650 . . 3  |-  ( y  e.  X  ->  ( A. x  e.  X  B  e.  S  ->  [_ y  /  x ]_ B  e.  S )
)
2319, 22mpan9 265 . 2  |-  ( (
ph  /\  y  e.  X )  ->  [_ y  /  x ]_ B  e.  S )
24 csbeq1 2855 . 2  |-  ( y  =  z  ->  [_ y  /  x ]_ A  = 
[_ z  /  x ]_ A )
25 csbeq1 2855 . 2  |-  ( y  =  z  ->  [_ y  /  x ]_ B  = 
[_ z  /  x ]_ B )
2611, 17, 23, 24, 25fliftfun 5436 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 97    <-> wb 98    = wceq 1243    e. wcel 1393   A.wral 2306   [_csb 2852   <.cop 3378    |-> cmpt 3818   ran crn 4346   Fun wfun 4896
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 99  ax-ia2 100  ax-ia3 101  ax-io 630  ax-5 1336  ax-7 1337  ax-gen 1338  ax-ie1 1382  ax-ie2 1383  ax-8 1395  ax-10 1396  ax-11 1397  ax-i12 1398  ax-bndl 1399  ax-4 1400  ax-14 1405  ax-17 1419  ax-i9 1423  ax-ial 1427  ax-i5r 1428  ax-ext 2022  ax-sep 3875  ax-pow 3927  ax-pr 3944
This theorem depends on definitions:  df-bi 110  df-3an 887  df-tru 1246  df-nf 1350  df-sb 1646  df-eu 1903  df-mo 1904  df-clab 2027  df-cleq 2033  df-clel 2036  df-nfc 2167  df-ral 2311  df-rex 2312  df-rab 2315  df-v 2559  df-sbc 2765  df-csb 2853  df-un 2922  df-in 2924  df-ss 2931  df-pw 3361  df-sn 3381  df-pr 3382  df-op 3384  df-uni 3581  df-br 3765  df-opab 3819  df-mpt 3820  df-id 4030  df-xp 4351  df-rel 4352  df-cnv 4353  df-co 4354  df-dm 4355  df-rn 4356  df-res 4357  df-ima 4358  df-iota 4867  df-fun 4904  df-fn 4905  df-f 4906  df-fv 4910
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator