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 5201 for its proof. (Contributed by Andrew Salmon, 11-Jul-2011.) |
Ref | Expression |
---|---|
iotaexeu | ⊢ (∃!𝑥𝜑 → (℩𝑥𝜑) ∈ V) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | iotaval 6322 | . . . 4 ⊢ (∀𝑥(𝜑 ↔ 𝑥 = 𝑦) → (℩𝑥𝜑) = 𝑦) | |
2 | 1 | eqcomd 2825 | . . 3 ⊢ (∀𝑥(𝜑 ↔ 𝑥 = 𝑦) → 𝑦 = (℩𝑥𝜑)) |
3 | 2 | eximi 1829 | . 2 ⊢ (∃𝑦∀𝑥(𝜑 ↔ 𝑥 = 𝑦) → ∃𝑦 𝑦 = (℩𝑥𝜑)) |
4 | eu6 2653 | . 2 ⊢ (∃!𝑥𝜑 ↔ ∃𝑦∀𝑥(𝜑 ↔ 𝑥 = 𝑦)) | |
5 | isset 3505 | . 2 ⊢ ((℩𝑥𝜑) ∈ V ↔ ∃𝑦 𝑦 = (℩𝑥𝜑)) | |
6 | 3, 4, 5 | 3imtr4i 294 | 1 ⊢ (∃!𝑥𝜑 → (℩𝑥𝜑) ∈ V) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 208 ∀wal 1529 = wceq 1531 ∃wex 1774 ∈ wcel 2108 ∃!weu 2647 Vcvv 3493 ℩cio 6305 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1790 ax-4 1804 ax-5 1905 ax-6 1964 ax-7 2009 ax-8 2110 ax-9 2118 ax-10 2139 ax-11 2154 ax-12 2170 ax-ext 2791 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-tru 1534 df-ex 1775 df-nf 1779 df-sb 2064 df-mo 2616 df-eu 2648 df-clab 2798 df-cleq 2812 df-clel 2891 df-nfc 2961 df-rex 3142 df-v 3495 df-sbc 3771 df-un 3939 df-sn 4560 df-pr 4562 df-uni 4831 df-iota 6307 |
This theorem is referenced by: iotasbc 40742 pm14.18 40751 iotavalb 40753 sbiota1 40757 |
Copyright terms: Public domain | W3C validator |