Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > euor2 | GIF version |
Description: Introduce or eliminate a disjunct in a uniqueness quantifier. (Contributed by NM, 21-Oct-2005.) (Proof shortened by Andrew Salmon, 9-Jul-2011.) |
Ref | Expression |
---|---|
euor2 | ⊢ (¬ ∃𝑥𝜑 → (∃!𝑥(𝜑 ∨ 𝜓) ↔ ∃!𝑥𝜓)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | hbe1 1424 | . . 3 ⊢ (∃𝑥𝜑 → ∀𝑥∃𝑥𝜑) | |
2 | 1 | hbn 1584 | . 2 ⊢ (¬ ∃𝑥𝜑 → ∀𝑥 ¬ ∃𝑥𝜑) |
3 | 19.8a 1522 | . . . 4 ⊢ (𝜑 → ∃𝑥𝜑) | |
4 | 3 | con3i 594 | . . 3 ⊢ (¬ ∃𝑥𝜑 → ¬ 𝜑) |
5 | orel1 676 | . . . 4 ⊢ (¬ 𝜑 → ((𝜑 ∨ 𝜓) → 𝜓)) | |
6 | olc 664 | . . . 4 ⊢ (𝜓 → (𝜑 ∨ 𝜓)) | |
7 | 5, 6 | impbid1 140 | . . 3 ⊢ (¬ 𝜑 → ((𝜑 ∨ 𝜓) ↔ 𝜓)) |
8 | 4, 7 | syl 14 | . 2 ⊢ (¬ ∃𝑥𝜑 → ((𝜑 ∨ 𝜓) ↔ 𝜓)) |
9 | 2, 8 | eubidh 1947 | 1 ⊢ (¬ ∃𝑥𝜑 → (∃!𝑥(𝜑 ∨ 𝜓) ↔ ∃!𝑥𝜓)) |
Colors of variables: wff set class |
Syntax hints: ¬ wn 3 → wi 4 ↔ wb 103 ∨ wo 661 ∃wex 1421 ∃!weu 1941 |
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-in1 576 ax-in2 577 ax-io 662 ax-5 1376 ax-gen 1378 ax-ie1 1422 ax-ie2 1423 ax-4 1440 ax-17 1459 ax-ial 1467 |
This theorem depends on definitions: df-bi 115 df-tru 1287 df-fal 1290 df-eu 1944 |
This theorem is referenced by: reuun2 3247 |
Copyright terms: Public domain | W3C validator |