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

Theorem dfiin3g 5283
Description: Alternate definition of indexed intersection when 𝐵 is a set. (Contributed by Mario Carneiro, 31-Aug-2015.)
Assertion
Ref Expression
dfiin3g (∀𝑥𝐴 𝐵𝐶 𝑥𝐴 𝐵 = ran (𝑥𝐴𝐵))

Proof of Theorem dfiin3g
Dummy variable 𝑦 is distinct from all other variables.
StepHypRef Expression
1 dfiin2g 4479 . 2 (∀𝑥𝐴 𝐵𝐶 𝑥𝐴 𝐵 = {𝑦 ∣ ∃𝑥𝐴 𝑦 = 𝐵})
2 eqid 2605 . . . 4 (𝑥𝐴𝐵) = (𝑥𝐴𝐵)
32rnmpt 5275 . . 3 ran (𝑥𝐴𝐵) = {𝑦 ∣ ∃𝑥𝐴 𝑦 = 𝐵}
43inteqi 4404 . 2 ran (𝑥𝐴𝐵) = {𝑦 ∣ ∃𝑥𝐴 𝑦 = 𝐵}
51, 4syl6eqr 2657 1 (∀𝑥𝐴 𝐵𝐶 𝑥𝐴 𝐵 = ran (𝑥𝐴𝐵))
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1474  wcel 1975  {cab 2591  wral 2891  wrex 2892   cint 4400   ciin 4446  cmpt 4633  ran crn 5025
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1711  ax-4 1726  ax-5 1825  ax-6 1873  ax-7 1920  ax-9 1984  ax-10 2004  ax-11 2019  ax-12 2031  ax-13 2228  ax-ext 2585  ax-sep 4699  ax-nul 4708  ax-pr 4824
This theorem depends on definitions:  df-bi 195  df-or 383  df-an 384  df-3an 1032  df-tru 1477  df-ex 1695  df-nf 1700  df-sb 1866  df-eu 2457  df-mo 2458  df-clab 2592  df-cleq 2598  df-clel 2601  df-nfc 2735  df-ral 2896  df-rex 2897  df-rab 2900  df-v 3170  df-dif 3538  df-un 3540  df-in 3542  df-ss 3549  df-nul 3870  df-if 4032  df-sn 4121  df-pr 4123  df-op 4127  df-int 4401  df-iin 4448  df-br 4574  df-opab 4634  df-mpt 4635  df-cnv 5032  df-dm 5034  df-rn 5035
This theorem is referenced by:  dfiin3  5285  riinint  5286  iinon  7297  cmpfi  20959
  Copyright terms: Public domain W3C validator