Theorem nfin 4174

Description: Bound-variable hypothesis builder for the intersection of classes. (Contributed by NM, 15-Sep-2003.) (Revised by Mario Carneiro, 14-Oct-2016.) Avoid ax-10 2146, ax-11 2162, ax-12 2182. (Revised by SN, 14-May-2025.)

Hypotheses

Ref	Expression
nfin.1	⊢ Ⅎ𝑥𝐴
nfin.2	⊢ Ⅎ𝑥𝐵

Assertion

Ref	Expression
nfin	⊢ Ⅎ𝑥(𝐴 ∩ 𝐵)

Proof of Theorem nfin

Dummy variable 𝑦 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		elin 3915	. . 3 ⊢ (𝑦 ∈ (𝐴 ∩ 𝐵) ↔ (𝑦 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵))
2		nfin.1	. . . . 5 ⊢ Ⅎ𝑥𝐴
3	2	nfcri 2888	. . . 4 ⊢ Ⅎ𝑥 𝑦 ∈ 𝐴
4		nfin.2	. . . . 5 ⊢ Ⅎ𝑥𝐵
5	4	nfcri 2888	. . . 4 ⊢ Ⅎ𝑥 𝑦 ∈ 𝐵
6	3, 5	nfan 1900	. . 3 ⊢ Ⅎ𝑥(𝑦 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵)
7	1, 6	nfxfr 1854	. 2 ⊢ Ⅎ𝑥 𝑦 ∈ (𝐴 ∩ 𝐵)
8	7	nfci 2884	1 ⊢ Ⅎ𝑥(𝐴 ∩ 𝐵)

Syntax hints:   ∧ wa 395   ∈ wcel 2113  Ⅎwnfc 2881   ∩ cin 3898

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-ext 2706

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-tru 1544  df-ex 1781  df-nf 1785  df-sb 2068  df-clab 2713  df-cleq 2726  df-clel 2809  df-nfc 2883  df-v 3440  df-in 3906

This theorem is referenced by:  inn0f  4321  csbin  4392  iunxdif3  5048  disjxun  5094  nfres  5938  nfpred  6262  cp  9801  tskwe  9860  iunconn  23370  ptclsg  23557  restmetu  24512  limciun  25849  disjunsn  32618  ordtconnlem1  34030  esum2d  34199  finminlem  36461  bj-rcleqf  37169  mbfposadd  37807  iunconnlem2  45117  disjrnmpt2  45374  disjinfi  45378  fsumiunss  45763  stoweidlem57  46243  fourierdlem80  46372  sge0iunmptlemre  46601  iundjiun  46646  pimiooltgt  46896  smflim  46963  smfpimcclem  46993  smfpimcc  46994  adddmmbl  47019  adddmmbl2  47020  muldmmbl  47021  muldmmbl2  47022  smfdivdmmbl2  47027