Theorem bnj976 35175

Description: First-order logic and set theory. (Contributed by Jonathan Ben-Naim, 3-Jun-2011.) (New usage is discouraged.)

Hypotheses

Ref	Expression
bnj976.1	⊢ (𝜒 ↔ (𝑁 ∈ 𝐷 ∧ 𝑓 Fn 𝑁 ∧ 𝜑 ∧ 𝜓))
bnj976.2	⊢ (𝜑′ ↔ [𝐺 / 𝑓]𝜑)
bnj976.3	⊢ (𝜓′ ↔ [𝐺 / 𝑓]𝜓)
bnj976.4	⊢ (𝜒′ ↔ [𝐺 / 𝑓]𝜒)
bnj976.5	⊢ 𝐺 ∈ V

Assertion

Ref	Expression
bnj976	⊢ (𝜒′ ↔ (𝑁 ∈ 𝐷 ∧ 𝐺 Fn 𝑁 ∧ 𝜑′ ∧ 𝜓′))

Distinct variable groups:   𝐷,𝑓   𝑓,𝑁

Allowed substitution hints:   𝜑(𝑓)   𝜓(𝑓)   𝜒(𝑓)   𝐺(𝑓)   𝜑′(𝑓)   𝜓′(𝑓)   𝜒′(𝑓)

Proof of Theorem bnj976

Dummy variable ℎ is distinct from all other variables.

