| 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 2114 | . 2 ⊢ (∃*𝑥𝜑 → ∃*𝑥(𝑥 ∈ 𝐴 ∧ 𝜑)) | |
| 2 | df-rmo 2483 | . 2 ⊢ (∃*𝑥 ∈ 𝐴 𝜑 ↔ ∃*𝑥(𝑥 ∈ 𝐴 ∧ 𝜑)) | |
| 3 | 1, 2 | sylibr 134 | 1 ⊢ (∃*𝑥𝜑 → ∃*𝑥 ∈ 𝐴 𝜑) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ∃*wmo 2046 ∈ wcel 2167 ∃*wrmo 2478 |
| 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 710 ax-5 1461 ax-7 1462 ax-gen 1463 ax-ie1 1507 ax-ie2 1508 ax-8 1518 ax-10 1519 ax-11 1520 ax-i12 1521 ax-bndl 1523 ax-4 1524 ax-17 1540 ax-i9 1544 ax-ial 1548 ax-i5r 1549 |
| This theorem depends on definitions: df-bi 117 df-nf 1475 df-sb 1777 df-eu 2048 df-mo 2049 df-rmo 2483 |
| This theorem is referenced by: reueq 2963 reusv1 4493 |
| Copyright terms: Public domain | W3C validator |