| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > nfrexdxy | GIF version | ||
| Description: Not-free for restricted existential quantification where 𝑥 and 𝑦 are distinct. See nfrexdya 2542 for a version with 𝑦 and 𝐴 distinct instead. (Contributed by Jim Kingdon, 30-May-2018.) |
| Ref | Expression |
|---|---|
| nfraldxy.2 | ⊢ Ⅎ𝑦𝜑 |
| nfraldxy.3 | ⊢ (𝜑 → Ⅎ𝑥𝐴) |
| nfraldxy.4 | ⊢ (𝜑 → Ⅎ𝑥𝜓) |
| Ref | Expression |
|---|---|
| nfrexdxy | ⊢ (𝜑 → Ⅎ𝑥∃𝑦 ∈ 𝐴 𝜓) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | df-rex 2490 | . 2 ⊢ (∃𝑦 ∈ 𝐴 𝜓 ↔ ∃𝑦(𝑦 ∈ 𝐴 ∧ 𝜓)) | |
| 2 | nfraldxy.2 | . . 3 ⊢ Ⅎ𝑦𝜑 | |
| 3 | nfcv 2348 | . . . . . 6 ⊢ Ⅎ𝑥𝑦 | |
| 4 | 3 | a1i 9 | . . . . 5 ⊢ (𝜑 → Ⅎ𝑥𝑦) |
| 5 | nfraldxy.3 | . . . . 5 ⊢ (𝜑 → Ⅎ𝑥𝐴) | |
| 6 | 4, 5 | nfeld 2364 | . . . 4 ⊢ (𝜑 → Ⅎ𝑥 𝑦 ∈ 𝐴) |
| 7 | nfraldxy.4 | . . . 4 ⊢ (𝜑 → Ⅎ𝑥𝜓) | |
| 8 | 6, 7 | nfand 1591 | . . 3 ⊢ (𝜑 → Ⅎ𝑥(𝑦 ∈ 𝐴 ∧ 𝜓)) |
| 9 | 2, 8 | nfexd 1784 | . 2 ⊢ (𝜑 → Ⅎ𝑥∃𝑦(𝑦 ∈ 𝐴 ∧ 𝜓)) |
| 10 | 1, 9 | nfxfrd 1498 | 1 ⊢ (𝜑 → Ⅎ𝑥∃𝑦 ∈ 𝐴 𝜓) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 Ⅎwnf 1483 ∃wex 1515 ∈ wcel 2176 Ⅎwnfc 2335 ∃wrex 2485 |
| 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-5 1470 ax-7 1471 ax-gen 1472 ax-ie1 1516 ax-ie2 1517 ax-4 1533 ax-17 1549 ax-ial 1557 ax-i5r 1558 ax-ext 2187 |
| This theorem depends on definitions: df-bi 117 df-nf 1484 df-cleq 2198 df-clel 2201 df-nfc 2337 df-rex 2490 |
| This theorem is referenced by: nfrexdya 2542 nfrexw 2545 nfunid 3857 strcollnft 15920 |
| Copyright terms: Public domain | W3C validator |