Mathbox for Andrew Salmon |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > Mathboxes > iotaexeu | Structured version Visualization version GIF version |
Description: The iota class exists. This theorem does not require ax-nul 5230 for its proof. (Contributed by Andrew Salmon, 11-Jul-2011.) |
Ref | Expression |
---|---|
iotaexeu | ⊢ (∃!𝑥𝜑 → (℩𝑥𝜑) ∈ V) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | iotaval 6407 | . . . 4 ⊢ (∀𝑥(𝜑 ↔ 𝑥 = 𝑦) → (℩𝑥𝜑) = 𝑦) | |
2 | 1 | eqcomd 2744 | . . 3 ⊢ (∀𝑥(𝜑 ↔ 𝑥 = 𝑦) → 𝑦 = (℩𝑥𝜑)) |
3 | 2 | eximi 1837 | . 2 ⊢ (∃𝑦∀𝑥(𝜑 ↔ 𝑥 = 𝑦) → ∃𝑦 𝑦 = (℩𝑥𝜑)) |
4 | eu6 2574 | . 2 ⊢ (∃!𝑥𝜑 ↔ ∃𝑦∀𝑥(𝜑 ↔ 𝑥 = 𝑦)) | |
5 | isset 3445 | . 2 ⊢ ((℩𝑥𝜑) ∈ V ↔ ∃𝑦 𝑦 = (℩𝑥𝜑)) | |
6 | 3, 4, 5 | 3imtr4i 292 | 1 ⊢ (∃!𝑥𝜑 → (℩𝑥𝜑) ∈ V) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 205 ∀wal 1537 = wceq 1539 ∃wex 1782 ∈ wcel 2106 ∃!weu 2568 Vcvv 3432 ℩cio 6389 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2709 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 845 df-tru 1542 df-ex 1783 df-nf 1787 df-sb 2068 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2816 df-v 3434 df-un 3892 df-in 3894 df-ss 3904 df-sn 4562 df-pr 4564 df-uni 4840 df-iota 6391 |
This theorem is referenced by: iotasbc 42037 pm14.18 42046 iotavalb 42048 sbiota1 42052 |
Copyright terms: Public domain | W3C validator |