Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > ceqsex | GIF version |
Description: Elimination of an existential quantifier, using implicit substitution. (Contributed by NM, 2-Mar-1995.) (Revised by Mario Carneiro, 10-Oct-2016.) |
Ref | Expression |
---|---|
ceqsex.1 | ⊢ Ⅎ𝑥𝜓 |
ceqsex.2 | ⊢ 𝐴 ∈ V |
ceqsex.3 | ⊢ (𝑥 = 𝐴 → (𝜑 ↔ 𝜓)) |
Ref | Expression |
---|---|
ceqsex | ⊢ (∃𝑥(𝑥 = 𝐴 ∧ 𝜑) ↔ 𝜓) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | ceqsex.1 | . . 3 ⊢ Ⅎ𝑥𝜓 | |
2 | ceqsex.3 | . . . 4 ⊢ (𝑥 = 𝐴 → (𝜑 ↔ 𝜓)) | |
3 | 2 | biimpa 290 | . . 3 ⊢ ((𝑥 = 𝐴 ∧ 𝜑) → 𝜓) |
4 | 1, 3 | exlimi 1525 | . 2 ⊢ (∃𝑥(𝑥 = 𝐴 ∧ 𝜑) → 𝜓) |
5 | 2 | biimprcd 158 | . . . 4 ⊢ (𝜓 → (𝑥 = 𝐴 → 𝜑)) |
6 | 1, 5 | alrimi 1455 | . . 3 ⊢ (𝜓 → ∀𝑥(𝑥 = 𝐴 → 𝜑)) |
7 | ceqsex.2 | . . . 4 ⊢ 𝐴 ∈ V | |
8 | 7 | isseti 2607 | . . 3 ⊢ ∃𝑥 𝑥 = 𝐴 |
9 | exintr 1565 | . . 3 ⊢ (∀𝑥(𝑥 = 𝐴 → 𝜑) → (∃𝑥 𝑥 = 𝐴 → ∃𝑥(𝑥 = 𝐴 ∧ 𝜑))) | |
10 | 6, 8, 9 | mpisyl 1375 | . 2 ⊢ (𝜓 → ∃𝑥(𝑥 = 𝐴 ∧ 𝜑)) |
11 | 4, 10 | impbii 124 | 1 ⊢ (∃𝑥(𝑥 = 𝐴 ∧ 𝜑) ↔ 𝜓) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 102 ↔ wb 103 ∀wal 1282 = wceq 1284 Ⅎwnf 1389 ∃wex 1421 ∈ wcel 1433 Vcvv 2601 |
This theorem was proved from axioms: ax-1 5 ax-2 6 ax-mp 7 ax-ia1 104 ax-ia2 105 ax-ia3 106 ax-5 1376 ax-gen 1378 ax-ie1 1422 ax-ie2 1423 ax-8 1435 ax-4 1440 ax-17 1459 ax-i9 1463 ax-ial 1467 ax-ext 2063 |
This theorem depends on definitions: df-bi 115 df-nf 1390 df-sb 1686 df-clab 2068 df-cleq 2074 df-clel 2077 df-v 2603 |
This theorem is referenced by: ceqsexv 2638 ceqsex2 2639 |
Copyright terms: Public domain | W3C validator |