| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > rmoan | Structured version Visualization version GIF version | ||
| Description: Restricted "at most one" still holds when a conjunct is added. (Contributed by NM, 16-Jun-2017.) |
| Ref | Expression |
|---|---|
| rmoan | ⊢ (∃*𝑥 ∈ 𝐴 𝜑 → ∃*𝑥 ∈ 𝐴 (𝜓 ∧ 𝜑)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | moan 2524 | . . 3 ⊢ (∃*𝑥(𝑥 ∈ 𝐴 ∧ 𝜑) → ∃*𝑥(𝜓 ∧ (𝑥 ∈ 𝐴 ∧ 𝜑))) | |
| 2 | an12 838 | . . . 4 ⊢ ((𝜓 ∧ (𝑥 ∈ 𝐴 ∧ 𝜑)) ↔ (𝑥 ∈ 𝐴 ∧ (𝜓 ∧ 𝜑))) | |
| 3 | 2 | mobii 2493 | . . 3 ⊢ (∃*𝑥(𝜓 ∧ (𝑥 ∈ 𝐴 ∧ 𝜑)) ↔ ∃*𝑥(𝑥 ∈ 𝐴 ∧ (𝜓 ∧ 𝜑))) |
| 4 | 1, 3 | sylib 208 | . 2 ⊢ (∃*𝑥(𝑥 ∈ 𝐴 ∧ 𝜑) → ∃*𝑥(𝑥 ∈ 𝐴 ∧ (𝜓 ∧ 𝜑))) |
| 5 | df-rmo 2920 | . 2 ⊢ (∃*𝑥 ∈ 𝐴 𝜑 ↔ ∃*𝑥(𝑥 ∈ 𝐴 ∧ 𝜑)) | |
| 6 | df-rmo 2920 | . 2 ⊢ (∃*𝑥 ∈ 𝐴 (𝜓 ∧ 𝜑) ↔ ∃*𝑥(𝑥 ∈ 𝐴 ∧ (𝜓 ∧ 𝜑))) | |
| 7 | 4, 5, 6 | 3imtr4i 281 | 1 ⊢ (∃*𝑥 ∈ 𝐴 𝜑 → ∃*𝑥 ∈ 𝐴 (𝜓 ∧ 𝜑)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 384 ∈ wcel 1990 ∃*wmo 2471 ∃*wrmo 2915 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1722 ax-4 1737 ax-5 1839 ax-6 1888 ax-7 1935 ax-10 2019 ax-12 2047 |
| This theorem depends on definitions: df-bi 197 df-or 385 df-an 386 df-tru 1486 df-ex 1705 df-nf 1710 df-eu 2474 df-mo 2475 df-rmo 2920 |
| This theorem is referenced by: reuxfr2d 4891 reuxfr3d 29329 |
| Copyright terms: Public domain | W3C validator |