Theorem nfixp 8924

Description: Bound-variable hypothesis builder for indexed Cartesian product. Usage of this theorem is discouraged because it depends on ax-13 2401. Use the weaker nfixpw 8923 when possible. (Contributed by Mario Carneiro, 15-Oct-2016.) (New usage is discouraged.)

Hypotheses

Ref	Expression
nfixp.1	⊢ Ⅎ𝑦𝐴
nfixp.2	⊢ Ⅎ𝑦𝐵

Assertion

Ref	Expression
nfixp	⊢ Ⅎ𝑦X𝑥 ∈ 𝐴 𝐵

Proof of Theorem nfixp

Dummy variable 𝑧 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		df-ixp 8905	. 2 ⊢ X𝑥 ∈ 𝐴 𝐵 = {𝑧 ∣ (𝑧 Fn {𝑥 ∣ 𝑥 ∈ 𝐴} ∧ ∀𝑥 ∈ 𝐴 (𝑧‘𝑥) ∈ 𝐵)}
2		nfcv 2922	. . . . 5 ⊢ Ⅎ𝑦𝑧
3		nftru 1837	. . . . . . 7 ⊢ Ⅎ𝑥⊤
4		nfcvf 2948	. . . . . . . . 9 ⊢ (¬ ∀𝑦 𝑦 = 𝑥 → Ⅎ𝑦𝑥)
5	4	adantl 487	. . . . . . . 8 ⊢ ((⊤ ∧ ¬ ∀𝑦 𝑦 = 𝑥) → Ⅎ𝑦𝑥)
6		nfixp.1	. . . . . . . . 9 ⊢ Ⅎ𝑦𝐴
7	6	a1i 11	. . . . . . . 8 ⊢ ((⊤ ∧ ¬ ∀𝑦 𝑦 = 𝑥) → Ⅎ𝑦𝐴)
8	5, 7	nfeld 2933	. . . . . . 7 ⊢ ((⊤ ∧ ¬ ∀𝑦 𝑦 = 𝑥) → Ⅎ𝑦 𝑥 ∈ 𝐴)
9	3, 8	nfabd2 2945	. . . . . 6 ⊢ (⊤ → Ⅎ𝑦{𝑥 ∣ 𝑥 ∈ 𝐴})
10	9	mptru 1577	. . . . 5 ⊢ Ⅎ𝑦{𝑥 ∣ 𝑥 ∈ 𝐴}
11	2, 10	nffn 6631	. . . 4 ⊢ Ⅎ𝑦 𝑧 Fn {𝑥 ∣ 𝑥 ∈ 𝐴}
12		df-ral 3077	. . . . 5 ⊢ (∀𝑥 ∈ 𝐴 (𝑧‘𝑥) ∈ 𝐵 ↔ ∀𝑥(𝑥 ∈ 𝐴 → (𝑧‘𝑥) ∈ 𝐵))
13	2	a1i 11	. . . . . . . . . 10 ⊢ ((⊤ ∧ ¬ ∀𝑦 𝑦 = 𝑥) → Ⅎ𝑦𝑧)
14	13, 5	nffvd 6890	. . . . . . . . 9 ⊢ ((⊤ ∧ ¬ ∀𝑦 𝑦 = 𝑥) → Ⅎ𝑦(𝑧‘𝑥))
15		nfixp.2	. . . . . . . . . 10 ⊢ Ⅎ𝑦𝐵
16	15	a1i 11	. . . . . . . . 9 ⊢ ((⊤ ∧ ¬ ∀𝑦 𝑦 = 𝑥) → Ⅎ𝑦𝐵)
17	14, 16	nfeld 2933	. . . . . . . 8 ⊢ ((⊤ ∧ ¬ ∀𝑦 𝑦 = 𝑥) → Ⅎ𝑦(𝑧‘𝑥) ∈ 𝐵)
18	8, 17	nfimd 1927	. . . . . . 7 ⊢ ((⊤ ∧ ¬ ∀𝑦 𝑦 = 𝑥) → Ⅎ𝑦(𝑥 ∈ 𝐴 → (𝑧‘𝑥) ∈ 𝐵))
19	3, 18	nfald2 2474	. . . . . 6 ⊢ (⊤ → Ⅎ𝑦∀𝑥(𝑥 ∈ 𝐴 → (𝑧‘𝑥) ∈ 𝐵))
20	19	mptru 1577	. . . . 5 ⊢ Ⅎ𝑦∀𝑥(𝑥 ∈ 𝐴 → (𝑧‘𝑥) ∈ 𝐵)
21	12, 20	nfxfr 1886	. . . 4 ⊢ Ⅎ𝑦∀𝑥 ∈ 𝐴 (𝑧‘𝑥) ∈ 𝐵
22	11, 21	nfan 1932	. . 3 ⊢ Ⅎ𝑦(𝑧 Fn {𝑥 ∣ 𝑥 ∈ 𝐴} ∧ ∀𝑥 ∈ 𝐴 (𝑧‘𝑥) ∈ 𝐵)
23	22	nfab 2928	. 2 ⊢ Ⅎ𝑦{𝑧 ∣ (𝑧 Fn {𝑥 ∣ 𝑥 ∈ 𝐴} ∧ ∀𝑥 ∈ 𝐴 (𝑧‘𝑥) ∈ 𝐵)}
24	1, 23	nfcxfr 2920	1 ⊢ Ⅎ𝑦X𝑥 ∈ 𝐴 𝐵

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ∧ wa 401  ∀wal 1568  ⊤wtru 1571  Ⅎwnf 1816   ∈ wcel 2145  {cab 2738  Ⅎwnfc 2907  ∀wral 3076   Fn wfn 6528  ‘cfv 6533  Xcixp 8904

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 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-13 2401  ax-ext 2732

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 2100  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-dif 3902  df-un 3904  df-ss 3916  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-br 5104  df-opab 5168  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-iota 6489  df-fun 6535  df-fn 6536  df-fv 6541  df-ixp 8905

This theorem is used by: (None)