MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  nfiin Structured version   Visualization version   GIF version

Theorem nfiin 4988
Description: Bound-variable hypothesis builder for indexed intersection. (Contributed by Mario Carneiro, 25-Jan-2014.) Add disjoint variable condition to avoid ax-13 2404. See nfiing 4990 for a less restrictive version requiring more axioms. (Revised by GG, 20-Jan-2024.)
Hypotheses
Ref Expression
nfiun.1 Ⅎ𝑦𝐴
nfiun.2 Ⅎ𝑦𝐵
Assertion
Ref Expression
nfiin Ⅎ𝑦∩ 𝑥 ∈ 𝐴 𝐵
Distinct variable group:   𝑥,𝑦
Allowed substitution hints:   𝐴(𝑥, 𝑦)   𝐵(𝑥, 𝑦)

Proof of Theorem nfiin
Dummy variable 𝑧 is distinct from all other variables.
StepHypRef Expression
1 df-iin 4959 . 2 ∩ 𝑥 ∈ 𝐴 𝐵 = {𝑧 ∣ ∀𝑥 ∈ 𝐴 𝑧 ∈ 𝐵}
2 nfiun.1 . . . 4 Ⅎ𝑦𝐴
3 nfiun.2 . . . . 5 Ⅎ𝑦𝐵
43nfcri 2918 . . . 4 Ⅎ𝑦 𝑧 ∈ 𝐵
52, 4nfralw 3313 . . 3 Ⅎ𝑦∀𝑥 ∈ 𝐴 𝑧 ∈ 𝐵
65nfab 2932 . 2 Ⅎ𝑦{𝑧 ∣ ∀𝑥 ∈ 𝐴 𝑧 ∈ 𝐵}
71, 6nfcxfr 2924 1 Ⅎ𝑦∩ 𝑥 ∈ 𝐴 𝐵
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   ∈ wcel 2147  {cab 2741  Ⅎwnfc 2911  ∀wral 3080  ∩ ciin 4957
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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735
This proof depends on definitions:  df-bi 210  df-an 402  df-ex 1813  df-nf 1817  df-sb 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ral 3081  df-iin 4959
This theorem is used by:  iinab  5031  fnlimcnv  47011  fnlimfvre  47018  fnlimabslt  47023  iinhoiicc  48018  preimageiingt  48064  preimaleiinlt  48065  smflimlem6  48120  smflim  48121  smflim2  48150  smfsup  48158  smfsupmpt  48159  smfsupxr  48160  smfinflem  48161  smfinf  48162  smflimsup  48172  smfliminf  48175  fsupdm  48186  finfdm  48190
  Copyright terms: Public domain W3C validator