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 2447 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 2399 | . 2 ⊢ (∃𝑦 ∈ 𝐴 𝜓 ↔ ∃𝑦(𝑦 ∈ 𝐴 ∧ 𝜓)) | |
2 | nfraldxy.2 | . . 3 ⊢ Ⅎ𝑦𝜑 | |
3 | nfcv 2258 | . . . . . 6 ⊢ Ⅎ𝑥𝑦 | |
4 | 3 | a1i 9 | . . . . 5 ⊢ (𝜑 → Ⅎ𝑥𝑦) |
5 | nfraldxy.3 | . . . . 5 ⊢ (𝜑 → Ⅎ𝑥𝐴) | |
6 | 4, 5 | nfeld 2274 | . . . 4 ⊢ (𝜑 → Ⅎ𝑥 𝑦 ∈ 𝐴) |
7 | nfraldxy.4 | . . . 4 ⊢ (𝜑 → Ⅎ𝑥𝜓) | |
8 | 6, 7 | nfand 1532 | . . 3 ⊢ (𝜑 → Ⅎ𝑥(𝑦 ∈ 𝐴 ∧ 𝜓)) |
9 | 2, 8 | nfexd 1719 | . 2 ⊢ (𝜑 → Ⅎ𝑥∃𝑦(𝑦 ∈ 𝐴 ∧ 𝜓)) |
10 | 1, 9 | nfxfrd 1436 | 1 ⊢ (𝜑 → Ⅎ𝑥∃𝑦 ∈ 𝐴 𝜓) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 103 Ⅎwnf 1421 ∃wex 1453 ∈ wcel 1465 Ⅎwnfc 2245 ∃wrex 2394 |
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-4 1472 ax-17 1491 ax-ial 1499 ax-i5r 1500 ax-ext 2099 |
This theorem depends on definitions: df-bi 116 df-nf 1422 df-cleq 2110 df-clel 2113 df-nfc 2247 df-rex 2399 |
This theorem is referenced by: nfrexdya 2447 nfrexxy 2449 nfunid 3713 strcollnft 13109 |
Copyright terms: Public domain | W3C validator |