![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > hbmo1 | GIF version |
Description: Bound-variable hypothesis builder for "at most one". (Contributed by NM, 8-Mar-1995.) |
Ref | Expression |
---|---|
hbmo1 | ⊢ (∃*𝑥𝜑 → ∀𝑥∃*𝑥𝜑) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | df-mo 2042 | . 2 ⊢ (∃*𝑥𝜑 ↔ (∃𝑥𝜑 → ∃!𝑥𝜑)) | |
2 | hbe1 1506 | . . 3 ⊢ (∃𝑥𝜑 → ∀𝑥∃𝑥𝜑) | |
3 | hbeu1 2048 | . . 3 ⊢ (∃!𝑥𝜑 → ∀𝑥∃!𝑥𝜑) | |
4 | 2, 3 | hbim 1556 | . 2 ⊢ ((∃𝑥𝜑 → ∃!𝑥𝜑) → ∀𝑥(∃𝑥𝜑 → ∃!𝑥𝜑)) |
5 | 1, 4 | hbxfrbi 1483 | 1 ⊢ (∃*𝑥𝜑 → ∀𝑥∃*𝑥𝜑) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∀wal 1362 ∃wex 1503 ∃!weu 2038 ∃*wmo 2039 |
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-7 1459 ax-gen 1460 ax-ie1 1504 ax-ie2 1505 ax-4 1521 ax-ial 1545 ax-i5r 1546 |
This theorem depends on definitions: df-bi 117 df-eu 2041 df-mo 2042 |
This theorem is referenced by: mopick2 2121 moexexdc 2122 |
Copyright terms: Public domain | W3C validator |