Theorem nfiin 3997

Description: Bound-variable hypothesis builder for indexed intersection. (Contributed by Mario Carneiro, 25-Jan-2014.)

Hypotheses

Ref	Expression
nfiun.1	⊢ ℲyA
nfiun.2	⊢ ℲyB

Assertion

Ref	Expression
nfiin	⊢ Ⅎy∩x ∈ A B

Proof of Theorem nfiin

Dummy variable z is distinct from all other variables.

Step	Hyp	Ref	Expression
1		df-iin 3973	. 2 ⊢ ∩x ∈ A B = {z ∣ ∀x ∈ A z ∈ B}
2		nfiun.1	. . . 4 ⊢ ℲyA
3		nfiun.2	. . . . 5 ⊢ ℲyB
4	3	nfcri 2484	. . . 4 ⊢ Ⅎy z ∈ B
5	2, 4	nfral 2668	. . 3 ⊢ Ⅎy∀x ∈ A z ∈ B
6	5	nfab 2494	. 2 ⊢ Ⅎy{z ∣ ∀x ∈ A z ∈ B}
7	1, 6	nfcxfr 2487	1 ⊢ Ⅎy∩x ∈ A B

This proof depends on syntax axioms:   ∈ wcel 1710  {cab 2339  Ⅎwnfc 2477  ∀wral 2615  ∩ciin 3971

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1546  ax-5 1557  ax-17 1616  ax-9 1654  ax-8 1675  ax-6 1729  ax-7 1734  ax-11 1746  ax-12 1925  ax-ext 2334

This proof depends on definitions:  df-bi 177  df-or 359  df-an 360  df-tru 1319  df-ex 1542  df-nf 1545  df-sb 1649  df-clab 2340  df-cleq 2346  df-clel 2349  df-nfc 2479  df-ral 2620  df-iin 3973

This theorem is used by:  iinab  4028