![]() |
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 3074 | . 2 ⊢ (∃𝑦 ∈ 𝐴 ∀𝑥 ∈ 𝐴 (𝜑 → 𝑥 = 𝑦) → ∃𝑦∀𝑥 ∈ 𝐴 (𝜑 → 𝑥 = 𝑦)) | |
2 | rmo2.1 | . . 3 ⊢ Ⅎ𝑦𝜑 | |
3 | 2 | rmo2 3896 | . 2 ⊢ (∃*𝑥 ∈ 𝐴 𝜑 ↔ ∃𝑦∀𝑥 ∈ 𝐴 (𝜑 → 𝑥 = 𝑦)) |
4 | 1, 3 | sylibr 234 | 1 ⊢ (∃𝑦 ∈ 𝐴 ∀𝑥 ∈ 𝐴 (𝜑 → 𝑥 = 𝑦) → ∃*𝑥 ∈ 𝐴 𝜑) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∃wex 1776 Ⅎwnf 1780 ∀wral 3059 ∃wrex 3068 ∃*wrmo 3377 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1908 ax-6 1965 ax-7 2005 ax-10 2139 ax-11 2155 ax-12 2175 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-tru 1540 df-ex 1777 df-nf 1781 df-mo 2538 df-ral 3060 df-rex 3069 df-rmo 3378 |
This theorem is referenced by: mndmolinv 42077 modelaxreplem2 44944 |
Copyright terms: Public domain | W3C validator |