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

Theorem iinconst 4962
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 eliin 4956 . . . 4 (𝑦 ∈ V → (𝑦 𝑥𝐴 𝐵 ↔ ∀𝑥𝐴 𝑦𝐵))
21elv 3462 . . 3 (𝑦 𝑥𝐴 𝐵 ↔ ∀𝑥𝐴 𝑦𝐵)
3 r19.3rzv 4460 . . 3 (𝐴 ≠ ∅ → (𝑦𝐵 ↔ ∀𝑥𝐴 𝑦𝐵))
42, 3bitr4id 293 . 2 (𝐴 ≠ ∅ → (𝑦 𝑥𝐴 𝐵𝑦𝐵))
54eqrdv 2763 1 (𝐴 ≠ ∅ → 𝑥𝐴 𝐵 = 𝐵)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 209   = wceq 1563  wcel 2145  wne 2960  wral 3079  Vcvv 3457  c0 4288   ciin 4952
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1818  ax-4 1832  ax-5 1933  ax-6 1990  ax-7 2031  ax-8 2147  ax-9 2155  ax-ext 2737
This theorem depends on definitions:  df-bi 210  df-an 401  df-tru 1566  df-fal 1576  df-ex 1803  df-sb 2094  df-clab 2744  df-cleq 2757  df-clel 2840  df-ne 2961  df-ral 3080  df-v 3459  df-dif 3910  df-nul 4289  df-iin 4954
This theorem is referenced by:  iin0  5323  ptbasfi  23695  iinfconstbas  49696
  Copyright terms: Public domain W3C validator