![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > eubid | GIF version |
Description: Formula-building rule for unique existential quantifier (deduction form). (Contributed by NM, 9-Jul-1994.) |
Ref | Expression |
---|---|
eubid.1 | ⊢ Ⅎ𝑥𝜑 |
eubid.2 | ⊢ (𝜑 → (𝜓 ↔ 𝜒)) |
Ref | Expression |
---|---|
eubid | ⊢ (𝜑 → (∃!𝑥𝜓 ↔ ∃!𝑥𝜒)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | eubid.1 | . . . 4 ⊢ Ⅎ𝑥𝜑 | |
2 | eubid.2 | . . . . 5 ⊢ (𝜑 → (𝜓 ↔ 𝜒)) | |
3 | 2 | bibi1d 233 | . . . 4 ⊢ (𝜑 → ((𝜓 ↔ 𝑥 = 𝑦) ↔ (𝜒 ↔ 𝑥 = 𝑦))) |
4 | 1, 3 | albid 1626 | . . 3 ⊢ (𝜑 → (∀𝑥(𝜓 ↔ 𝑥 = 𝑦) ↔ ∀𝑥(𝜒 ↔ 𝑥 = 𝑦))) |
5 | 4 | exbidv 1836 | . 2 ⊢ (𝜑 → (∃𝑦∀𝑥(𝜓 ↔ 𝑥 = 𝑦) ↔ ∃𝑦∀𝑥(𝜒 ↔ 𝑥 = 𝑦))) |
6 | df-eu 2045 | . 2 ⊢ (∃!𝑥𝜓 ↔ ∃𝑦∀𝑥(𝜓 ↔ 𝑥 = 𝑦)) | |
7 | df-eu 2045 | . 2 ⊢ (∃!𝑥𝜒 ↔ ∃𝑦∀𝑥(𝜒 ↔ 𝑥 = 𝑦)) | |
8 | 5, 6, 7 | 3bitr4g 223 | 1 ⊢ (𝜑 → (∃!𝑥𝜓 ↔ ∃!𝑥𝜒)) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ↔ wb 105 ∀wal 1362 Ⅎwnf 1471 ∃wex 1503 ∃!weu 2042 |
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 1458 ax-gen 1460 ax-ie1 1504 ax-ie2 1505 ax-4 1521 ax-17 1537 ax-ial 1545 |
This theorem depends on definitions: df-bi 117 df-nf 1472 df-eu 2045 |
This theorem is referenced by: eubidv 2050 mobid 2077 reubida 2676 reueq1f 2688 eusv2i 4486 |
Copyright terms: Public domain | W3C validator |