ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  iunss1 GIF version

Theorem iunss1 3919
Description: Subclass theorem for indexed union. (Contributed by NM, 10-Dec-2004.) (Proof shortened by Andrew Salmon, 25-Jul-2011.)
Assertion
Ref Expression
iunss1 (𝐴𝐵 𝑥𝐴 𝐶 𝑥𝐵 𝐶)
Distinct variable groups:   𝑥,𝐴   𝑥,𝐵
Allowed substitution hint:   𝐶(𝑥)

Proof of Theorem iunss1
Dummy variable 𝑦 is distinct from all other variables.
StepHypRef Expression
1 ssrexv 3240 . . 3 (𝐴𝐵 → (∃𝑥𝐴 𝑦𝐶 → ∃𝑥𝐵 𝑦𝐶))
2 eliun 3912 . . 3 (𝑦 𝑥𝐴 𝐶 ↔ ∃𝑥𝐴 𝑦𝐶)
3 eliun 3912 . . 3 (𝑦 𝑥𝐵 𝐶 ↔ ∃𝑥𝐵 𝑦𝐶)
41, 2, 33imtr4g 205 . 2 (𝐴𝐵 → (𝑦 𝑥𝐴 𝐶𝑦 𝑥𝐵 𝐶))
54ssrdv 3181 1 (𝐴𝐵 𝑥𝐴 𝐶 𝑥𝐵 𝐶)
Colors of variables: wff set class
Syntax hints:  wi 4  wcel 2160  wrex 2469  wss 3149   ciun 3908
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 710  ax-5 1458  ax-7 1459  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-10 1516  ax-11 1517  ax-i12 1518  ax-bndl 1520  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-i5r 1546  ax-ext 2171
This theorem depends on definitions:  df-bi 117  df-tru 1367  df-nf 1472  df-sb 1774  df-clab 2176  df-cleq 2182  df-clel 2185  df-nfc 2321  df-ral 2473  df-rex 2474  df-v 2758  df-in 3155  df-ss 3162  df-iun 3910
This theorem is referenced by:  iuneq1  3921  iunxdif2  3957  fsumiun  11594
  Copyright terms: Public domain W3C validator