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

Theorem sbcfng 5335
Description: Distribute proper substitution through the function predicate with a domain. (Contributed by Alexander van der Vekens, 15-Jul-2018.)
Assertion
Ref Expression
sbcfng  |-  ( X  e.  V  ->  ( [. X  /  x ]. F  Fn  A  <->  [_ X  /  x ]_ F  Fn  [_ X  /  x ]_ A ) )
Distinct variable groups:    x, V    x, X
Allowed substitution hints:    A( x)    F( x)

Proof of Theorem sbcfng
StepHypRef Expression
1 df-fn 5191 . . . 4  |-  ( F  Fn  A  <->  ( Fun  F  /\  dom  F  =  A ) )
21a1i 9 . . 3  |-  ( X  e.  V  ->  ( F  Fn  A  <->  ( Fun  F  /\  dom  F  =  A ) ) )
32sbcbidv 3009 . 2  |-  ( X  e.  V  ->  ( [. X  /  x ]. F  Fn  A  <->  [. X  /  x ]. ( Fun  F  /\  dom  F  =  A ) ) )
4 sbcfung 5212 . . . 4  |-  ( X  e.  V  ->  ( [. X  /  x ]. Fun  F  <->  Fun  [_ X  /  x ]_ F ) )
5 sbceqg 3061 . . . . 5  |-  ( X  e.  V  ->  ( [. X  /  x ]. dom  F  =  A  <->  [_ X  /  x ]_ dom  F  =  [_ X  /  x ]_ A
) )
6 csbdmg 4798 . . . . . 6  |-  ( X  e.  V  ->  [_ X  /  x ]_ dom  F  =  dom  [_ X  /  x ]_ F )
76eqeq1d 2174 . . . . 5  |-  ( X  e.  V  ->  ( [_ X  /  x ]_ dom  F  =  [_ X  /  x ]_ A  <->  dom  [_ X  /  x ]_ F  =  [_ X  /  x ]_ A ) )
85, 7bitrd 187 . . . 4  |-  ( X  e.  V  ->  ( [. X  /  x ]. dom  F  =  A  <->  dom  [_ X  /  x ]_ F  =  [_ X  /  x ]_ A ) )
94, 8anbi12d 465 . . 3  |-  ( X  e.  V  ->  (
( [. X  /  x ]. Fun  F  /\  [. X  /  x ]. dom  F  =  A )  <->  ( Fun  [_ X  /  x ]_ F  /\  dom  [_ X  /  x ]_ F  = 
[_ X  /  x ]_ A ) ) )
10 sbcan 2993 . . 3  |-  ( [. X  /  x ]. ( Fun  F  /\  dom  F  =  A )  <->  ( [. X  /  x ]. Fun  F  /\  [. X  /  x ]. dom  F  =  A ) )
11 df-fn 5191 . . 3  |-  ( [_ X  /  x ]_ F  Fn  [_ X  /  x ]_ A  <->  ( Fun  [_ X  /  x ]_ F  /\  dom  [_ X  /  x ]_ F  =  [_ X  /  x ]_ A ) )
129, 10, 113bitr4g 222 . 2  |-  ( X  e.  V  ->  ( [. X  /  x ]. ( Fun  F  /\  dom  F  =  A )  <->  [_ X  /  x ]_ F  Fn  [_ X  /  x ]_ A ) )
133, 12bitrd 187 1  |-  ( X  e.  V  ->  ( [. X  /  x ]. F  Fn  A  <->  [_ X  /  x ]_ F  Fn  [_ X  /  x ]_ A ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 103    <-> wb 104    = wceq 1343    e. wcel 2136   [.wsbc 2951   [_csb 3045   dom cdm 4604   Fun wfun 5182    Fn wfn 5183
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 699  ax-5 1435  ax-7 1436  ax-gen 1437  ax-ie1 1481  ax-ie2 1482  ax-8 1492  ax-10 1493  ax-11 1494  ax-i12 1495  ax-bndl 1497  ax-4 1498  ax-17 1514  ax-i9 1518  ax-ial 1522  ax-i5r 1523  ax-14 2139  ax-ext 2147  ax-sep 4100  ax-pow 4153  ax-pr 4187
This theorem depends on definitions:  df-bi 116  df-3an 970  df-tru 1346  df-nf 1449  df-sb 1751  df-eu 2017  df-mo 2018  df-clab 2152  df-cleq 2158  df-clel 2161  df-nfc 2297  df-ral 2449  df-v 2728  df-sbc 2952  df-csb 3046  df-un 3120  df-in 3122  df-ss 3129  df-pw 3561  df-sn 3582  df-pr 3583  df-op 3585  df-br 3983  df-opab 4044  df-id 4271  df-rel 4611  df-cnv 4612  df-co 4613  df-dm 4614  df-fun 5190  df-fn 5191
This theorem is referenced by:  sbcfg  5336
  Copyright terms: Public domain W3C validator