Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > rexnalim | GIF version |
Description: Relationship between restricted universal and existential quantifiers. In classical logic this would be a biconditional. (Contributed by Jim Kingdon, 17-Aug-2018.) |
Ref | Expression |
---|---|
rexnalim | ⊢ (∃𝑥 ∈ 𝐴 ¬ 𝜑 → ¬ ∀𝑥 ∈ 𝐴 𝜑) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | df-rex 2312 | . 2 ⊢ (∃𝑥 ∈ 𝐴 ¬ 𝜑 ↔ ∃𝑥(𝑥 ∈ 𝐴 ∧ ¬ 𝜑)) | |
2 | exanaliim 1538 | . . 3 ⊢ (∃𝑥(𝑥 ∈ 𝐴 ∧ ¬ 𝜑) → ¬ ∀𝑥(𝑥 ∈ 𝐴 → 𝜑)) | |
3 | df-ral 2311 | . . 3 ⊢ (∀𝑥 ∈ 𝐴 𝜑 ↔ ∀𝑥(𝑥 ∈ 𝐴 → 𝜑)) | |
4 | 2, 3 | sylnibr 602 | . 2 ⊢ (∃𝑥(𝑥 ∈ 𝐴 ∧ ¬ 𝜑) → ¬ ∀𝑥 ∈ 𝐴 𝜑) |
5 | 1, 4 | sylbi 114 | 1 ⊢ (∃𝑥 ∈ 𝐴 ¬ 𝜑 → ¬ ∀𝑥 ∈ 𝐴 𝜑) |
Colors of variables: wff set class |
Syntax hints: ¬ wn 3 → wi 4 ∧ wa 97 ∀wal 1241 ∃wex 1381 ∈ wcel 1393 ∀wral 2306 ∃wrex 2307 |
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-in1 544 ax-in2 545 ax-5 1336 ax-gen 1338 ax-ie1 1382 ax-ie2 1383 ax-4 1400 ax-17 1419 ax-ial 1427 |
This theorem depends on definitions: df-bi 110 df-tru 1246 df-fal 1249 df-nf 1350 df-ral 2311 df-rex 2312 |
This theorem is referenced by: ralexim 2318 iundif2ss 3722 |
Copyright terms: Public domain | W3C validator |