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

Theorem iinconst 4939
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 4934 . . . 4 (𝑦 ∈ V → (𝑦 𝑥𝐴 𝐵 ↔ ∀𝑥𝐴 𝑦𝐵))
21elv 3436 . . 3 (𝑦 𝑥𝐴 𝐵 ↔ ∀𝑥𝐴 𝑦𝐵)
3 r19.3rzv 4434 . . 3 (𝐴 ≠ ∅ → (𝑦𝐵 ↔ ∀𝑥𝐴 𝑦𝐵))
42, 3bitr4id 289 . 2 (𝐴 ≠ ∅ → (𝑦 𝑥𝐴 𝐵𝑦𝐵))
54eqrdv 2737 1 (𝐴 ≠ ∅ → 𝑥𝐴 𝐵 = 𝐵)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 205   = wceq 1541  wcel 2109  wne 2944  wral 3065  Vcvv 3430  c0 4261   ciin 4930
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1801  ax-4 1815  ax-5 1916  ax-6 1974  ax-7 2014  ax-8 2111  ax-9 2119  ax-12 2174  ax-ext 2710
This theorem depends on definitions:  df-bi 206  df-an 396  df-tru 1544  df-fal 1554  df-ex 1786  df-nf 1790  df-sb 2071  df-clab 2717  df-cleq 2731  df-clel 2817  df-ne 2945  df-ral 3070  df-v 3432  df-dif 3894  df-nul 4262  df-iin 4932
This theorem is referenced by:  iin0  5287  ptbasfi  22713
  Copyright terms: Public domain W3C validator