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

Theorem iotassuni 5565
 Description: The class is a subset of the union of all elements satisfying . (Contributed by Mario Carneiro, 24-Dec-2016.)
Assertion
Ref Expression
iotassuni

Proof of Theorem iotassuni
StepHypRef Expression
1 iotauni 5561 . . 3
2 eqimss 3556 . . 3
31, 2syl 16 . 2
4 iotanul 5564 . . 3
5 0ss 3814 . . 3
64, 5syl6eqss 3554 . 2
73, 6pm2.61i 164 1
 Colors of variables: wff setvar class Syntax hints:   wn 3   wceq 1379  weu 2275  cab 2452   wss 3476  c0 3785  cuni 4245  cio 5547 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1601  ax-4 1612  ax-5 1680  ax-6 1719  ax-7 1739  ax-10 1786  ax-11 1791  ax-12 1803  ax-13 1968  ax-ext 2445 This theorem depends on definitions:  df-bi 185  df-or 370  df-an 371  df-tru 1382  df-ex 1597  df-nf 1600  df-sb 1712  df-eu 2279  df-clab 2453  df-cleq 2459  df-clel 2462  df-nfc 2617  df-ne 2664  df-ral 2819  df-rex 2820  df-v 3115  df-sbc 3332  df-dif 3479  df-un 3481  df-in 3483  df-ss 3490  df-nul 3786  df-sn 4028  df-pr 4030  df-uni 4246  df-iota 5549 This theorem is referenced by:  bj-nuliotaALT  33668
 Copyright terms: Public domain W3C validator