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 2312 | . 2 ⊢ (∃𝑥 ∈ 𝐴 𝜑 ↔ ∃𝑥(𝑥 ∈ 𝐴 ∧ 𝜑)) | |
2 | rabid 2485 | . . 3 ⊢ (𝑥 ∈ {𝑥 ∈ 𝐴 ∣ 𝜑} ↔ (𝑥 ∈ 𝐴 ∧ 𝜑)) | |
3 | 2 | exbii 1496 | . 2 ⊢ (∃𝑥 𝑥 ∈ {𝑥 ∈ 𝐴 ∣ 𝜑} ↔ ∃𝑥(𝑥 ∈ 𝐴 ∧ 𝜑)) |
4 | nfv 1421 | . . 3 ⊢ Ⅎ𝑦 𝑥 ∈ {𝑥 ∈ 𝐴 ∣ 𝜑} | |
5 | df-rab 2315 | . . . . 5 ⊢ {𝑥 ∈ 𝐴 ∣ 𝜑} = {𝑥 ∣ (𝑥 ∈ 𝐴 ∧ 𝜑)} | |
6 | 5 | eleq2i 2104 | . . . 4 ⊢ (𝑦 ∈ {𝑥 ∈ 𝐴 ∣ 𝜑} ↔ 𝑦 ∈ {𝑥 ∣ (𝑥 ∈ 𝐴 ∧ 𝜑)}) |
7 | nfsab1 2030 | . . . 4 ⊢ Ⅎ𝑥 𝑦 ∈ {𝑥 ∣ (𝑥 ∈ 𝐴 ∧ 𝜑)} | |
8 | 6, 7 | nfxfr 1363 | . . 3 ⊢ Ⅎ𝑥 𝑦 ∈ {𝑥 ∈ 𝐴 ∣ 𝜑} |
9 | eleq1 2100 | . . 3 ⊢ (𝑥 = 𝑦 → (𝑥 ∈ {𝑥 ∈ 𝐴 ∣ 𝜑} ↔ 𝑦 ∈ {𝑥 ∈ 𝐴 ∣ 𝜑})) | |
10 | 4, 8, 9 | cbvex 1639 | . 2 ⊢ (∃𝑥 𝑥 ∈ {𝑥 ∈ 𝐴 ∣ 𝜑} ↔ ∃𝑦 𝑦 ∈ {𝑥 ∈ 𝐴 ∣ 𝜑}) |
11 | 1, 3, 10 | 3bitr2ri 198 | 1 ⊢ (∃𝑦 𝑦 ∈ {𝑥 ∈ 𝐴 ∣ 𝜑} ↔ ∃𝑥 ∈ 𝐴 𝜑) |
Colors of variables: wff set class |
Syntax hints: ∧ wa 97 ↔ wb 98 ∃wex 1381 ∈ wcel 1393 {cab 2026 ∃wrex 2307 {crab 2310 |
This theorem was proved from axioms: ax-1 5 ax-2 6 ax-mp 7 ax-ia1 99 ax-ia2 100 ax-ia3 101 ax-5 1336 ax-7 1337 ax-gen 1338 ax-ie1 1382 ax-ie2 1383 ax-8 1395 ax-11 1397 ax-4 1400 ax-17 1419 ax-i9 1423 ax-ial 1427 ax-ext 2022 |
This theorem depends on definitions: df-bi 110 df-nf 1350 df-sb 1646 df-clab 2027 df-cleq 2033 df-clel 2036 df-rex 2312 df-rab 2315 |
This theorem is referenced by: exss 3963 |
Copyright terms: Public domain | W3C validator |