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 2420 | . 2 ⊢ (∃𝑥 ∈ 𝐴 𝜑 ↔ ∃𝑥(𝑥 ∈ 𝐴 ∧ 𝜑)) | |
2 | rabid 2604 | . . 3 ⊢ (𝑥 ∈ {𝑥 ∈ 𝐴 ∣ 𝜑} ↔ (𝑥 ∈ 𝐴 ∧ 𝜑)) | |
3 | 2 | exbii 1584 | . 2 ⊢ (∃𝑥 𝑥 ∈ {𝑥 ∈ 𝐴 ∣ 𝜑} ↔ ∃𝑥(𝑥 ∈ 𝐴 ∧ 𝜑)) |
4 | nfv 1508 | . . 3 ⊢ Ⅎ𝑦 𝑥 ∈ {𝑥 ∈ 𝐴 ∣ 𝜑} | |
5 | df-rab 2423 | . . . . 5 ⊢ {𝑥 ∈ 𝐴 ∣ 𝜑} = {𝑥 ∣ (𝑥 ∈ 𝐴 ∧ 𝜑)} | |
6 | 5 | eleq2i 2204 | . . . 4 ⊢ (𝑦 ∈ {𝑥 ∈ 𝐴 ∣ 𝜑} ↔ 𝑦 ∈ {𝑥 ∣ (𝑥 ∈ 𝐴 ∧ 𝜑)}) |
7 | nfsab1 2127 | . . . 4 ⊢ Ⅎ𝑥 𝑦 ∈ {𝑥 ∣ (𝑥 ∈ 𝐴 ∧ 𝜑)} | |
8 | 6, 7 | nfxfr 1450 | . . 3 ⊢ Ⅎ𝑥 𝑦 ∈ {𝑥 ∈ 𝐴 ∣ 𝜑} |
9 | eleq1 2200 | . . 3 ⊢ (𝑥 = 𝑦 → (𝑥 ∈ {𝑥 ∈ 𝐴 ∣ 𝜑} ↔ 𝑦 ∈ {𝑥 ∈ 𝐴 ∣ 𝜑})) | |
10 | 4, 8, 9 | cbvex 1729 | . 2 ⊢ (∃𝑥 𝑥 ∈ {𝑥 ∈ 𝐴 ∣ 𝜑} ↔ ∃𝑦 𝑦 ∈ {𝑥 ∈ 𝐴 ∣ 𝜑}) |
11 | 1, 3, 10 | 3bitr2ri 208 | 1 ⊢ (∃𝑦 𝑦 ∈ {𝑥 ∈ 𝐴 ∣ 𝜑} ↔ ∃𝑥 ∈ 𝐴 𝜑) |
Colors of variables: wff set class |
Syntax hints: ∧ wa 103 ↔ wb 104 ∃wex 1468 ∈ wcel 1480 {cab 2123 ∃wrex 2415 {crab 2418 |
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 1423 ax-7 1424 ax-gen 1425 ax-ie1 1469 ax-ie2 1470 ax-8 1482 ax-11 1484 ax-4 1487 ax-17 1506 ax-i9 1510 ax-ial 1514 ax-ext 2119 |
This theorem depends on definitions: df-bi 116 df-nf 1437 df-sb 1736 df-clab 2124 df-cleq 2130 df-clel 2133 df-rex 2420 df-rab 2423 |
This theorem is referenced by: exss 4144 |
Copyright terms: Public domain | W3C validator |