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

Theorem sbcfg 5363
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 5219 . . . 4 (𝐹:𝐴𝐵 ↔ (𝐹 Fn 𝐴 ∧ ran 𝐹𝐵))
21a1i 9 . . 3 (𝑋𝑉 → (𝐹:𝐴𝐵 ↔ (𝐹 Fn 𝐴 ∧ ran 𝐹𝐵)))
32sbcbidv 3021 . 2 (𝑋𝑉 → ([𝑋 / 𝑥]𝐹:𝐴𝐵[𝑋 / 𝑥](𝐹 Fn 𝐴 ∧ ran 𝐹𝐵)))
4 sbcfng 5362 . . . 4 (𝑋𝑉 → ([𝑋 / 𝑥]𝐹 Fn 𝐴𝑋 / 𝑥𝐹 Fn 𝑋 / 𝑥𝐴))
5 sbcssg 3532 . . . . 5 (𝑋𝑉 → ([𝑋 / 𝑥]ran 𝐹𝐵𝑋 / 𝑥ran 𝐹𝑋 / 𝑥𝐵))
6 csbrng 5089 . . . . . 6 (𝑋𝑉𝑋 / 𝑥ran 𝐹 = ran 𝑋 / 𝑥𝐹)
76sseq1d 3184 . . . . 5 (𝑋𝑉 → (𝑋 / 𝑥ran 𝐹𝑋 / 𝑥𝐵 ↔ ran 𝑋 / 𝑥𝐹𝑋 / 𝑥𝐵))
85, 7bitrd 188 . . . 4 (𝑋𝑉 → ([𝑋 / 𝑥]ran 𝐹𝐵 ↔ ran 𝑋 / 𝑥𝐹𝑋 / 𝑥𝐵))
94, 8anbi12d 473 . . 3 (𝑋𝑉 → (([𝑋 / 𝑥]𝐹 Fn 𝐴[𝑋 / 𝑥]ran 𝐹𝐵) ↔ (𝑋 / 𝑥𝐹 Fn 𝑋 / 𝑥𝐴 ∧ ran 𝑋 / 𝑥𝐹𝑋 / 𝑥𝐵)))
10 sbcan 3005 . . 3 ([𝑋 / 𝑥](𝐹 Fn 𝐴 ∧ ran 𝐹𝐵) ↔ ([𝑋 / 𝑥]𝐹 Fn 𝐴[𝑋 / 𝑥]ran 𝐹𝐵))
11 df-f 5219 . . 3 (𝑋 / 𝑥𝐹:𝑋 / 𝑥𝐴𝑋 / 𝑥𝐵 ↔ (𝑋 / 𝑥𝐹 Fn 𝑋 / 𝑥𝐴 ∧ ran 𝑋 / 𝑥𝐹𝑋 / 𝑥𝐵))
129, 10, 113bitr4g 223 . 2 (𝑋𝑉 → ([𝑋 / 𝑥](𝐹 Fn 𝐴 ∧ ran 𝐹𝐵) ↔ 𝑋 / 𝑥𝐹:𝑋 / 𝑥𝐴𝑋 / 𝑥𝐵))
133, 12bitrd 188 1 (𝑋𝑉 → ([𝑋 / 𝑥]𝐹:𝐴𝐵𝑋 / 𝑥𝐹:𝑋 / 𝑥𝐴𝑋 / 𝑥𝐵))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  wb 105  wcel 2148  [wsbc 2962  csb 3057  wss 3129  ran crn 4626   Fn wfn 5210  wf 5211
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 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-14 2151  ax-ext 2159  ax-sep 4120  ax-pow 4173  ax-pr 4208
This theorem depends on definitions:  df-bi 117  df-3an 980  df-tru 1356  df-nf 1461  df-sb 1763  df-eu 2029  df-mo 2030  df-clab 2164  df-cleq 2170  df-clel 2173  df-nfc 2308  df-ral 2460  df-v 2739  df-sbc 2963  df-csb 3058  df-un 3133  df-in 3135  df-ss 3142  df-pw 3577  df-sn 3598  df-pr 3599  df-op 3601  df-br 4003  df-opab 4064  df-id 4292  df-rel 4632  df-cnv 4633  df-co 4634  df-dm 4635  df-rn 4636  df-fun 5217  df-fn 5218  df-f 5219
This theorem is referenced by:  ctiunctlemf  12431
  Copyright terms: Public domain W3C validator