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

Theorem iunssf 39577
Description: Subset theorem for an indexed union. (Contributed by Glauco Siliprandi, 3-Mar-2021.)
Hypothesis
Ref Expression
iunssf.1 𝑥𝐶
Assertion
Ref Expression
iunssf ( 𝑥𝐴 𝐵𝐶 ↔ ∀𝑥𝐴 𝐵𝐶)

Proof of Theorem iunssf
Dummy variable 𝑦 is distinct from all other variables.
StepHypRef Expression
1 df-iun 4554 . . 3 𝑥𝐴 𝐵 = {𝑦 ∣ ∃𝑥𝐴 𝑦𝐵}
21sseq1i 3662 . 2 ( 𝑥𝐴 𝐵𝐶 ↔ {𝑦 ∣ ∃𝑥𝐴 𝑦𝐵} ⊆ 𝐶)
3 abss 3704 . 2 ({𝑦 ∣ ∃𝑥𝐴 𝑦𝐵} ⊆ 𝐶 ↔ ∀𝑦(∃𝑥𝐴 𝑦𝐵𝑦𝐶))
4 dfss2 3624 . . . 4 (𝐵𝐶 ↔ ∀𝑦(𝑦𝐵𝑦𝐶))
54ralbii 3009 . . 3 (∀𝑥𝐴 𝐵𝐶 ↔ ∀𝑥𝐴𝑦(𝑦𝐵𝑦𝐶))
6 ralcom4 3255 . . 3 (∀𝑥𝐴𝑦(𝑦𝐵𝑦𝐶) ↔ ∀𝑦𝑥𝐴 (𝑦𝐵𝑦𝐶))
7 iunssf.1 . . . . . 6 𝑥𝐶
87nfcri 2787 . . . . 5 𝑥 𝑦𝐶
98r19.23 3051 . . . 4 (∀𝑥𝐴 (𝑦𝐵𝑦𝐶) ↔ (∃𝑥𝐴 𝑦𝐵𝑦𝐶))
109albii 1787 . . 3 (∀𝑦𝑥𝐴 (𝑦𝐵𝑦𝐶) ↔ ∀𝑦(∃𝑥𝐴 𝑦𝐵𝑦𝐶))
115, 6, 103bitrri 287 . 2 (∀𝑦(∃𝑥𝐴 𝑦𝐵𝑦𝐶) ↔ ∀𝑥𝐴 𝐵𝐶)
122, 3, 113bitri 286 1 ( 𝑥𝐴 𝐵𝐶 ↔ ∀𝑥𝐴 𝐵𝐶)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 196  wal 1521  wcel 2030  {cab 2637  wnfc 2780  wral 2941  wrex 2942  wss 3607   ciun 4552
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1762  ax-4 1777  ax-5 1879  ax-6 1945  ax-7 1981  ax-9 2039  ax-10 2059  ax-11 2074  ax-12 2087  ax-13 2282  ax-ext 2631
This theorem depends on definitions:  df-bi 197  df-or 384  df-an 385  df-tru 1526  df-ex 1745  df-nf 1750  df-sb 1938  df-clab 2638  df-cleq 2644  df-clel 2647  df-nfc 2782  df-ral 2946  df-rex 2947  df-v 3233  df-in 3614  df-ss 3621  df-iun 4554
This theorem is referenced by:  iunmapss  39721
  Copyright terms: Public domain W3C validator