Theorem sbcfungOLD 6592

Description: Obsolete version of sbcfung 6591 as of 12-Sep-2026. (Contributed by Alexander van der Vekens, 23-Jul-2017.) (Proof modification is discouraged.) (New usage is discouraged.)

Assertion

Ref	Expression
sbcfungOLD	⊢ (𝐴 ∈ 𝑉 → ([𝐴 / 𝑥]Fun 𝐹 ↔ Fun ⦋𝐴 / 𝑥⦌𝐹))

Proof of Theorem sbcfungOLD

Dummy variables 𝑤 𝑦 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		sbcan 3791	. . 3 ⊢ ([𝐴 / 𝑥](Rel 𝐹 ∧ ∀𝑤∃𝑦∀𝑧(𝑤𝐹𝑧 → 𝑧 = 𝑦)) ↔ ([𝐴 / 𝑥]Rel 𝐹 ∧ [𝐴 / 𝑥]∀𝑤∃𝑦∀𝑧(𝑤𝐹𝑧 → 𝑧 = 𝑦)))
2		sbcrel 5765	. . . 4 ⊢ (𝐴 ∈ 𝑉 → ([𝐴 / 𝑥]Rel 𝐹 ↔ Rel ⦋𝐴 / 𝑥⦌𝐹))
3		sbcal 3801	. . . . 5 ⊢ ([𝐴 / 𝑥]∀𝑤∃𝑦∀𝑧(𝑤𝐹𝑧 → 𝑧 = 𝑦) ↔ ∀𝑤[𝐴 / 𝑥]∃𝑦∀𝑧(𝑤𝐹𝑧 → 𝑧 = 𝑦))
4		sbcex2 3802	. . . . . . 7 ⊢ ([𝐴 / 𝑥]∃𝑦∀𝑧(𝑤𝐹𝑧 → 𝑧 = 𝑦) ↔ ∃𝑦[𝐴 / 𝑥]∀𝑧(𝑤𝐹𝑧 → 𝑧 = 𝑦))
5		sbcal 3801	. . . . . . . . 9 ⊢ ([𝐴 / 𝑥]∀𝑧(𝑤𝐹𝑧 → 𝑧 = 𝑦) ↔ ∀𝑧[𝐴 / 𝑥](𝑤𝐹𝑧 → 𝑧 = 𝑦))
6		sbcimg 3790	. . . . . . . . . . 11 ⊢ (𝐴 ∈ 𝑉 → ([𝐴 / 𝑥](𝑤𝐹𝑧 → 𝑧 = 𝑦) ↔ ([𝐴 / 𝑥]𝑤𝐹𝑧 → [𝐴 / 𝑥]𝑧 = 𝑦)))
7		sbcbr123 5166	. . . . . . . . . . . . 13 ⊢ ([𝐴 / 𝑥]𝑤𝐹𝑧 ↔ ⦋𝐴 / 𝑥⦌𝑤⦋𝐴 / 𝑥⦌𝐹⦋𝐴 / 𝑥⦌𝑧)
8		csbconstg 3870	. . . . . . . . . . . . . 14 ⊢ (𝐴 ∈ 𝑉 → ⦋𝐴 / 𝑥⦌𝑤 = 𝑤)
9		csbconstg 3870	. . . . . . . . . . . . . 14 ⊢ (𝐴 ∈ 𝑉 → ⦋𝐴 / 𝑥⦌𝑧 = 𝑧)
10	8, 9	breq12d 5121	. . . . . . . . . . . . 13 ⊢ (𝐴 ∈ 𝑉 → (⦋𝐴 / 𝑥⦌𝑤⦋𝐴 / 𝑥⦌𝐹⦋𝐴 / 𝑥⦌𝑧 ↔ 𝑤⦋𝐴 / 𝑥⦌𝐹𝑧))
11	7, 10	bitrid 286	. . . . . . . . . . . 12 ⊢ (𝐴 ∈ 𝑉 → ([𝐴 / 𝑥]𝑤𝐹𝑧 ↔ 𝑤⦋𝐴 / 𝑥⦌𝐹𝑧))
12		sbcg 3814	. . . . . . . . . . . 12 ⊢ (𝐴 ∈ 𝑉 → ([𝐴 / 𝑥]𝑧 = 𝑦 ↔ 𝑧 = 𝑦))
13	11, 12	imbi12d 347	. . . . . . . . . . 11 ⊢ (𝐴 ∈ 𝑉 → (([𝐴 / 𝑥]𝑤𝐹𝑧 → [𝐴 / 𝑥]𝑧 = 𝑦) ↔ (𝑤⦋𝐴 / 𝑥⦌𝐹𝑧 → 𝑧 = 𝑦)))
14	6, 13	bitrd 282	. . . . . . . . . 10 ⊢ (𝐴 ∈ 𝑉 → ([𝐴 / 𝑥](𝑤𝐹𝑧 → 𝑧 = 𝑦) ↔ (𝑤⦋𝐴 / 𝑥⦌𝐹𝑧 → 𝑧 = 𝑦)))
15	14	albidv 1955	. . . . . . . . 9 ⊢ (𝐴 ∈ 𝑉 → (∀𝑧[𝐴 / 𝑥](𝑤𝐹𝑧 → 𝑧 = 𝑦) ↔ ∀𝑧(𝑤⦋𝐴 / 𝑥⦌𝐹𝑧 → 𝑧 = 𝑦)))
16	5, 15	bitrid 286	. . . . . . . 8 ⊢ (𝐴 ∈ 𝑉 → ([𝐴 / 𝑥]∀𝑧(𝑤𝐹𝑧 → 𝑧 = 𝑦) ↔ ∀𝑧(𝑤⦋𝐴 / 𝑥⦌𝐹𝑧 → 𝑧 = 𝑦)))
17	16	exbidv 1956	. . . . . . 7 ⊢ (𝐴 ∈ 𝑉 → (∃𝑦[𝐴 / 𝑥]∀𝑧(𝑤𝐹𝑧 → 𝑧 = 𝑦) ↔ ∃𝑦∀𝑧(𝑤⦋𝐴 / 𝑥⦌𝐹𝑧 → 𝑧 = 𝑦)))
18	4, 17	bitrid 286	. . . . . 6 ⊢ (𝐴 ∈ 𝑉 → ([𝐴 / 𝑥]∃𝑦∀𝑧(𝑤𝐹𝑧 → 𝑧 = 𝑦) ↔ ∃𝑦∀𝑧(𝑤⦋𝐴 / 𝑥⦌𝐹𝑧 → 𝑧 = 𝑦)))
19	18	albidv 1955	. . . . 5 ⊢ (𝐴 ∈ 𝑉 → (∀𝑤[𝐴 / 𝑥]∃𝑦∀𝑧(𝑤𝐹𝑧 → 𝑧 = 𝑦) ↔ ∀𝑤∃𝑦∀𝑧(𝑤⦋𝐴 / 𝑥⦌𝐹𝑧 → 𝑧 = 𝑦)))
20	3, 19	bitrid 286	. . . 4 ⊢ (𝐴 ∈ 𝑉 → ([𝐴 / 𝑥]∀𝑤∃𝑦∀𝑧(𝑤𝐹𝑧 → 𝑧 = 𝑦) ↔ ∀𝑤∃𝑦∀𝑧(𝑤⦋𝐴 / 𝑥⦌𝐹𝑧 → 𝑧 = 𝑦)))
21	2, 20	anbi12d 644	. . 3 ⊢ (𝐴 ∈ 𝑉 → (([𝐴 / 𝑥]Rel 𝐹 ∧ [𝐴 / 𝑥]∀𝑤∃𝑦∀𝑧(𝑤𝐹𝑧 → 𝑧 = 𝑦)) ↔ (Rel ⦋𝐴 / 𝑥⦌𝐹 ∧ ∀𝑤∃𝑦∀𝑧(𝑤⦋𝐴 / 𝑥⦌𝐹𝑧 → 𝑧 = 𝑦))))
22	1, 21	bitrid 286	. 2 ⊢ (𝐴 ∈ 𝑉 → ([𝐴 / 𝑥](Rel 𝐹 ∧ ∀𝑤∃𝑦∀𝑧(𝑤𝐹𝑧 → 𝑧 = 𝑦)) ↔ (Rel ⦋𝐴 / 𝑥⦌𝐹 ∧ ∀𝑤∃𝑦∀𝑧(𝑤⦋𝐴 / 𝑥⦌𝐹𝑧 → 𝑧 = 𝑦))))
23		dffun3 6578	. . 3 ⊢ (Fun 𝐹 ↔ (Rel 𝐹 ∧ ∀𝑤∃𝑦∀𝑧(𝑤𝐹𝑧 → 𝑧 = 𝑦)))
24	23	sbcbii 3798	. 2 ⊢ ([𝐴 / 𝑥]Fun 𝐹 ↔ [𝐴 / 𝑥](Rel 𝐹 ∧ ∀𝑤∃𝑦∀𝑧(𝑤𝐹𝑧 → 𝑧 = 𝑦)))
25		dffun3 6578	. 2 ⊢ (Fun ⦋𝐴 / 𝑥⦌𝐹 ↔ (Rel ⦋𝐴 / 𝑥⦌𝐹 ∧ ∀𝑤∃𝑦∀𝑧(𝑤⦋𝐴 / 𝑥⦌𝐹𝑧 → 𝑧 = 𝑦)))
26	22, 24, 25	3bitr4g 317	1 ⊢ (𝐴 ∈ 𝑉 → ([𝐴 / 𝑥]Fun 𝐹 ↔ Fun ⦋𝐴 / 𝑥⦌𝐹))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401  ∀wal 1568  ∃wex 1812   ∈ wcel 2147  [wsbc 3742  ⦋csb 3851   class class class wbr 5108  Rel wrel 5663  Fun wfun 6560

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5255  ax-pr 5398

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4841  df-br 5109  df-opab 5174  df-id 5553  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-fun 6568

This theorem is used by: (None)