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

Theorem sbcfung 5401
Description: Distribute proper substitution through the function predicate. (Contributed by Alexander van der Vekens, 23-Jul-2017.)
Assertion
Ref Expression
sbcfung (𝐴 ∈ 𝑉 → ([𝐴 / 𝑥]Fun 𝐹 ↔ Fun ⦋𝐴 / 𝑥⦌𝐹))

Proof of Theorem sbcfung
Dummy variables 𝑤 𝑦 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 sbcan 3094 . . 3 ([𝐴 / 𝑥](Rel 𝐹 ∧ ∀𝑤∀𝑦∀𝑧((𝑤𝐹𝑦 ∧ 𝑤𝐹𝑧) → 𝑦 = 𝑧)) ↔ ([𝐴 / 𝑥]Rel 𝐹 ∧ [𝐴 / 𝑥]∀𝑤∀𝑦∀𝑧((𝑤𝐹𝑦 ∧ 𝑤𝐹𝑧) → 𝑦 = 𝑧)))
2 sbcrel 4861 . . . 4 (𝐴 ∈ 𝑉 → ([𝐴 / 𝑥]Rel 𝐹 ↔ Rel ⦋𝐴 / 𝑥⦌𝐹))
3 sbcal 3103 . . . . 5 ([𝐴 / 𝑥]∀𝑤∀𝑦∀𝑧((𝑤𝐹𝑦 ∧ 𝑤𝐹𝑧) → 𝑦 = 𝑧) ↔ ∀𝑤[𝐴 / 𝑥]∀𝑦∀𝑧((𝑤𝐹𝑦 ∧ 𝑤𝐹𝑧) → 𝑦 = 𝑧))
4 sbcal 3103 . . . . . . 7 ([𝐴 / 𝑥]∀𝑦∀𝑧((𝑤𝐹𝑦 ∧ 𝑤𝐹𝑧) → 𝑦 = 𝑧) ↔ ∀𝑦[𝐴 / 𝑥]∀𝑧((𝑤𝐹𝑦 ∧ 𝑤𝐹𝑧) → 𝑦 = 𝑧))
5 sbcal 3103 . . . . . . . . 9 ([𝐴 / 𝑥]∀𝑧((𝑤𝐹𝑦 ∧ 𝑤𝐹𝑧) → 𝑦 = 𝑧) ↔ ∀𝑧[𝐴 / 𝑥]((𝑤𝐹𝑦 ∧ 𝑤𝐹𝑧) → 𝑦 = 𝑧))
6 sbcimg 3093 . . . . . . . . . . 11 (𝐴 ∈ 𝑉 → ([𝐴 / 𝑥]((𝑤𝐹𝑦 ∧ 𝑤𝐹𝑧) → 𝑦 = 𝑧) ↔ ([𝐴 / 𝑥](𝑤𝐹𝑦 ∧ 𝑤𝐹𝑧) → [𝐴 / 𝑥]𝑦 = 𝑧)))
7 sbcan 3094 . . . . . . . . . . . . 13 ([𝐴 / 𝑥](𝑤𝐹𝑦 ∧ 𝑤𝐹𝑧) ↔ ([𝐴 / 𝑥]𝑤𝐹𝑦 ∧ [𝐴 / 𝑥]𝑤𝐹𝑧))
8 sbcbrg 4185 . . . . . . . . . . . . . . 15 (𝐴 ∈ 𝑉 → ([𝐴 / 𝑥]𝑤𝐹𝑦 ↔ ⦋𝐴 / 𝑥⦌𝑤⦋𝐴 / 𝑥⦌𝐹⦋𝐴 / 𝑥⦌𝑦))
9 csbconstg 3161 . . . . . . . . . . . . . . . 16 (𝐴 ∈ 𝑉 → ⦋𝐴 / 𝑥⦌𝑤 = 𝑤)
10 csbconstg 3161 . . . . . . . . . . . . . . . 16 (𝐴 ∈ 𝑉 → ⦋𝐴 / 𝑥⦌𝑦 = 𝑦)
119, 10breq12d 4143 . . . . . . . . . . . . . . 15 (𝐴 ∈ 𝑉 → (⦋𝐴 / 𝑥⦌𝑤⦋𝐴 / 𝑥⦌𝐹⦋𝐴 / 𝑥⦌𝑦 ↔ 𝑤⦋𝐴 / 𝑥⦌𝐹𝑦))
128, 11bitrd 188 . . . . . . . . . . . . . 14 (𝐴 ∈ 𝑉 → ([𝐴 / 𝑥]𝑤𝐹𝑦 ↔ 𝑤⦋𝐴 / 𝑥⦌𝐹𝑦))
13 sbcbrg 4185 . . . . . . . . . . . . . . 15 (𝐴 ∈ 𝑉 → ([𝐴 / 𝑥]𝑤𝐹𝑧 ↔ ⦋𝐴 / 𝑥⦌𝑤⦋𝐴 / 𝑥⦌𝐹⦋𝐴 / 𝑥⦌𝑧))
14 csbconstg 3161 . . . . . . . . . . . . . . . 16 (𝐴 ∈ 𝑉 → ⦋𝐴 / 𝑥⦌𝑧 = 𝑧)
159, 14breq12d 4143 . . . . . . . . . . . . . . 15 (𝐴 ∈ 𝑉 → (⦋𝐴 / 𝑥⦌𝑤⦋𝐴 / 𝑥⦌𝐹⦋𝐴 / 𝑥⦌𝑧 ↔ 𝑤⦋𝐴 / 𝑥⦌𝐹𝑧))
1613, 15bitrd 188 . . . . . . . . . . . . . 14 (𝐴 ∈ 𝑉 → ([𝐴 / 𝑥]𝑤𝐹𝑧 ↔ 𝑤⦋𝐴 / 𝑥⦌𝐹𝑧))
1712, 16anbi12d 477 . . . . . . . . . . . . 13 (𝐴 ∈ 𝑉 → (([𝐴 / 𝑥]𝑤𝐹𝑦 ∧ [𝐴 / 𝑥]𝑤𝐹𝑧) ↔ (𝑤⦋𝐴 / 𝑥⦌𝐹𝑦 ∧ 𝑤⦋𝐴 / 𝑥⦌𝐹𝑧)))
187, 17bitrid 192 . . . . . . . . . . . 12 (𝐴 ∈ 𝑉 → ([𝐴 / 𝑥](𝑤𝐹𝑦 ∧ 𝑤𝐹𝑧) ↔ (𝑤⦋𝐴 / 𝑥⦌𝐹𝑦 ∧ 𝑤⦋𝐴 / 𝑥⦌𝐹𝑧)))
19 sbcg 3121 . . . . . . . . . . . 12 (𝐴 ∈ 𝑉 → ([𝐴 / 𝑥]𝑦 = 𝑧 ↔ 𝑦 = 𝑧))
2018, 19imbi12d 234 . . . . . . . . . . 11 (𝐴 ∈ 𝑉 → (([𝐴 / 𝑥](𝑤𝐹𝑦 ∧ 𝑤𝐹𝑧) → [𝐴 / 𝑥]𝑦 = 𝑧) ↔ ((𝑤⦋𝐴 / 𝑥⦌𝐹𝑦 ∧ 𝑤⦋𝐴 / 𝑥⦌𝐹𝑧) → 𝑦 = 𝑧)))
216, 20bitrd 188 . . . . . . . . . 10 (𝐴 ∈ 𝑉 → ([𝐴 / 𝑥]((𝑤𝐹𝑦 ∧ 𝑤𝐹𝑧) → 𝑦 = 𝑧) ↔ ((𝑤⦋𝐴 / 𝑥⦌𝐹𝑦 ∧ 𝑤⦋𝐴 / 𝑥⦌𝐹𝑧) → 𝑦 = 𝑧)))
2221albidv 1877 . . . . . . . . 9 (𝐴 ∈ 𝑉 → (∀𝑧[𝐴 / 𝑥]((𝑤𝐹𝑦 ∧ 𝑤𝐹𝑧) → 𝑦 = 𝑧) ↔ ∀𝑧((𝑤⦋𝐴 / 𝑥⦌𝐹𝑦 ∧ 𝑤⦋𝐴 / 𝑥⦌𝐹𝑧) → 𝑦 = 𝑧)))
235, 22bitrid 192 . . . . . . . 8 (𝐴 ∈ 𝑉 → ([𝐴 / 𝑥]∀𝑧((𝑤𝐹𝑦 ∧ 𝑤𝐹𝑧) → 𝑦 = 𝑧) ↔ ∀𝑧((𝑤⦋𝐴 / 𝑥⦌𝐹𝑦 ∧ 𝑤⦋𝐴 / 𝑥⦌𝐹𝑧) → 𝑦 = 𝑧)))
2423albidv 1877 . . . . . . 7 (𝐴 ∈ 𝑉 → (∀𝑦[𝐴 / 𝑥]∀𝑧((𝑤𝐹𝑦 ∧ 𝑤𝐹𝑧) → 𝑦 = 𝑧) ↔ ∀𝑦∀𝑧((𝑤⦋𝐴 / 𝑥⦌𝐹𝑦 ∧ 𝑤⦋𝐴 / 𝑥⦌𝐹𝑧) → 𝑦 = 𝑧)))
254, 24bitrid 192 . . . . . 6 (𝐴 ∈ 𝑉 → ([𝐴 / 𝑥]∀𝑦∀𝑧((𝑤𝐹𝑦 ∧ 𝑤𝐹𝑧) → 𝑦 = 𝑧) ↔ ∀𝑦∀𝑧((𝑤⦋𝐴 / 𝑥⦌𝐹𝑦 ∧ 𝑤⦋𝐴 / 𝑥⦌𝐹𝑧) → 𝑦 = 𝑧)))
2625albidv 1877 . . . . 5 (𝐴 ∈ 𝑉 → (∀𝑤[𝐴 / 𝑥]∀𝑦∀𝑧((𝑤𝐹𝑦 ∧ 𝑤𝐹𝑧) → 𝑦 = 𝑧) ↔ ∀𝑤∀𝑦∀𝑧((𝑤⦋𝐴 / 𝑥⦌𝐹𝑦 ∧ 𝑤⦋𝐴 / 𝑥⦌𝐹𝑧) → 𝑦 = 𝑧)))
273, 26bitrid 192 . . . 4 (𝐴 ∈ 𝑉 → ([𝐴 / 𝑥]∀𝑤∀𝑦∀𝑧((𝑤𝐹𝑦 ∧ 𝑤𝐹𝑧) → 𝑦 = 𝑧) ↔ ∀𝑤∀𝑦∀𝑧((𝑤⦋𝐴 / 𝑥⦌𝐹𝑦 ∧ 𝑤⦋𝐴 / 𝑥⦌𝐹𝑧) → 𝑦 = 𝑧)))
282, 27anbi12d 477 . . 3 (𝐴 ∈ 𝑉 → (([𝐴 / 𝑥]Rel 𝐹 ∧ [𝐴 / 𝑥]∀𝑤∀𝑦∀𝑧((𝑤𝐹𝑦 ∧ 𝑤𝐹𝑧) → 𝑦 = 𝑧)) ↔ (Rel ⦋𝐴 / 𝑥⦌𝐹 ∧ ∀𝑤∀𝑦∀𝑧((𝑤⦋𝐴 / 𝑥⦌𝐹𝑦 ∧ 𝑤⦋𝐴 / 𝑥⦌𝐹𝑧) → 𝑦 = 𝑧))))
291, 28bitrid 192 . 2 (𝐴 ∈ 𝑉 → ([𝐴 / 𝑥](Rel 𝐹 ∧ ∀𝑤∀𝑦∀𝑧((𝑤𝐹𝑦 ∧ 𝑤𝐹𝑧) → 𝑦 = 𝑧)) ↔ (Rel ⦋𝐴 / 𝑥⦌𝐹 ∧ ∀𝑤∀𝑦∀𝑧((𝑤⦋𝐴 / 𝑥⦌𝐹𝑦 ∧ 𝑤⦋𝐴 / 𝑥⦌𝐹𝑧) → 𝑦 = 𝑧))))
30 dffun2 5387 . . 3 (Fun 𝐹 ↔ (Rel 𝐹 ∧ ∀𝑤∀𝑦∀𝑧((𝑤𝐹𝑦 ∧ 𝑤𝐹𝑧) → 𝑦 = 𝑧)))
3130sbcbii 3111 . 2 ([𝐴 / 𝑥]Fun 𝐹 ↔ [𝐴 / 𝑥](Rel 𝐹 ∧ ∀𝑤∀𝑦∀𝑧((𝑤𝐹𝑦 ∧ 𝑤𝐹𝑧) → 𝑦 = 𝑧)))
32 dffun2 5387 . 2 (Fun ⦋𝐴 / 𝑥⦌𝐹 ↔ (Rel ⦋𝐴 / 𝑥⦌𝐹 ∧ ∀𝑤∀𝑦∀𝑧((𝑤⦋𝐴 / 𝑥⦌𝐹𝑦 ∧ 𝑤⦋𝐴 / 𝑥⦌𝐹𝑧) → 𝑦 = 𝑧)))
3329, 31, 323bitr4g 223 1 (𝐴 ∈ 𝑉 → ([𝐴 / 𝑥]Fun 𝐹 ↔ Fun ⦋𝐴 / 𝑥⦌𝐹))
Colors of variables:    wff set class
This proof depends on syntax axioms:   → wi 4   ∧ wa 104   ↔ wb 105  ∀wal 1400   ∈ wcel 2209  [wsbc 3051  ⦋csb 3147   class class class wbr 4130  Rel wrel 4779  Fun wfun 5371
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4249  ax-pow 4311  ax-pr 4346
This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-v 2823  df-sbc 3052  df-csb 3148  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-br 4131  df-opab 4193  df-id 4438  df-rel 4781  df-cnv 4782  df-co 4783  df-fun 5379
This theorem is used by:  sbcfng  5531
  Copyright terms: Public domain W3C validator