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

Theorem dfiin2 4708
 Description: Alternate definition of indexed intersection when 𝐵 is a set. Definition 15(b) of [Suppes] p. 44. (Contributed by NM, 28-Jun-1998.) (Proof shortened by Andrew Salmon, 25-Jul-2011.)
Hypothesis
Ref Expression
dfiun2.1 𝐵 ∈ V
Assertion
Ref Expression
dfiin2 𝑥𝐴 𝐵 = {𝑦 ∣ ∃𝑥𝐴 𝑦 = 𝐵}
Distinct variable groups:   𝑥,𝑦   𝑦,𝐴   𝑦,𝐵
Allowed substitution hints:   𝐴(𝑥)   𝐵(𝑥)

Proof of Theorem dfiin2
StepHypRef Expression
1 dfiin2g 4706 . 2 (∀𝑥𝐴 𝐵 ∈ V → 𝑥𝐴 𝐵 = {𝑦 ∣ ∃𝑥𝐴 𝑦 = 𝐵})
2 dfiun2.1 . . 3 𝐵 ∈ V
32a1i 11 . 2 (𝑥𝐴𝐵 ∈ V)
41, 3mprg 3065 1 𝑥𝐴 𝐵 = {𝑦 ∣ ∃𝑥𝐴 𝑦 = 𝐵}
 Colors of variables: wff setvar class Syntax hints:   = wceq 1632   ∈ wcel 2140  {cab 2747  ∃wrex 3052  Vcvv 3341  ∩ cint 4628  ∩ ciin 4674 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1871  ax-4 1886  ax-5 1989  ax-6 2055  ax-7 2091  ax-9 2149  ax-10 2169  ax-11 2184  ax-12 2197  ax-13 2392  ax-ext 2741 This theorem depends on definitions:  df-bi 197  df-or 384  df-an 385  df-tru 1635  df-ex 1854  df-nf 1859  df-sb 2048  df-clab 2748  df-cleq 2754  df-clel 2757  df-nfc 2892  df-ral 3056  df-rex 3057  df-v 3343  df-int 4629  df-iin 4676 This theorem is referenced by:  fniinfv  6421  scott0  8925  cfval2  9295  cflim3  9297  cflim2  9298  cfss  9300  hauscmplem  21432  ptbasfi  21607  dihglblem5  37108  dihglb2  37152  intima0  38460
 Copyright terms: Public domain W3C validator