Theorem nfsbxyt 2003

Description: Closed form of nfsbxy 2002. (Contributed by Jim Kingdon, 9-May-2018.)

Assertion

Ref	Expression
nfsbxyt	⊢ (∀𝑥Ⅎ𝑧𝜑 → Ⅎ𝑧[𝑦 / 𝑥]𝜑)

Distinct variable groups:   𝑥,𝑦   𝑦,𝑧

Allowed substitution hints:   𝜑(𝑥, 𝑦, 𝑧)

Proof of Theorem nfsbxyt

Step	Hyp	Ref	Expression
1		ax-bndl 1562	. 2 ⊢ (∀𝑧 𝑧 = 𝑥 ∨ (∀𝑧 𝑧 = 𝑦 ∨ ∀𝑥∀𝑧(𝑥 = 𝑦 → ∀𝑧 𝑥 = 𝑦)))
2		nfs1v 1999	. . . . 5 ⊢ Ⅎ𝑧[𝑦 / 𝑧]𝜑
3		drsb1 1852	. . . . . 6 ⊢ (∀𝑧 𝑧 = 𝑥 → ([𝑦 / 𝑧]𝜑 ↔ [𝑦 / 𝑥]𝜑))
4	3	drnf2 1787	. . . . 5 ⊢ (∀𝑧 𝑧 = 𝑥 → (Ⅎ𝑧[𝑦 / 𝑧]𝜑 ↔ Ⅎ𝑧[𝑦 / 𝑥]𝜑))
5	2, 4	mpbii 148	. . . 4 ⊢ (∀𝑧 𝑧 = 𝑥 → Ⅎ𝑧[𝑦 / 𝑥]𝜑)
6	5	a1d 22	. . 3 ⊢ (∀𝑧 𝑧 = 𝑥 → (∀𝑥Ⅎ𝑧𝜑 → Ⅎ𝑧[𝑦 / 𝑥]𝜑))
7		a16nf 1919	. . . . 5 ⊢ (∀𝑧 𝑧 = 𝑦 → Ⅎ𝑧[𝑦 / 𝑥]𝜑)
8	7	a1d 22	. . . 4 ⊢ (∀𝑧 𝑧 = 𝑦 → (∀𝑥Ⅎ𝑧𝜑 → Ⅎ𝑧[𝑦 / 𝑥]𝜑))
9		df-nf 1514	. . . . . 6 ⊢ (Ⅎ𝑧 𝑥 = 𝑦 ↔ ∀𝑧(𝑥 = 𝑦 → ∀𝑧 𝑥 = 𝑦))
10	9	albii 1523	. . . . 5 ⊢ (∀𝑥Ⅎ𝑧 𝑥 = 𝑦 ↔ ∀𝑥∀𝑧(𝑥 = 𝑦 → ∀𝑧 𝑥 = 𝑦))
11		sb5 1942	. . . . . . 7 ⊢ ([𝑦 / 𝑥]𝜑 ↔ ∃𝑥(𝑥 = 𝑦 ∧ 𝜑))
12		nfa1 1594	. . . . . . . . 9 ⊢ Ⅎ𝑥∀𝑥Ⅎ𝑧 𝑥 = 𝑦
13		nfa1 1594	. . . . . . . . 9 ⊢ Ⅎ𝑥∀𝑥Ⅎ𝑧𝜑
14	12, 13	nfan 1618	. . . . . . . 8 ⊢ Ⅎ𝑥(∀𝑥Ⅎ𝑧 𝑥 = 𝑦 ∧ ∀𝑥Ⅎ𝑧𝜑)
15		sp 1564	. . . . . . . . . 10 ⊢ (∀𝑥Ⅎ𝑧 𝑥 = 𝑦 → Ⅎ𝑧 𝑥 = 𝑦)
16	15	adantr 276	. . . . . . . . 9 ⊢ ((∀𝑥Ⅎ𝑧 𝑥 = 𝑦 ∧ ∀𝑥Ⅎ𝑧𝜑) → Ⅎ𝑧 𝑥 = 𝑦)
17		sp 1564	. . . . . . . . . 10 ⊢ (∀𝑥Ⅎ𝑧𝜑 → Ⅎ𝑧𝜑)
18	17	adantl 277	. . . . . . . . 9 ⊢ ((∀𝑥Ⅎ𝑧 𝑥 = 𝑦 ∧ ∀𝑥Ⅎ𝑧𝜑) → Ⅎ𝑧𝜑)
19	16, 18	nfand 1621	. . . . . . . 8 ⊢ ((∀𝑥Ⅎ𝑧 𝑥 = 𝑦 ∧ ∀𝑥Ⅎ𝑧𝜑) → Ⅎ𝑧(𝑥 = 𝑦 ∧ 𝜑))
20	14, 19	nfexd 1814	. . . . . . 7 ⊢ ((∀𝑥Ⅎ𝑧 𝑥 = 𝑦 ∧ ∀𝑥Ⅎ𝑧𝜑) → Ⅎ𝑧∃𝑥(𝑥 = 𝑦 ∧ 𝜑))
21	11, 20	nfxfrd 1528	. . . . . 6 ⊢ ((∀𝑥Ⅎ𝑧 𝑥 = 𝑦 ∧ ∀𝑥Ⅎ𝑧𝜑) → Ⅎ𝑧[𝑦 / 𝑥]𝜑)
22	21	ex 115	. . . . 5 ⊢ (∀𝑥Ⅎ𝑧 𝑥 = 𝑦 → (∀𝑥Ⅎ𝑧𝜑 → Ⅎ𝑧[𝑦 / 𝑥]𝜑))
23	10, 22	sylbir 135	. . . 4 ⊢ (∀𝑥∀𝑧(𝑥 = 𝑦 → ∀𝑧 𝑥 = 𝑦) → (∀𝑥Ⅎ𝑧𝜑 → Ⅎ𝑧[𝑦 / 𝑥]𝜑))
24	8, 23	jaoi 728	. . 3 ⊢ ((∀𝑧 𝑧 = 𝑦 ∨ ∀𝑥∀𝑧(𝑥 = 𝑦 → ∀𝑧 𝑥 = 𝑦)) → (∀𝑥Ⅎ𝑧𝜑 → Ⅎ𝑧[𝑦 / 𝑥]𝜑))
25	6, 24	jaoi 728	. 2 ⊢ ((∀𝑧 𝑧 = 𝑥 ∨ (∀𝑧 𝑧 = 𝑦 ∨ ∀𝑥∀𝑧(𝑥 = 𝑦 → ∀𝑧 𝑥 = 𝑦))) → (∀𝑥Ⅎ𝑧𝜑 → Ⅎ𝑧[𝑦 / 𝑥]𝜑))
26	1, 25	ax-mp 5	1 ⊢ (∀𝑥Ⅎ𝑧𝜑 → Ⅎ𝑧[𝑦 / 𝑥]𝜑)

This proof depends on syntax axioms:   → wi 4   ∧ wa 104   ∨ wo 720  ∀wal 1400  Ⅎwnf 1513  ∃wex 1545  [wsb 1815

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

This proof depends on definitions:  df-bi 117  df-nf 1514  df-sb 1816

This theorem is used by:  nfsbt  2036