![]() |
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 2030 | . 2 ⊢ (∃*𝑥𝜑 ↔ (∃𝑥𝜑 → ∃!𝑥𝜑)) | |
2 | hbe1 1495 | . . 3 ⊢ (∃𝑥𝜑 → ∀𝑥∃𝑥𝜑) | |
3 | hbeu1 2036 | . . 3 ⊢ (∃!𝑥𝜑 → ∀𝑥∃!𝑥𝜑) | |
4 | 2, 3 | hbim 1545 | . 2 ⊢ ((∃𝑥𝜑 → ∃!𝑥𝜑) → ∀𝑥(∃𝑥𝜑 → ∃!𝑥𝜑)) |
5 | 1, 4 | hbxfrbi 1472 | 1 ⊢ (∃*𝑥𝜑 → ∀𝑥∃*𝑥𝜑) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∀wal 1351 ∃wex 1492 ∃!weu 2026 ∃*wmo 2027 |
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 1447 ax-7 1448 ax-gen 1449 ax-ie1 1493 ax-ie2 1494 ax-4 1510 ax-ial 1534 ax-i5r 1535 |
This theorem depends on definitions: df-bi 117 df-eu 2029 df-mo 2030 |
This theorem is referenced by: mopick2 2109 moexexdc 2110 |
Copyright terms: Public domain | W3C validator |