Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > rmoim | Structured version Visualization version GIF version |
Description: Restricted "at most one" is preserved through implication (note wff reversal). (Contributed by Alexander van der Vekens, 17-Jun-2017.) |
Ref | Expression |
---|---|
rmoim | ⊢ (∀𝑥 ∈ 𝐴 (𝜑 → 𝜓) → (∃*𝑥 ∈ 𝐴 𝜓 → ∃*𝑥 ∈ 𝐴 𝜑)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | df-ral 3143 | . . 3 ⊢ (∀𝑥 ∈ 𝐴 (𝜑 → 𝜓) ↔ ∀𝑥(𝑥 ∈ 𝐴 → (𝜑 → 𝜓))) | |
2 | imdistan 570 | . . . 4 ⊢ ((𝑥 ∈ 𝐴 → (𝜑 → 𝜓)) ↔ ((𝑥 ∈ 𝐴 ∧ 𝜑) → (𝑥 ∈ 𝐴 ∧ 𝜓))) | |
3 | 2 | albii 1816 | . . 3 ⊢ (∀𝑥(𝑥 ∈ 𝐴 → (𝜑 → 𝜓)) ↔ ∀𝑥((𝑥 ∈ 𝐴 ∧ 𝜑) → (𝑥 ∈ 𝐴 ∧ 𝜓))) |
4 | 1, 3 | bitri 277 | . 2 ⊢ (∀𝑥 ∈ 𝐴 (𝜑 → 𝜓) ↔ ∀𝑥((𝑥 ∈ 𝐴 ∧ 𝜑) → (𝑥 ∈ 𝐴 ∧ 𝜓))) |
5 | moim 2622 | . . 3 ⊢ (∀𝑥((𝑥 ∈ 𝐴 ∧ 𝜑) → (𝑥 ∈ 𝐴 ∧ 𝜓)) → (∃*𝑥(𝑥 ∈ 𝐴 ∧ 𝜓) → ∃*𝑥(𝑥 ∈ 𝐴 ∧ 𝜑))) | |
6 | df-rmo 3146 | . . 3 ⊢ (∃*𝑥 ∈ 𝐴 𝜓 ↔ ∃*𝑥(𝑥 ∈ 𝐴 ∧ 𝜓)) | |
7 | df-rmo 3146 | . . 3 ⊢ (∃*𝑥 ∈ 𝐴 𝜑 ↔ ∃*𝑥(𝑥 ∈ 𝐴 ∧ 𝜑)) | |
8 | 5, 6, 7 | 3imtr4g 298 | . 2 ⊢ (∀𝑥((𝑥 ∈ 𝐴 ∧ 𝜑) → (𝑥 ∈ 𝐴 ∧ 𝜓)) → (∃*𝑥 ∈ 𝐴 𝜓 → ∃*𝑥 ∈ 𝐴 𝜑)) |
9 | 4, 8 | sylbi 219 | 1 ⊢ (∀𝑥 ∈ 𝐴 (𝜑 → 𝜓) → (∃*𝑥 ∈ 𝐴 𝜓 → ∃*𝑥 ∈ 𝐴 𝜑)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 398 ∀wal 1531 ∈ wcel 2110 ∃*wmo 2616 ∀wral 3138 ∃*wrmo 3141 |
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 1907 |
This theorem depends on definitions: df-bi 209 df-an 399 df-ex 1777 df-mo 2618 df-ral 3143 df-rmo 3146 |
This theorem is referenced by: rmoimia 3731 reuimrmo 3735 2rmorex 3744 2reurex 3749 disjss2 5026 catideu 16940 rinvmod 18923 evlseu 20290 frlmup4 20939 2ndcdisj 22058 2sqreulem1 26016 2sqreunnlem1 26019 poimirlem18 34904 poimirlem21 34907 |
Copyright terms: Public domain | W3C validator |