Theorem bnj919 35165

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

Hypotheses

Ref	Expression
bnj919.1	⊢ (𝜒 ↔ (𝑛 ∈ 𝐷 ∧ 𝐹 Fn 𝑛 ∧ 𝜑 ∧ 𝜓))
bnj919.2	⊢ (𝜑′ ↔ [𝑃 / 𝑛]𝜑)
bnj919.3	⊢ (𝜓′ ↔ [𝑃 / 𝑛]𝜓)
bnj919.4	⊢ (𝜒′ ↔ [𝑃 / 𝑛]𝜒)
bnj919.5	⊢ 𝑃 ∈ V

Assertion

Ref	Expression
bnj919	⊢ (𝜒′ ↔ (𝑃 ∈ 𝐷 ∧ 𝐹 Fn 𝑃 ∧ 𝜑′ ∧ 𝜓′))

Distinct variable groups:   𝐷,𝑛   𝑛,𝐹   𝑃,𝑛

Allowed substitution hints:   𝜑(𝑛)   𝜓(𝑛)   𝜒(𝑛)   𝜑′(𝑛)   𝜓′(𝑛)   𝜒′(𝑛)

Proof of Theorem bnj919

Step	Hyp	Ref	Expression
1		bnj919.4	. 2 ⊢ (𝜒′ ↔ [𝑃 / 𝑛]𝜒)
2		bnj919.1	. . 3 ⊢ (𝜒 ↔ (𝑛 ∈ 𝐷 ∧ 𝐹 Fn 𝑛 ∧ 𝜑 ∧ 𝜓))
3	2	sbcbii 3799	. 2 ⊢ ([𝑃 / 𝑛]𝜒 ↔ [𝑃 / 𝑛](𝑛 ∈ 𝐷 ∧ 𝐹 Fn 𝑛 ∧ 𝜑 ∧ 𝜓))
4		bnj919.5	. . 3 ⊢ 𝑃 ∈ V
5		df-bnj17 35085	. . . . 5 ⊢ ((𝑃 ∈ 𝐷 ∧ 𝐹 Fn 𝑃 ∧ 𝜑′ ∧ 𝜓′) ↔ ((𝑃 ∈ 𝐷 ∧ 𝐹 Fn 𝑃 ∧ 𝜑′) ∧ 𝜓′))
6		nfv 1943	. . . . . . 7 ⊢ Ⅎ𝑛 𝑃 ∈ 𝐷
7		nfv 1943	. . . . . . 7 ⊢ Ⅎ𝑛 𝐹 Fn 𝑃
8		bnj919.2	. . . . . . . 8 ⊢ (𝜑′ ↔ [𝑃 / 𝑛]𝜑)
9		nfsbc1v 3763	. . . . . . . 8 ⊢ Ⅎ𝑛[𝑃 / 𝑛]𝜑
10	8, 9	nfxfr 1882	. . . . . . 7 ⊢ Ⅎ𝑛𝜑′
11	6, 7, 10	nf3an 1930	. . . . . 6 ⊢ Ⅎ𝑛(𝑃 ∈ 𝐷 ∧ 𝐹 Fn 𝑃 ∧ 𝜑′)
12		bnj919.3	. . . . . . 7 ⊢ (𝜓′ ↔ [𝑃 / 𝑛]𝜓)
13		nfsbc1v 3763	. . . . . . 7 ⊢ Ⅎ𝑛[𝑃 / 𝑛]𝜓
14	12, 13	nfxfr 1882	. . . . . 6 ⊢ Ⅎ𝑛𝜓′
15	11, 14	nfan 1928	. . . . 5 ⊢ Ⅎ𝑛((𝑃 ∈ 𝐷 ∧ 𝐹 Fn 𝑃 ∧ 𝜑′) ∧ 𝜓′)
16	5, 15	nfxfr 1882	. . . 4 ⊢ Ⅎ𝑛(𝑃 ∈ 𝐷 ∧ 𝐹 Fn 𝑃 ∧ 𝜑′ ∧ 𝜓′)
17		eleq1 2850	. . . . . 6 ⊢ (𝑛 = 𝑃 → (𝑛 ∈ 𝐷 ↔ 𝑃 ∈ 𝐷))
18		fneq2 6627	. . . . . . 7 ⊢ (𝑛 = 𝑃 → (𝐹 Fn 𝑛 ↔ 𝐹 Fn 𝑃))
19		sbceq1a 3754	. . . . . . . 8 ⊢ (𝑛 = 𝑃 → (𝜑 ↔ [𝑃 / 𝑛]𝜑))
20	19, 8	bitr4di 292	. . . . . . 7 ⊢ (𝑛 = 𝑃 → (𝜑 ↔ 𝜑′))
21		sbceq1a 3754	. . . . . . . 8 ⊢ (𝑛 = 𝑃 → (𝜓 ↔ [𝑃 / 𝑛]𝜓))
22	21, 12	bitr4di 292	. . . . . . 7 ⊢ (𝑛 = 𝑃 → (𝜓 ↔ 𝜓′))
23	18, 20, 22	3anbi123d 1463	. . . . . 6 ⊢ (𝑛 = 𝑃 → ((𝐹 Fn 𝑛 ∧ 𝜑 ∧ 𝜓) ↔ (𝐹 Fn 𝑃 ∧ 𝜑′ ∧ 𝜓′)))
24	17, 23	anbi12d 643	. . . . 5 ⊢ (𝑛 = 𝑃 → ((𝑛 ∈ 𝐷 ∧ (𝐹 Fn 𝑛 ∧ 𝜑 ∧ 𝜓)) ↔ (𝑃 ∈ 𝐷 ∧ (𝐹 Fn 𝑃 ∧ 𝜑′ ∧ 𝜓′))))
25		bnj252 35101	. . . . 5 ⊢ ((𝑛 ∈ 𝐷 ∧ 𝐹 Fn 𝑛 ∧ 𝜑 ∧ 𝜓) ↔ (𝑛 ∈ 𝐷 ∧ (𝐹 Fn 𝑛 ∧ 𝜑 ∧ 𝜓)))
26		bnj252 35101	. . . . 5 ⊢ ((𝑃 ∈ 𝐷 ∧ 𝐹 Fn 𝑃 ∧ 𝜑′ ∧ 𝜓′) ↔ (𝑃 ∈ 𝐷 ∧ (𝐹 Fn 𝑃 ∧ 𝜑′ ∧ 𝜓′)))
27	24, 25, 26	3bitr4g 317	. . . 4 ⊢ (𝑛 = 𝑃 → ((𝑛 ∈ 𝐷 ∧ 𝐹 Fn 𝑛 ∧ 𝜑 ∧ 𝜓) ↔ (𝑃 ∈ 𝐷 ∧ 𝐹 Fn 𝑃 ∧ 𝜑′ ∧ 𝜓′)))
28	16, 27	sbciegf 3781	. . 3 ⊢ (𝑃 ∈ V → ([𝑃 / 𝑛](𝑛 ∈ 𝐷 ∧ 𝐹 Fn 𝑛 ∧ 𝜑 ∧ 𝜓) ↔ (𝑃 ∈ 𝐷 ∧ 𝐹 Fn 𝑃 ∧ 𝜑′ ∧ 𝜓′)))
29	4, 28	ax-mp 5	. 2 ⊢ ([𝑃 / 𝑛](𝑛 ∈ 𝐷 ∧ 𝐹 Fn 𝑛 ∧ 𝜑 ∧ 𝜓) ↔ (𝑃 ∈ 𝐷 ∧ 𝐹 Fn 𝑃 ∧ 𝜑′ ∧ 𝜓′))
30	1, 3, 29	3bitri 300	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-10 2175  ax-11 2191  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-ex 1809  df-nf 1813  df-sb 2096  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-sbc 3744  df-fn 6539  df-bnj17 35085

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