Theorem nfixp 7813

Description: Bound-variable hypothesis builder for indexed Cartesian product. (Contributed by Mario Carneiro, 15-Oct-2016.)

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 7795	. 2 ⊢ X𝑥 ∈ 𝐴 𝐵 = {𝑧 ∣ (𝑧 Fn {𝑥 ∣ 𝑥 ∈ 𝐴} ∧ ∀𝑥 ∈ 𝐴 (𝑧‘𝑥) ∈ 𝐵)}
2		nfcv 2751	. . . . 5 ⊢ Ⅎ𝑦𝑧
3		nftru 1721	. . . . . . 7 ⊢ Ⅎ𝑥⊤
4		nfcvf 2774	. . . . . . . . 9 ⊢ (¬ ∀𝑦 𝑦 = 𝑥 → Ⅎ𝑦𝑥)
5	4	adantl 481	. . . . . . . 8 ⊢ ((⊤ ∧ ¬ ∀𝑦 𝑦 = 𝑥) → Ⅎ𝑦𝑥)
6		nfixp.1	. . . . . . . . 9 ⊢ Ⅎ𝑦𝐴
7	6	a1i 11	. . . . . . . 8 ⊢ ((⊤ ∧ ¬ ∀𝑦 𝑦 = 𝑥) → Ⅎ𝑦𝐴)
8	5, 7	nfeld 2759	. . . . . . 7 ⊢ ((⊤ ∧ ¬ ∀𝑦 𝑦 = 𝑥) → Ⅎ𝑦 𝑥 ∈ 𝐴)
9	3, 8	nfabd2 2770	. . . . . 6 ⊢ (⊤ → Ⅎ𝑦{𝑥 ∣ 𝑥 ∈ 𝐴})
10	9	trud 1484	. . . . 5 ⊢ Ⅎ𝑦{𝑥 ∣ 𝑥 ∈ 𝐴}
11	2, 10	nffn 5901	. . . 4 ⊢ Ⅎ𝑦 𝑧 Fn {𝑥 ∣ 𝑥 ∈ 𝐴}
12		df-ral 2901	. . . . 5 ⊢ (∀𝑥 ∈ 𝐴 (𝑧‘𝑥) ∈ 𝐵 ↔ ∀𝑥(𝑥 ∈ 𝐴 → (𝑧‘𝑥) ∈ 𝐵))
13	2	a1i 11	. . . . . . . . . 10 ⊢ ((⊤ ∧ ¬ ∀𝑦 𝑦 = 𝑥) → Ⅎ𝑦𝑧)
14	13, 5	nffvd 6112	. . . . . . . . 9 ⊢ ((⊤ ∧ ¬ ∀𝑦 𝑦 = 𝑥) → Ⅎ𝑦(𝑧‘𝑥))
15		nfixp.2	. . . . . . . . . 10 ⊢ Ⅎ𝑦𝐵
16	15	a1i 11	. . . . . . . . 9 ⊢ ((⊤ ∧ ¬ ∀𝑦 𝑦 = 𝑥) → Ⅎ𝑦𝐵)
17	14, 16	nfeld 2759	. . . . . . . 8 ⊢ ((⊤ ∧ ¬ ∀𝑦 𝑦 = 𝑥) → Ⅎ𝑦(𝑧‘𝑥) ∈ 𝐵)
18	8, 17	nfimd 1812	. . . . . . 7 ⊢ ((⊤ ∧ ¬ ∀𝑦 𝑦 = 𝑥) → Ⅎ𝑦(𝑥 ∈ 𝐴 → (𝑧‘𝑥) ∈ 𝐵))
19	3, 18	nfald2 2319	. . . . . 6 ⊢ (⊤ → Ⅎ𝑦∀𝑥(𝑥 ∈ 𝐴 → (𝑧‘𝑥) ∈ 𝐵))
20	19	trud 1484	. . . . 5 ⊢ Ⅎ𝑦∀𝑥(𝑥 ∈ 𝐴 → (𝑧‘𝑥) ∈ 𝐵)
21	12, 20	nfxfr 1771	. . . 4 ⊢ Ⅎ𝑦∀𝑥 ∈ 𝐴 (𝑧‘𝑥) ∈ 𝐵
22	11, 21	nfan 1816	. . 3 ⊢ Ⅎ𝑦(𝑧 Fn {𝑥 ∣ 𝑥 ∈ 𝐴} ∧ ∀𝑥 ∈ 𝐴 (𝑧‘𝑥) ∈ 𝐵)
23	22	nfab 2755	. 2 ⊢ Ⅎ𝑦{𝑧 ∣ (𝑧 Fn {𝑥 ∣ 𝑥 ∈ 𝐴} ∧ ∀𝑥 ∈ 𝐴 (𝑧‘𝑥) ∈ 𝐵)}
24	1, 23	nfcxfr 2749	1 ⊢ Ⅎ𝑦X𝑥 ∈ 𝐴 𝐵

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 383  ∀wal 1473  ⊤wtru 1476  Ⅎwnf 1699   ∈ wcel 1977  {cab 2596  Ⅎwnfc 2738  ∀wral 2896   Fn wfn 5799  ‘cfv 5804  Xcixp 7794

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590

This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-3an 1033  df-tru 1478  df-ex 1696  df-nf 1701  df-sb 1868  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-ral 2901  df-rex 2902  df-rab 2905  df-v 3175  df-dif 3543  df-un 3545  df-in 3547  df-ss 3554  df-nul 3875  df-if 4037  df-sn 4126  df-pr 4128  df-op 4132  df-uni 4373  df-br 4584  df-opab 4644  df-rel 5045  df-cnv 5046  df-co 5047  df-dm 5048  df-iota 5768  df-fun 5806  df-fn 5807  df-fv 5812  df-ixp 7795

This theorem is referenced by:  vonioo  39573