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

Theorem dfiin2 5037
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 5035 . 2 (∀𝑥𝐴 𝐵 ∈ V → 𝑥𝐴 𝐵 = {𝑦 ∣ ∃𝑥𝐴 𝑦 = 𝐵})
2 dfiun2.1 . . 3 𝐵 ∈ V
32a1i 11 . 2 (𝑥𝐴𝐵 ∈ V)
41, 3mprg 3064 1 𝑥𝐴 𝐵 = {𝑦 ∣ ∃𝑥𝐴 𝑦 = 𝐵}
Colors of variables: wff setvar class
Syntax hints:   = wceq 1534  wcel 2099  {cab 2705  wrex 3067  Vcvv 3471   cint 4949   ciin 4997
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1790  ax-4 1804  ax-5 1906  ax-6 1964  ax-7 2004  ax-8 2101  ax-9 2109  ax-11 2147  ax-ext 2699
This theorem depends on definitions:  df-bi 206  df-an 396  df-tru 1537  df-ex 1775  df-sb 2061  df-clab 2706  df-cleq 2720  df-clel 2806  df-ral 3059  df-rex 3068  df-v 3473  df-int 4950  df-iin 4999
This theorem is referenced by:  fniinfv  6976  scott0  9910  cfval2  10284  cflim3  10286  cflim2  10287  cfss  10289  hauscmplem  23323  ptbasfi  23498  dihglblem5  40771  dihglb2  40815  intima0  43078
  Copyright terms: Public domain W3C validator