Theorem nfiing 5024

Description: Bound-variable hypothesis builder for indexed intersection. Usage of this theorem is discouraged because it depends on ax-13 2366. See nfiin 5022 for a version with more disjoint variable conditions, but not requiring ax-13 2366. (Contributed by Mario Carneiro, 25-Jan-2014.) (New usage is discouraged.)

Hypotheses

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

Assertion

Ref	Expression
nfiing	⊢ Ⅎ𝑦∩ 𝑥 ∈ 𝐴 𝐵

Proof of Theorem nfiing

Dummy variable 𝑧 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		df-iin 4994	. 2 ⊢ ∩ 𝑥 ∈ 𝐴 𝐵 = {𝑧 ∣ ∀𝑥 ∈ 𝐴 𝑧 ∈ 𝐵}
2		nfiung.1	. . . 4 ⊢ Ⅎ𝑦𝐴
3		nfiung.2	. . . . 5 ⊢ Ⅎ𝑦𝐵
4	3	nfcri 2885	. . . 4 ⊢ Ⅎ𝑦 𝑧 ∈ 𝐵
5	2, 4	nfral 3365	. . 3 ⊢ Ⅎ𝑦∀𝑥 ∈ 𝐴 𝑧 ∈ 𝐵
6	5	nfabg 2905	. 2 ⊢ Ⅎ𝑦{𝑧 ∣ ∀𝑥 ∈ 𝐴 𝑧 ∈ 𝐵}
7	1, 6	nfcxfr 2896	1 ⊢ Ⅎ𝑦∩ 𝑥 ∈ 𝐴 𝐵

Syntax hints:   ∈ wcel 2099  {cab 2704  Ⅎwnfc 2878  ∀wral 3056  ∩ ciin 4992

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1790  ax-4 1804  ax-5 1906  ax-6 1964  ax-7 2004  ax-8 2101  ax-9 2109  ax-10 2130  ax-11 2147  ax-12 2164  ax-13 2366  ax-ext 2698

This theorem depends on definitions:  df-bi 206  df-an 396  df-or 847  df-tru 1537  df-ex 1775  df-nf 1779  df-sb 2061  df-clab 2705  df-cleq 2719  df-clel 2805  df-nfc 2880  df-ral 3057  df-iin 4994

This theorem is referenced by: (None)