Step	Hyp	Ref	Expression
1		bnj976.4	. 2 ⊢ (𝜒′ ↔ [𝐺 / 𝑓]𝜒)
2		sbccow 3766	. 2 ⊢ ([𝐺 / ℎ][ℎ / 𝑓]𝜒 ↔ [𝐺 / 𝑓]𝜒)
3		bnj976.5	. . 3 ⊢ 𝐺 ∈ V
4		bnj252 35101	. . . . . 6 ⊢ ((𝑁 ∈ 𝐷 ∧ 𝑓 Fn 𝑁 ∧ 𝜑 ∧ 𝜓) ↔ (𝑁 ∈ 𝐷 ∧ (𝑓 Fn 𝑁 ∧ 𝜑 ∧ 𝜓)))
5	4	sbcbii 3799	. . . . 5 ⊢ ([ℎ / 𝑓](𝑁 ∈ 𝐷 ∧ 𝑓 Fn 𝑁 ∧ 𝜑 ∧ 𝜓) ↔ [ℎ / 𝑓](𝑁 ∈ 𝐷 ∧ (𝑓 Fn 𝑁 ∧ 𝜑 ∧ 𝜓)))
6		bnj976.1	. . . . . 6 ⊢ (𝜒 ↔ (𝑁 ∈ 𝐷 ∧ 𝑓 Fn 𝑁 ∧ 𝜑 ∧ 𝜓))
7	6	sbcbii 3799	. . . . 5 ⊢ ([ℎ / 𝑓]𝜒 ↔ [ℎ / 𝑓](𝑁 ∈ 𝐷 ∧ 𝑓 Fn 𝑁 ∧ 𝜑 ∧ 𝜓))
8		vex 3458	. . . . . . . 8 ⊢ ℎ ∈ V
9	8	bnj525 35136	. . . . . . 7 ⊢ ([ℎ / 𝑓]𝑁 ∈ 𝐷 ↔ 𝑁 ∈ 𝐷)
10		sbc3an 3807	. . . . . . . 8 ⊢ ([ℎ / 𝑓](𝑓 Fn 𝑁 ∧ 𝜑 ∧ 𝜓) ↔ ([ℎ / 𝑓]𝑓 Fn 𝑁 ∧ [ℎ / 𝑓]𝜑 ∧ [ℎ / 𝑓]𝜓))
11		bnj62 35118	. . . . . . . . 9 ⊢ ([ℎ / 𝑓]𝑓 Fn 𝑁 ↔ ℎ Fn 𝑁)
12	11	3anbi1i 1174	. . . . . . . 8 ⊢ (([ℎ / 𝑓]𝑓 Fn 𝑁 ∧ [ℎ / 𝑓]𝜑 ∧ [ℎ / 𝑓]𝜓) ↔ (ℎ Fn 𝑁 ∧ [ℎ / 𝑓]𝜑 ∧ [ℎ / 𝑓]𝜓))
13	10, 12	bitri 278	. . . . . . 7 ⊢ ([ℎ / 𝑓](𝑓 Fn 𝑁 ∧ 𝜑 ∧ 𝜓) ↔ (ℎ Fn 𝑁 ∧ [ℎ / 𝑓]𝜑 ∧ [ℎ / 𝑓]𝜓))
14	9, 13	anbi12i 639	. . . . . 6 ⊢ (([ℎ / 𝑓]𝑁 ∈ 𝐷 ∧ [ℎ / 𝑓](𝑓 Fn 𝑁 ∧ 𝜑 ∧ 𝜓)) ↔ (𝑁 ∈ 𝐷 ∧ (ℎ Fn 𝑁 ∧ [ℎ / 𝑓]𝜑 ∧ [ℎ / 𝑓]𝜓)))
15		sbcan 3792	. . . . . 6 ⊢ ([ℎ / 𝑓](𝑁 ∈ 𝐷 ∧ (𝑓 Fn 𝑁 ∧ 𝜑 ∧ 𝜓)) ↔ ([ℎ / 𝑓]𝑁 ∈ 𝐷 ∧ [ℎ / 𝑓](𝑓 Fn 𝑁 ∧ 𝜑 ∧ 𝜓)))
16		bnj252 35101	. . . . . 6 ⊢ ((𝑁 ∈ 𝐷 ∧ ℎ Fn 𝑁 ∧ [ℎ / 𝑓]𝜑 ∧ [ℎ / 𝑓]𝜓) ↔ (𝑁 ∈ 𝐷 ∧ (ℎ Fn 𝑁 ∧ [ℎ / 𝑓]𝜑 ∧ [ℎ / 𝑓]𝜓)))
17	14, 15, 16	3bitr4ri 307	. . . . 5 ⊢ ((𝑁 ∈ 𝐷 ∧ ℎ Fn 𝑁 ∧ [ℎ / 𝑓]𝜑 ∧ [ℎ / 𝑓]𝜓) ↔ [ℎ / 𝑓](𝑁 ∈ 𝐷 ∧ (𝑓 Fn 𝑁 ∧ 𝜑 ∧ 𝜓)))
18	5, 7, 17	3bitr4i 306	. . . 4 ⊢ ([ℎ / 𝑓]𝜒 ↔ (𝑁 ∈ 𝐷 ∧ ℎ Fn 𝑁 ∧ [ℎ / 𝑓]𝜑 ∧ [ℎ / 𝑓]𝜓))
19		fneq1 6626	. . . . . . 7 ⊢ (ℎ = 𝐺 → (ℎ Fn 𝑁 ↔ 𝐺 Fn 𝑁))
20		sbceq1a 3754	. . . . . . . 8 ⊢ (ℎ = 𝐺 → ([ℎ / 𝑓]𝜑 ↔ [𝐺 / ℎ][ℎ / 𝑓]𝜑))
21		bnj976.2	. . . . . . . . 9 ⊢ (𝜑′ ↔ [𝐺 / 𝑓]𝜑)
22		sbccow 3766	. . . . . . . . 9 ⊢ ([𝐺 / ℎ][ℎ / 𝑓]𝜑 ↔ [𝐺 / 𝑓]𝜑)
23	21, 22	bitr4i 281	. . . . . . . 8 ⊢ (𝜑′ ↔ [𝐺 / ℎ][ℎ / 𝑓]𝜑)
24	20, 23	bitr4di 292	. . . . . . 7 ⊢ (ℎ = 𝐺 → ([ℎ / 𝑓]𝜑 ↔ 𝜑′))
25		sbceq1a 3754	. . . . . . . 8 ⊢ (ℎ = 𝐺 → ([ℎ / 𝑓]𝜓 ↔ [𝐺 / ℎ][ℎ / 𝑓]𝜓))
26		bnj976.3	. . . . . . . . 9 ⊢ (𝜓′ ↔ [𝐺 / 𝑓]𝜓)
27		sbccow 3766	. . . . . . . . 9 ⊢ ([𝐺 / ℎ][ℎ / 𝑓]𝜓 ↔ [𝐺 / 𝑓]𝜓)
28	26, 27	bitr4i 281	. . . . . . . 8 ⊢ (𝜓′ ↔ [𝐺 / ℎ][ℎ / 𝑓]𝜓)
29	25, 28	bitr4di 292	. . . . . . 7 ⊢ (ℎ = 𝐺 → ([ℎ / 𝑓]𝜓 ↔ 𝜓′))
30	19, 24, 29	3anbi123d 1463	. . . . . 6 ⊢ (ℎ = 𝐺 → ((ℎ Fn 𝑁 ∧ [ℎ / 𝑓]𝜑 ∧ [ℎ / 𝑓]𝜓) ↔ (𝐺 Fn 𝑁 ∧ 𝜑′ ∧ 𝜓′)))
31	30	anbi2d 641	. . . . 5 ⊢ (ℎ = 𝐺 → ((𝑁 ∈ 𝐷 ∧ (ℎ Fn 𝑁 ∧ [ℎ / 𝑓]𝜑 ∧ [ℎ / 𝑓]𝜓)) ↔ (𝑁 ∈ 𝐷 ∧ (𝐺 Fn 𝑁 ∧ 𝜑′ ∧ 𝜓′))))
32		bnj252 35101	. . . . 5 ⊢ ((𝑁 ∈ 𝐷 ∧ 𝐺 Fn 𝑁 ∧ 𝜑′ ∧ 𝜓′) ↔ (𝑁 ∈ 𝐷 ∧ (𝐺 Fn 𝑁 ∧ 𝜑′ ∧ 𝜓′)))
33	31, 16, 32	3bitr4g 317	. . . 4 ⊢ (ℎ = 𝐺 → ((𝑁 ∈ 𝐷 ∧ ℎ Fn 𝑁 ∧ [ℎ / 𝑓]𝜑 ∧ [ℎ / 𝑓]𝜓) ↔ (𝑁 ∈ 𝐷 ∧ 𝐺 Fn 𝑁 ∧ 𝜑′ ∧ 𝜓′)))
34	18, 33	bitrid 286	. . 3 ⊢ (ℎ = 𝐺 → ([ℎ / 𝑓]𝜒 ↔ (𝑁 ∈ 𝐷 ∧ 𝐺 Fn 𝑁 ∧ 𝜑′ ∧ 𝜓′)))
35	3, 34	sbcie 3784	. 2 ⊢ ([𝐺 / ℎ][ℎ / 𝑓]𝜒 ↔ (𝑁 ∈ 𝐷 ∧ 𝐺 Fn 𝑁 ∧ 𝜑′ ∧ 𝜓′))
36	1, 2, 35	3bitr2i 302	1 ⊢ (𝜒′ ↔ (𝑁 ∈ 𝐷 ∧ 𝐺 Fn 𝑁 ∧ 𝜑′ ∧ 𝜓′))

This proof depends on syntax axioms:   ↔ wb 209   ∧ wa 400   ∧ w3a 1102   = wceq 1569   ∈ wcel 2142  Vcvv 3454  [wsbc 3743   Fn wfn 6531   ∧ w-bnj17 35084

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1824  ax-4 1838  ax-5 1939  ax-6 1996  ax-7 2037  ax-8 2144  ax-9 2152  ax-12 2212  ax-ext 2734

This proof depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1104  df-tru 1572  df-fal 1582  df-ex 1809  df-sb 2096  df-clab 2741  df-cleq 2754  df-clel 2837  df-rab 3416  df-v 3456  df-sbc 3744  df-dif 3907  df-un 3909  df-ss 3921  df-nul 4286  df-if 4487  df-sn 4589  df-pr 4591  df-op 4595  df-br 5109  df-opab 5173  df-rel 5667  df-cnv 5668  df-co 5669  df-dm 5670  df-fun 6538  df-fn 6539  df-bnj17 35085

This theorem is used by:  bnj910  35345  bnj999  35355  bnj907  35364