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

Theorem dfiin3g 5801
 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 4919 . 2 (∀𝑥𝐴 𝐵𝐶 𝑥𝐴 𝐵 = {𝑦 ∣ ∃𝑥𝐴 𝑦 = 𝐵})
2 eqid 2798 . . . 4 (𝑥𝐴𝐵) = (𝑥𝐴𝐵)
32rnmpt 5791 . . 3 ran (𝑥𝐴𝐵) = {𝑦 ∣ ∃𝑥𝐴 𝑦 = 𝐵}
43inteqi 4842 . 2 ran (𝑥𝐴𝐵) = {𝑦 ∣ ∃𝑥𝐴 𝑦 = 𝐵}
51, 4eqtr4di 2851 1 (∀𝑥𝐴 𝐵𝐶 𝑥𝐴 𝐵 = ran (𝑥𝐴𝐵))
 Colors of variables: wff setvar class Syntax hints:   → wi 4   = wceq 1538   ∈ wcel 2111  {cab 2776  ∀wral 3106  ∃wrex 3107  ∩ cint 4838  ∩ ciin 4882   ↦ cmpt 5110  ran crn 5520 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2113  ax-9 2121  ax-10 2142  ax-11 2158  ax-12 2175  ax-ext 2770  ax-sep 5167  ax-nul 5174  ax-pr 5295 This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3an 1086  df-tru 1541  df-ex 1782  df-nf 1786  df-sb 2070  df-mo 2598  df-eu 2629  df-clab 2777  df-cleq 2791  df-clel 2870  df-nfc 2938  df-ral 3111  df-rex 3112  df-v 3443  df-dif 3884  df-un 3886  df-in 3888  df-ss 3898  df-nul 4244  df-if 4426  df-sn 4526  df-pr 4528  df-op 4532  df-int 4839  df-iin 4884  df-br 5031  df-opab 5093  df-mpt 5111  df-cnv 5527  df-dm 5529  df-rn 5530 This theorem is referenced by:  dfiin3  5803  riinint  5804  iinon  7962  cmpfi  22020
 Copyright terms: Public domain W3C validator