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

Theorem sbcfg 5266
Description: Distribute proper substitution through the function predicate with domain and codomain. (Contributed by Alexander van der Vekens, 15-Jul-2018.)
Assertion
Ref Expression
sbcfg (𝑋𝑉 → ([𝑋 / 𝑥]𝐹:𝐴𝐵𝑋 / 𝑥𝐹:𝑋 / 𝑥𝐴𝑋 / 𝑥𝐵))
Distinct variable groups:   𝑥,𝑉   𝑥,𝑋
Allowed substitution hints:   𝐴(𝑥)   𝐵(𝑥)   𝐹(𝑥)

Proof of Theorem sbcfg
StepHypRef Expression
1 df-f 5122 . . . 4 (𝐹:𝐴𝐵 ↔ (𝐹 Fn 𝐴 ∧ ran 𝐹𝐵))
21a1i 9 . . 3 (𝑋𝑉 → (𝐹:𝐴𝐵 ↔ (𝐹 Fn 𝐴 ∧ ran 𝐹𝐵)))
32sbcbidv 2962 . 2 (𝑋𝑉 → ([𝑋 / 𝑥]𝐹:𝐴𝐵[𝑋 / 𝑥](𝐹 Fn 𝐴 ∧ ran 𝐹𝐵)))
4 sbcfng 5265 . . . 4 (𝑋𝑉 → ([𝑋 / 𝑥]𝐹 Fn 𝐴𝑋 / 𝑥𝐹 Fn 𝑋 / 𝑥𝐴))
5 sbcssg 3467 . . . . 5 (𝑋𝑉 → ([𝑋 / 𝑥]ran 𝐹𝐵𝑋 / 𝑥ran 𝐹𝑋 / 𝑥𝐵))
6 csbrng 4995 . . . . . 6 (𝑋𝑉𝑋 / 𝑥ran 𝐹 = ran 𝑋 / 𝑥𝐹)
76sseq1d 3121 . . . . 5 (𝑋𝑉 → (𝑋 / 𝑥ran 𝐹𝑋 / 𝑥𝐵 ↔ ran 𝑋 / 𝑥𝐹𝑋 / 𝑥𝐵))
85, 7bitrd 187 . . . 4 (𝑋𝑉 → ([𝑋 / 𝑥]ran 𝐹𝐵 ↔ ran 𝑋 / 𝑥𝐹𝑋 / 𝑥𝐵))
94, 8anbi12d 464 . . 3 (𝑋𝑉 → (([𝑋 / 𝑥]𝐹 Fn 𝐴[𝑋 / 𝑥]ran 𝐹𝐵) ↔ (𝑋 / 𝑥𝐹 Fn 𝑋 / 𝑥𝐴 ∧ ran 𝑋 / 𝑥𝐹𝑋 / 𝑥𝐵)))
10 sbcan 2946 . . 3 ([𝑋 / 𝑥](𝐹 Fn 𝐴 ∧ ran 𝐹𝐵) ↔ ([𝑋 / 𝑥]𝐹 Fn 𝐴[𝑋 / 𝑥]ran 𝐹𝐵))
11 df-f 5122 . . 3 (𝑋 / 𝑥𝐹:𝑋 / 𝑥𝐴𝑋 / 𝑥𝐵 ↔ (𝑋 / 𝑥𝐹 Fn 𝑋 / 𝑥𝐴 ∧ ran 𝑋 / 𝑥𝐹𝑋 / 𝑥𝐵))
129, 10, 113bitr4g 222 . 2 (𝑋𝑉 → ([𝑋 / 𝑥](𝐹 Fn 𝐴 ∧ ran 𝐹𝐵) ↔ 𝑋 / 𝑥𝐹:𝑋 / 𝑥𝐴𝑋 / 𝑥𝐵))
133, 12bitrd 187 1 (𝑋𝑉 → ([𝑋 / 𝑥]𝐹:𝐴𝐵𝑋 / 𝑥𝐹:𝑋 / 𝑥𝐴𝑋 / 𝑥𝐵))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 103  wb 104  wcel 1480  [wsbc 2904  csb 2998  wss 3066  ran crn 4535   Fn wfn 5113  wf 5114
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 698  ax-5 1423  ax-7 1424  ax-gen 1425  ax-ie1 1469  ax-ie2 1470  ax-8 1482  ax-10 1483  ax-11 1484  ax-i12 1485  ax-bndl 1486  ax-4 1487  ax-14 1492  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-ext 2119  ax-sep 4041  ax-pow 4093  ax-pr 4126
This theorem depends on definitions:  df-bi 116  df-3an 964  df-tru 1334  df-nf 1437  df-sb 1736  df-eu 2000  df-mo 2001  df-clab 2124  df-cleq 2130  df-clel 2133  df-nfc 2268  df-ral 2419  df-v 2683  df-sbc 2905  df-csb 2999  df-un 3070  df-in 3072  df-ss 3079  df-pw 3507  df-sn 3528  df-pr 3529  df-op 3531  df-br 3925  df-opab 3985  df-id 4210  df-rel 4541  df-cnv 4542  df-co 4543  df-dm 4544  df-rn 4545  df-fun 5120  df-fn 5121  df-f 5122
This theorem is referenced by:  ctiunctlemf  11940
  Copyright terms: Public domain W3C validator