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

Theorem sbcfg 5346
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 5202 . . . 4 (𝐹:𝐴𝐵 ↔ (𝐹 Fn 𝐴 ∧ ran 𝐹𝐵))
21a1i 9 . . 3 (𝑋𝑉 → (𝐹:𝐴𝐵 ↔ (𝐹 Fn 𝐴 ∧ ran 𝐹𝐵)))
32sbcbidv 3013 . 2 (𝑋𝑉 → ([𝑋 / 𝑥]𝐹:𝐴𝐵[𝑋 / 𝑥](𝐹 Fn 𝐴 ∧ ran 𝐹𝐵)))
4 sbcfng 5345 . . . 4 (𝑋𝑉 → ([𝑋 / 𝑥]𝐹 Fn 𝐴𝑋 / 𝑥𝐹 Fn 𝑋 / 𝑥𝐴))
5 sbcssg 3524 . . . . 5 (𝑋𝑉 → ([𝑋 / 𝑥]ran 𝐹𝐵𝑋 / 𝑥ran 𝐹𝑋 / 𝑥𝐵))
6 csbrng 5072 . . . . . 6 (𝑋𝑉𝑋 / 𝑥ran 𝐹 = ran 𝑋 / 𝑥𝐹)
76sseq1d 3176 . . . . 5 (𝑋𝑉 → (𝑋 / 𝑥ran 𝐹𝑋 / 𝑥𝐵 ↔ ran 𝑋 / 𝑥𝐹𝑋 / 𝑥𝐵))
85, 7bitrd 187 . . . 4 (𝑋𝑉 → ([𝑋 / 𝑥]ran 𝐹𝐵 ↔ ran 𝑋 / 𝑥𝐹𝑋 / 𝑥𝐵))
94, 8anbi12d 470 . . 3 (𝑋𝑉 → (([𝑋 / 𝑥]𝐹 Fn 𝐴[𝑋 / 𝑥]ran 𝐹𝐵) ↔ (𝑋 / 𝑥𝐹 Fn 𝑋 / 𝑥𝐴 ∧ ran 𝑋 / 𝑥𝐹𝑋 / 𝑥𝐵)))
10 sbcan 2997 . . 3 ([𝑋 / 𝑥](𝐹 Fn 𝐴 ∧ ran 𝐹𝐵) ↔ ([𝑋 / 𝑥]𝐹 Fn 𝐴[𝑋 / 𝑥]ran 𝐹𝐵))
11 df-f 5202 . . 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 2141  [wsbc 2955  csb 3049  wss 3121  ran crn 4612   Fn wfn 5193  wf 5194
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 704  ax-5 1440  ax-7 1441  ax-gen 1442  ax-ie1 1486  ax-ie2 1487  ax-8 1497  ax-10 1498  ax-11 1499  ax-i12 1500  ax-bndl 1502  ax-4 1503  ax-17 1519  ax-i9 1523  ax-ial 1527  ax-i5r 1528  ax-14 2144  ax-ext 2152  ax-sep 4107  ax-pow 4160  ax-pr 4194
This theorem depends on definitions:  df-bi 116  df-3an 975  df-tru 1351  df-nf 1454  df-sb 1756  df-eu 2022  df-mo 2023  df-clab 2157  df-cleq 2163  df-clel 2166  df-nfc 2301  df-ral 2453  df-v 2732  df-sbc 2956  df-csb 3050  df-un 3125  df-in 3127  df-ss 3134  df-pw 3568  df-sn 3589  df-pr 3590  df-op 3592  df-br 3990  df-opab 4051  df-id 4278  df-rel 4618  df-cnv 4619  df-co 4620  df-dm 4621  df-rn 4622  df-fun 5200  df-fn 5201  df-f 5202
This theorem is referenced by:  ctiunctlemf  12393
  Copyright terms: Public domain W3C validator