Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > absn | Structured version Visualization version GIF version |
Description: Condition for a class abstraction to be a singleton. Formerly part of proof of dfiota2 6315. (Contributed by Andrew Salmon, 30-Jun-2011.) (Revised by AV, 24-Aug-2022.) |
Ref | Expression |
---|---|
absn | ⊢ ({𝑥 ∣ 𝜑} = {𝑌} ↔ ∀𝑥(𝜑 ↔ 𝑥 = 𝑌)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | df-sn 4568 | . . 3 ⊢ {𝑌} = {𝑥 ∣ 𝑥 = 𝑌} | |
2 | 1 | eqeq2i 2834 | . 2 ⊢ ({𝑥 ∣ 𝜑} = {𝑌} ↔ {𝑥 ∣ 𝜑} = {𝑥 ∣ 𝑥 = 𝑌}) |
3 | abbi 2888 | . 2 ⊢ (∀𝑥(𝜑 ↔ 𝑥 = 𝑌) ↔ {𝑥 ∣ 𝜑} = {𝑥 ∣ 𝑥 = 𝑌}) | |
4 | 2, 3 | bitr4i 280 | 1 ⊢ ({𝑥 ∣ 𝜑} = {𝑌} ↔ ∀𝑥(𝜑 ↔ 𝑥 = 𝑌)) |
Colors of variables: wff setvar class |
Syntax hints: ↔ wb 208 ∀wal 1535 = wceq 1537 {cab 2799 {csn 4567 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1970 ax-7 2015 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2793 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-tru 1540 df-ex 1781 df-nf 1785 df-sb 2070 df-clab 2800 df-cleq 2814 df-sn 4568 |
This theorem is referenced by: rabeqsn 4606 euabsn2 4661 dfiota2 6315 dfaiota2 43335 aiotaval 43342 |
Copyright terms: Public domain | W3C validator |