New Foundations Explorer < Previous   Next > Nearby theorems Mirrors  >  Home  >  NFE Home  >  Th. List  >  iinconst Unicode version

Theorem iinconst 3978
 Description: Indexed intersection of a constant class, i.e. where does not depend on . (Contributed by Mario Carneiro, 6-Feb-2015.)
Assertion
Ref Expression
iinconst
Distinct variable groups:   ,   ,

Proof of Theorem iinconst
Dummy variable is distinct from all other variables.
StepHypRef Expression
1 r19.3rzv 3643 . . 3
2 vex 2862 . . . 4
3 eliin 3974 . . . 4
42, 3ax-mp 5 . . 3
51, 4syl6rbbr 255 . 2
65eqrdv 2351 1
 Colors of variables: wff setvar class Syntax hints:   wi 4   wb 176   wceq 1642   wcel 1710   wne 2516  wral 2614  cvv 2859  c0 3550  ciin 3970 This theorem was proved from 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 theorem depends on definitions:  df-bi 177  df-or 359  df-an 360  df-nan 1288  df-tru 1319  df-ex 1542  df-nf 1545  df-sb 1649  df-clab 2340  df-cleq 2346  df-clel 2349  df-nfc 2478  df-ne 2518  df-ral 2619  df-v 2861  df-nin 3211  df-compl 3212  df-in 3213  df-dif 3215  df-nul 3551  df-iin 3972 This theorem is referenced by: (None)
 Copyright terms: Public domain W3C validator