Users' Mathboxes Mathbox for Andrew Salmon < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  iotaexeu Structured version   Visualization version   GIF version

Theorem iotaexeu 39458
Description: The iota class exists. This theorem does not require ax-nul 5013 for its proof. (Contributed by Andrew Salmon, 11-Jul-2011.)
Assertion
Ref Expression
iotaexeu (∃!𝑥𝜑 → (℩𝑥𝜑) ∈ V)

Proof of Theorem iotaexeu
Dummy variable 𝑦 is distinct from all other variables.
StepHypRef Expression
1 iotaval 6097 . . . 4 (∀𝑥(𝜑𝑥 = 𝑦) → (℩𝑥𝜑) = 𝑦)
21eqcomd 2831 . . 3 (∀𝑥(𝜑𝑥 = 𝑦) → 𝑦 = (℩𝑥𝜑))
32eximi 1935 . 2 (∃𝑦𝑥(𝜑𝑥 = 𝑦) → ∃𝑦 𝑦 = (℩𝑥𝜑))
4 eu6 2645 . 2 (∃!𝑥𝜑 ↔ ∃𝑦𝑥(𝜑𝑥 = 𝑦))
5 isset 3424 . 2 ((℩𝑥𝜑) ∈ V ↔ ∃𝑦 𝑦 = (℩𝑥𝜑))
63, 4, 53imtr4i 284 1 (∃!𝑥𝜑 → (℩𝑥𝜑) ∈ V)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 198  wal 1656   = wceq 1658  wex 1880  wcel 2166  ∃!weu 2639  Vcvv 3414  cio 6084
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1896  ax-4 1910  ax-5 2011  ax-6 2077  ax-7 2114  ax-9 2175  ax-10 2194  ax-11 2209  ax-12 2222  ax-13 2391  ax-ext 2803
This theorem depends on definitions:  df-bi 199  df-an 387  df-or 881  df-tru 1662  df-ex 1881  df-nf 1885  df-sb 2070  df-mo 2605  df-eu 2640  df-clab 2812  df-cleq 2818  df-clel 2821  df-nfc 2958  df-rex 3123  df-v 3416  df-sbc 3663  df-un 3803  df-sn 4398  df-pr 4400  df-uni 4659  df-iota 6086
This theorem is referenced by:  iotasbc  39459  pm14.18  39468  iotavalb  39470  sbiota1  39474
  Copyright terms: Public domain W3C validator