| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > rmo2i | Structured version Visualization version GIF version | ||
| Description: Condition implying restricted "at most one". (Contributed by NM, 17-Jun-2017.) |
| Ref | Expression |
|---|---|
| rmo2.1 | ⊢ Ⅎ𝑦𝜑 |
| Ref | Expression |
|---|---|
| rmo2i | ⊢ (∃𝑦 ∈ 𝐴 ∀𝑥 ∈ 𝐴 (𝜑 → 𝑥 = 𝑦) → ∃*𝑥 ∈ 𝐴 𝜑) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | rexex 3095 | . 2 ⊢ (∃𝑦 ∈ 𝐴 ∀𝑥 ∈ 𝐴 (𝜑 → 𝑥 = 𝑦) → ∃𝑦∀𝑥 ∈ 𝐴 (𝜑 → 𝑥 = 𝑦)) | |
| 2 | rmo2.1 | . . 3 ⊢ Ⅎ𝑦𝜑 | |
| 3 | 2 | rmo2 3843 | . 2 ⊢ (∃*𝑥 ∈ 𝐴 𝜑 ↔ ∃𝑦∀𝑥 ∈ 𝐴 (𝜑 → 𝑥 = 𝑦)) |
| 4 | 1, 3 | sylibr 237 | 1 ⊢ (∃𝑦 ∈ 𝐴 ∀𝑥 ∈ 𝐴 (𝜑 → 𝑥 = 𝑦) → ∃*𝑥 ∈ 𝐴 𝜑) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∃wex 1802 Ⅎwnf 1806 ∀wral 3079 ∃wrex 3089 ∃*wrmo 3369 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1818 ax-4 1832 ax-5 1933 ax-6 1990 ax-7 2031 ax-10 2178 ax-11 2194 ax-12 2215 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-tru 1566 df-ex 1803 df-nf 1807 df-mo 2569 df-ral 3080 df-rex 3090 df-rmo 3370 |
| This theorem is referenced by: mndmolinv 42719 modelaxreplem2 45547 |
| Copyright terms: Public domain | W3C validator |