| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > mormo | GIF version | ||
| Description: Unrestricted "at most one" implies restricted "at most one". (Contributed by NM, 16-Jun-2017.) |
| Ref | Expression |
|---|---|
| mormo | ⊢ (∃*𝑥𝜑 → ∃*𝑥 ∈ 𝐴 𝜑) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | moan 2149 | . 2 ⊢ (∃*𝑥𝜑 → ∃*𝑥(𝑥 ∈ 𝐴 ∧ 𝜑)) | |
| 2 | df-rmo 2518 | . 2 ⊢ (∃*𝑥 ∈ 𝐴 𝜑 ↔ ∃*𝑥(𝑥 ∈ 𝐴 ∧ 𝜑)) | |
| 3 | 1, 2 | sylibr 134 | 1 ⊢ (∃*𝑥𝜑 → ∃*𝑥 ∈ 𝐴 𝜑) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ∃*wmo 2080 ∈ wcel 2202 ∃*wrmo 2513 |
| 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-io 716 ax-5 1495 ax-7 1496 ax-gen 1497 ax-ie1 1541 ax-ie2 1542 ax-8 1552 ax-10 1553 ax-11 1554 ax-i12 1555 ax-bndl 1557 ax-4 1558 ax-17 1574 ax-i9 1578 ax-ial 1582 ax-i5r 1583 |
| This theorem depends on definitions: df-bi 117 df-nf 1509 df-sb 1811 df-eu 2082 df-mo 2083 df-rmo 2518 |
| This theorem is referenced by: reueq 3005 reusv1 4555 |
| Copyright terms: Public domain | W3C validator |