| 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 2376 | . . . . 5 ⊢ Ⅎ𝑥{𝑥 ∣ 𝑥 ∈ 𝐴} | |
| 3 | 1, 2 | cleqf 2399 | . . . 4 ⊢ (𝐴 = {𝑥 ∣ 𝑥 ∈ 𝐴} ↔ ∀𝑥(𝑥 ∈ 𝐴 ↔ 𝑥 ∈ {𝑥 ∣ 𝑥 ∈ 𝐴})) |
| 4 | abid 2219 | . . . . . 6 ⊢ (𝑥 ∈ {𝑥 ∣ 𝑥 ∈ 𝐴} ↔ 𝑥 ∈ 𝐴) | |
| 5 | 4 | bibi2i 227 | . . . . 5 ⊢ ((𝑥 ∈ 𝐴 ↔ 𝑥 ∈ {𝑥 ∣ 𝑥 ∈ 𝐴}) ↔ (𝑥 ∈ 𝐴 ↔ 𝑥 ∈ 𝐴)) |
| 6 | 5 | albii 1518 | . . . 4 ⊢ (∀𝑥(𝑥 ∈ 𝐴 ↔ 𝑥 ∈ {𝑥 ∣ 𝑥 ∈ 𝐴}) ↔ ∀𝑥(𝑥 ∈ 𝐴 ↔ 𝑥 ∈ 𝐴)) |
| 7 | 3, 6 | bitri 184 | . . 3 ⊢ (𝐴 = {𝑥 ∣ 𝑥 ∈ 𝐴} ↔ ∀𝑥(𝑥 ∈ 𝐴 ↔ 𝑥 ∈ 𝐴)) |
| 8 | biid 171 | . . 3 ⊢ (𝑥 ∈ 𝐴 ↔ 𝑥 ∈ 𝐴) | |
| 9 | 7, 8 | mpgbir 1501 | . 2 ⊢ 𝐴 = {𝑥 ∣ 𝑥 ∈ 𝐴} |
| 10 | 9 | eqcomi 2235 | 1 ⊢ {𝑥 ∣ 𝑥 ∈ 𝐴} = 𝐴 |
| Colors of variables: wff set class |
| Syntax hints: ↔ wb 105 ∀wal 1395 = wceq 1397 ∈ wcel 2202 {cab 2217 Ⅎwnfc 2361 |
| 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 716 ax-5 1495 ax-7 1496 ax-gen 1497 ax-ie1 1541 ax-ie2 1542 ax-8 1552 ax-10 1553 ax-11 1554 ax-i12 1555 ax-bndl 1557 ax-4 1558 ax-17 1574 ax-i9 1578 ax-ial 1582 ax-i5r 1583 ax-ext 2213 |
| This theorem depends on definitions: df-bi 117 df-tru 1400 df-nf 1509 df-sb 1811 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2363 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |