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 45662
Description: The iota class exists. This theorem does not require ax-nul 5266 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 6538 . . . 4 (∀𝑥(𝜑 ↔ 𝑥 = 𝑦) → (℩𝑥𝜑) = 𝑦)
21eqcomd 2769 . . 3 (∀𝑥(𝜑 ↔ 𝑥 = 𝑦) → 𝑦 = (℩𝑥𝜑))
32eximi 1868 . 2 (∃𝑦∀𝑥(𝜑 ↔ 𝑥 = 𝑦) → ∃𝑦 𝑦 = (℩𝑥𝜑))
4 eu6 2602 . 2 (∃!𝑥𝜑 ↔ ∃𝑦∀𝑥(𝜑 ↔ 𝑥 = 𝑦))
5 isset 3468 . 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 1568   = wceq 1570  ∃wex 1812   ∈ wcel 2147  ∃!weu 2596  Vcvv 3454  ℩cio 6518
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-12 2216  ax-ext 2735
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-tru 1573  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-v 3456  df-ss 3901  df-un 4154  df-sn 4589  df-pr 4591  df-uni 4873  df-iota 6520
This theorem is used by:  iotasbc  45663  pm14.18  45672  iotavalb  45674  sbiota1  45678
  Copyright terms: Public domain W3C validator