| 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 3092 | . 2 ⊢ (∃𝑦 ∈ 𝐴 ∀𝑥 ∈ 𝐴 (𝜑 → 𝑥 = 𝑦) → ∃𝑦∀𝑥 ∈ 𝐴 (𝜑 → 𝑥 = 𝑦)) | |
| 2 | rmo2.1 | . . 3 ⊢ Ⅎ𝑦𝜑 | |
| 3 | 2 | rmo2 3833 | . 2 ⊢ (∃*𝑥 ∈ 𝐴 𝜑 ↔ ∃𝑦∀𝑥 ∈ 𝐴 (𝜑 → 𝑥 = 𝑦)) |
| 4 | 1, 3 | sylibr 237 | 1 ⊢ (∃𝑦 ∈ 𝐴 ∀𝑥 ∈ 𝐴 (𝜑 → 𝑥 = 𝑦) → ∃*𝑥 ∈ 𝐴 𝜑) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∃wex 1811 Ⅎwnf 1815 ∀wral 3076 ∃wrex 3086 ∃*wrmo 3364 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-10 2177 ax-11 2193 ax-12 2212 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-tru 1572 df-ex 1812 df-nf 1816 df-mo 2564 df-ral 3077 df-rex 3087 df-rmo 3365 |
| This theorem is used by: prlngmo2 29440 rmo6 35757 srepdflem1 36005 srepdflem2 36006 mndmolinv 43239 modelaxreplem2 46063 |
| Copyright terms: Public domain | W3C validator |