Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > rabn0m | GIF version |
Description: Inhabited restricted class abstraction. (Contributed by Jim Kingdon, 18-Sep-2018.) |
Ref | Expression |
---|---|
rabn0m | ⊢ (∃𝑦 𝑦 ∈ {𝑥 ∈ 𝐴 ∣ 𝜑} ↔ ∃𝑥 ∈ 𝐴 𝜑) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | df-rex 2399 | . 2 ⊢ (∃𝑥 ∈ 𝐴 𝜑 ↔ ∃𝑥(𝑥 ∈ 𝐴 ∧ 𝜑)) | |
2 | rabid 2583 | . . 3 ⊢ (𝑥 ∈ {𝑥 ∈ 𝐴 ∣ 𝜑} ↔ (𝑥 ∈ 𝐴 ∧ 𝜑)) | |
3 | 2 | exbii 1569 | . 2 ⊢ (∃𝑥 𝑥 ∈ {𝑥 ∈ 𝐴 ∣ 𝜑} ↔ ∃𝑥(𝑥 ∈ 𝐴 ∧ 𝜑)) |
4 | nfv 1493 | . . 3 ⊢ Ⅎ𝑦 𝑥 ∈ {𝑥 ∈ 𝐴 ∣ 𝜑} | |
5 | df-rab 2402 | . . . . 5 ⊢ {𝑥 ∈ 𝐴 ∣ 𝜑} = {𝑥 ∣ (𝑥 ∈ 𝐴 ∧ 𝜑)} | |
6 | 5 | eleq2i 2184 | . . . 4 ⊢ (𝑦 ∈ {𝑥 ∈ 𝐴 ∣ 𝜑} ↔ 𝑦 ∈ {𝑥 ∣ (𝑥 ∈ 𝐴 ∧ 𝜑)}) |
7 | nfsab1 2107 | . . . 4 ⊢ Ⅎ𝑥 𝑦 ∈ {𝑥 ∣ (𝑥 ∈ 𝐴 ∧ 𝜑)} | |
8 | 6, 7 | nfxfr 1435 | . . 3 ⊢ Ⅎ𝑥 𝑦 ∈ {𝑥 ∈ 𝐴 ∣ 𝜑} |
9 | eleq1 2180 | . . 3 ⊢ (𝑥 = 𝑦 → (𝑥 ∈ {𝑥 ∈ 𝐴 ∣ 𝜑} ↔ 𝑦 ∈ {𝑥 ∈ 𝐴 ∣ 𝜑})) | |
10 | 4, 8, 9 | cbvex 1714 | . 2 ⊢ (∃𝑥 𝑥 ∈ {𝑥 ∈ 𝐴 ∣ 𝜑} ↔ ∃𝑦 𝑦 ∈ {𝑥 ∈ 𝐴 ∣ 𝜑}) |
11 | 1, 3, 10 | 3bitr2ri 208 | 1 ⊢ (∃𝑦 𝑦 ∈ {𝑥 ∈ 𝐴 ∣ 𝜑} ↔ ∃𝑥 ∈ 𝐴 𝜑) |
Colors of variables: wff set class |
Syntax hints: ∧ wa 103 ↔ wb 104 ∃wex 1453 ∈ wcel 1465 {cab 2103 ∃wrex 2394 {crab 2397 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-5 1408 ax-7 1409 ax-gen 1410 ax-ie1 1454 ax-ie2 1455 ax-8 1467 ax-11 1469 ax-4 1472 ax-17 1491 ax-i9 1495 ax-ial 1499 ax-ext 2099 |
This theorem depends on definitions: df-bi 116 df-nf 1422 df-sb 1721 df-clab 2104 df-cleq 2110 df-clel 2113 df-rex 2399 df-rab 2402 |
This theorem is referenced by: exss 4119 |
Copyright terms: Public domain | W3C validator |