Users' Mathboxes Mathbox for Glauco Siliprandi < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  iunssd Structured version   Visualization version   GIF version

Theorem iunssd 39770
Description: Subset theorem for an indexed union. (Contributed by Glauco Siliprandi, 8-Apr-2021.)
Hypothesis
Ref Expression
iunssd.1 ((𝜑𝑥𝐴) → 𝐵𝐶)
Assertion
Ref Expression
iunssd (𝜑 𝑥𝐴 𝐵𝐶)
Distinct variable groups:   𝑥,𝐶   𝜑,𝑥
Allowed substitution hints:   𝐴(𝑥)   𝐵(𝑥)

Proof of Theorem iunssd
StepHypRef Expression
1 iunssd.1 . . 3 ((𝜑𝑥𝐴) → 𝐵𝐶)
21ralrimiva 3104 . 2 (𝜑 → ∀𝑥𝐴 𝐵𝐶)
3 iunss 4713 . 2 ( 𝑥𝐴 𝐵𝐶 ↔ ∀𝑥𝐴 𝐵𝐶)
42, 3sylibr 224 1 (𝜑 𝑥𝐴 𝐵𝐶)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 383  wcel 2139  wral 3050  wss 3715   ciun 4672
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1871  ax-4 1886  ax-5 1988  ax-6 2054  ax-7 2090  ax-9 2148  ax-10 2168  ax-11 2183  ax-12 2196  ax-13 2391  ax-ext 2740
This theorem depends on definitions:  df-bi 197  df-or 384  df-an 385  df-tru 1635  df-ex 1854  df-nf 1859  df-sb 2047  df-clab 2747  df-cleq 2753  df-clel 2756  df-nfc 2891  df-ral 3055  df-rex 3056  df-v 3342  df-in 3722  df-ss 3729  df-iun 4674
This theorem is referenced by:  meaiininclem  41206  smflim  41491  smfresal  41501  smfmullem4  41507
  Copyright terms: Public domain W3C validator