Metamath Proof Explorer < Previous   Next > Nearby theorems Mirrors  >  Home  >  MPE Home  >  Th. List  >  iinss1 Structured version   Unicode version

Theorem iinss1 4107
 Description: Subclass theorem for indexed union. (Contributed by NM, 24-Jan-2012.)
Assertion
Ref Expression
iinss1
Distinct variable groups:   ,   ,
Allowed substitution hint:   ()

Proof of Theorem iinss1
Dummy variable is distinct from all other variables.
StepHypRef Expression
1 ssralv 3409 . . 3
2 vex 2961 . . . 4
3 eliin 4100 . . . 4
42, 3ax-mp 5 . . 3
5 eliin 4100 . . . 4
62, 5ax-mp 5 . . 3
71, 4, 63imtr4g 263 . 2
87ssrdv 3356 1
 Colors of variables: wff set class Syntax hints:   wi 4   wb 178   wcel 1726  wral 2707  cvv 2958   wss 3322  ciin 4096 This theorem is referenced by:  polcon3N  30788 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1556  ax-5 1567  ax-17 1627  ax-9 1667  ax-8 1688  ax-6 1745  ax-7 1750  ax-11 1762  ax-12 1951  ax-ext 2419 This theorem depends on definitions:  df-bi 179  df-or 361  df-an 362  df-tru 1329  df-ex 1552  df-nf 1555  df-sb 1660  df-clab 2425  df-cleq 2431  df-clel 2434  df-nfc 2563  df-ral 2712  df-v 2960  df-in 3329  df-ss 3336  df-iin 4098
 Copyright terms: Public domain W3C validator