| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > abid2f | GIF version | ||
| Description: A simplification of class abstraction. Theorem 5.2 of [Quine] p. 35. (Contributed by NM, 5-Sep-2011.) (Revised by Mario Carneiro, 7-Oct-2016.) |
| Ref | Expression |
|---|---|
| abid2f.1 | ⊢ Ⅎ𝑥𝐴 |
| Ref | Expression |
|---|---|
| abid2f | ⊢ {𝑥 ∣ 𝑥 ∈ 𝐴} = 𝐴 |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | abid2f.1 | . . . . 5 ⊢ Ⅎ𝑥𝐴 | |
| 2 | nfab1 2350 | . . . . 5 ⊢ Ⅎ𝑥{𝑥 ∣ 𝑥 ∈ 𝐴} | |
| 3 | 1, 2 | cleqf 2373 | . . . 4 ⊢ (𝐴 = {𝑥 ∣ 𝑥 ∈ 𝐴} ↔ ∀𝑥(𝑥 ∈ 𝐴 ↔ 𝑥 ∈ {𝑥 ∣ 𝑥 ∈ 𝐴})) |
| 4 | abid 2193 | . . . . . 6 ⊢ (𝑥 ∈ {𝑥 ∣ 𝑥 ∈ 𝐴} ↔ 𝑥 ∈ 𝐴) | |
| 5 | 4 | bibi2i 227 | . . . . 5 ⊢ ((𝑥 ∈ 𝐴 ↔ 𝑥 ∈ {𝑥 ∣ 𝑥 ∈ 𝐴}) ↔ (𝑥 ∈ 𝐴 ↔ 𝑥 ∈ 𝐴)) |
| 6 | 5 | albii 1493 | . . . 4 ⊢ (∀𝑥(𝑥 ∈ 𝐴 ↔ 𝑥 ∈ {𝑥 ∣ 𝑥 ∈ 𝐴}) ↔ ∀𝑥(𝑥 ∈ 𝐴 ↔ 𝑥 ∈ 𝐴)) |
| 7 | 3, 6 | bitri 184 | . . 3 ⊢ (𝐴 = {𝑥 ∣ 𝑥 ∈ 𝐴} ↔ ∀𝑥(𝑥 ∈ 𝐴 ↔ 𝑥 ∈ 𝐴)) |
| 8 | biid 171 | . . 3 ⊢ (𝑥 ∈ 𝐴 ↔ 𝑥 ∈ 𝐴) | |
| 9 | 7, 8 | mpgbir 1476 | . 2 ⊢ 𝐴 = {𝑥 ∣ 𝑥 ∈ 𝐴} |
| 10 | 9 | eqcomi 2209 | 1 ⊢ {𝑥 ∣ 𝑥 ∈ 𝐴} = 𝐴 |
| Colors of variables: wff set class |
| Syntax hints: ↔ wb 105 ∀wal 1371 = wceq 1373 ∈ wcel 2176 {cab 2191 Ⅎwnfc 2335 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-io 711 ax-5 1470 ax-7 1471 ax-gen 1472 ax-ie1 1516 ax-ie2 1517 ax-8 1527 ax-10 1528 ax-11 1529 ax-i12 1530 ax-bndl 1532 ax-4 1533 ax-17 1549 ax-i9 1553 ax-ial 1557 ax-i5r 1558 ax-ext 2187 |
| This theorem depends on definitions: df-bi 117 df-tru 1376 df-nf 1484 df-sb 1786 df-clab 2192 df-cleq 2198 df-clel 2201 df-nfc 2337 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |