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 45510
Description: The iota class exists. This theorem does not require ax-nul 5259 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 6515 . . . 4 (∀𝑥(𝜑 ↔ 𝑥 = 𝑦) → (℩𝑥𝜑) = 𝑦)
21eqcomd 2766 . . 3 (∀𝑥(𝜑 ↔ 𝑥 = 𝑦) → 𝑦 = (℩𝑥𝜑))
32eximi 1867 . 2 (∃𝑦∀𝑥(𝜑 ↔ 𝑥 = 𝑦) → ∃𝑦 𝑦 = (℩𝑥𝜑))
4 eu6 2599 . 2 (∃!𝑥𝜑 ↔ ∃𝑦∀𝑥(𝜑 ↔ 𝑥 = 𝑦))
5 isset 3464 . 2 ((℩𝑥𝜑) ∈ V ↔ ∃𝑦 𝑦 = (℩𝑥𝜑))
63, 4, 53imtr4i 295 1 (∃!𝑥𝜑 → (℩𝑥𝜑) ∈ V)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209  ∀wal 1567   = wceq 1569  ∃wex 1811   ∈ wcel 2144  ∃!weu 2593  Vcvv 3450  ℩cio 6495
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-12 2212  ax-ext 2732
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-tru 1572  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-v 3452  df-ss 3897  df-un 4150  df-sn 4585  df-pr 4587  df-uni 4867  df-iota 6497
This theorem is used by:  iotasbc  45511  pm14.18  45520  iotavalb  45522  sbiota1  45526
  Copyright terms: Public domain W3C validator