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

Theorem nfiing 4990
Description: Bound-variable hypothesis builder for indexed intersection. Usage of this theorem is discouraged because it depends on ax-13 2404. See nfiin 4988 for a version with more disjoint variable conditions, but not requiring ax-13 2404. (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.
StepHypRef Expression
1 df-iin 4959 . 2 ∩ 𝑥 ∈ 𝐴 𝐵 = {𝑧 ∣ ∀𝑥 ∈ 𝐴 𝑧 ∈ 𝐵}
2 nfiung.1 . . . 4 Ⅎ𝑦𝐴
3 nfiung.2 . . . . 5 Ⅎ𝑦𝐵
43nfcri 2918 . . . 4 Ⅎ𝑦 𝑧 ∈ 𝐵
52, 4nfral 3363 . . 3 Ⅎ𝑦∀𝑥 ∈ 𝐴 𝑧 ∈ 𝐵
65nfabg 2933 . 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-13 2404  ax-ext 2735
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-tru 1573  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: (None)
  Copyright terms: Public domain W3C validator