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

Theorem iotassuni 6334
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 6330 . . 3 (∃!𝑥𝜑 → (℩𝑥𝜑) = {𝑥𝜑})
2 eqimss 4023 . . 3 ((℩𝑥𝜑) = {𝑥𝜑} → (℩𝑥𝜑) ⊆ {𝑥𝜑})
31, 2syl 17 . 2 (∃!𝑥𝜑 → (℩𝑥𝜑) ⊆ {𝑥𝜑})
4 iotanul 6333 . . 3 (¬ ∃!𝑥𝜑 → (℩𝑥𝜑) = ∅)
5 0ss 4350 . . 3 ∅ ⊆ {𝑥𝜑}
64, 5eqsstrdi 4021 . 2 (¬ ∃!𝑥𝜑 → (℩𝑥𝜑) ⊆ {𝑥𝜑})
73, 6pm2.61i 184 1 (℩𝑥𝜑) ⊆ {𝑥𝜑}
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3   = wceq 1537  ∃!weu 2653  {cab 2799  wss 3936  c0 4291   cuni 4838  cio 6312
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2161  ax-12 2177  ax-ext 2793
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-tru 1540  df-ex 1781  df-nf 1785  df-sb 2070  df-mo 2622  df-eu 2654  df-clab 2800  df-cleq 2814  df-clel 2893  df-nfc 2963  df-ral 3143  df-rex 3144  df-v 3496  df-sbc 3773  df-dif 3939  df-un 3941  df-in 3943  df-ss 3952  df-nul 4292  df-sn 4568  df-pr 4570  df-uni 4839  df-iota 6314
This theorem is referenced by:  bj-nuliotaALT  34354
  Copyright terms: Public domain W3C validator