Metamath Proof Explorer < Previous   Next > Nearby theorems Mirrors  >  Home  >  MPE Home  >  Th. List  >  rmoim Structured version   Visualization version   GIF version

Theorem rmoim 3679
 Description: Restricted "at most one" is preserved through implication (note wff reversal). (Contributed by Alexander van der Vekens, 17-Jun-2017.)
Assertion
Ref Expression
rmoim (∀𝑥𝐴 (𝜑𝜓) → (∃*𝑥𝐴 𝜓 → ∃*𝑥𝐴 𝜑))

Proof of Theorem rmoim
StepHypRef Expression
1 df-ral 3111 . . 3 (∀𝑥𝐴 (𝜑𝜓) ↔ ∀𝑥(𝑥𝐴 → (𝜑𝜓)))
2 imdistan 571 . . . 4 ((𝑥𝐴 → (𝜑𝜓)) ↔ ((𝑥𝐴𝜑) → (𝑥𝐴𝜓)))
32albii 1821 . . 3 (∀𝑥(𝑥𝐴 → (𝜑𝜓)) ↔ ∀𝑥((𝑥𝐴𝜑) → (𝑥𝐴𝜓)))
41, 3bitri 278 . 2 (∀𝑥𝐴 (𝜑𝜓) ↔ ∀𝑥((𝑥𝐴𝜑) → (𝑥𝐴𝜓)))
5 moim 2602 . . 3 (∀𝑥((𝑥𝐴𝜑) → (𝑥𝐴𝜓)) → (∃*𝑥(𝑥𝐴𝜓) → ∃*𝑥(𝑥𝐴𝜑)))
6 df-rmo 3114 . . 3 (∃*𝑥𝐴 𝜓 ↔ ∃*𝑥(𝑥𝐴𝜓))
7 df-rmo 3114 . . 3 (∃*𝑥𝐴 𝜑 ↔ ∃*𝑥(𝑥𝐴𝜑))
85, 6, 73imtr4g 299 . 2 (∀𝑥((𝑥𝐴𝜑) → (𝑥𝐴𝜓)) → (∃*𝑥𝐴 𝜓 → ∃*𝑥𝐴 𝜑))
94, 8sylbi 220 1 (∀𝑥𝐴 (𝜑𝜓) → (∃*𝑥𝐴 𝜓 → ∃*𝑥𝐴 𝜑))
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ∧ wa 399  ∀wal 1536   ∈ wcel 2111  ∃*wmo 2596  ∀wral 3106  ∃*wrmo 3109 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1911 This theorem depends on definitions:  df-bi 210  df-an 400  df-ex 1782  df-mo 2598  df-ral 3111  df-rmo 3114 This theorem is referenced by:  rmoimia  3680  reuimrmo  3684  2rmorex  3693  2reurex  3698  disjss2  4998  catideu  16940  rinvmod  18925  frlmup4  20494  evlseu  20759  2ndcdisj  22068  2sqreulem1  26037  2sqreunnlem1  26040  poimirlem18  35091  poimirlem21  35094
 Copyright terms: Public domain W3C validator