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

Theorem rmoanim 3854
Description: Introduction of a conjunct into restricted "at most one" quantifier, analogous to moanim 2617. (Contributed by Alexander van der Vekens, 25-Jun-2017.) Avoid ax-10 2138 and ax-11 2155. (Revised by Gino Giotto, 24-Aug-2023.)
Hypothesis
Ref Expression
rmoanim.1 𝑥𝜑
Assertion
Ref Expression
rmoanim (∃*𝑥𝐴 (𝜑𝜓) ↔ (𝜑 → ∃*𝑥𝐴 𝜓))

Proof of Theorem rmoanim
Dummy variable 𝑦 is distinct from all other variables.
StepHypRef Expression
1 impexp 452 . . . . 5 (((𝜑𝜓) → 𝑥 = 𝑦) ↔ (𝜑 → (𝜓𝑥 = 𝑦)))
21ralbii 3093 . . . 4 (∀𝑥𝐴 ((𝜑𝜓) → 𝑥 = 𝑦) ↔ ∀𝑥𝐴 (𝜑 → (𝜓𝑥 = 𝑦)))
3 rmoanim.1 . . . . 5 𝑥𝜑
43r19.21 3236 . . . 4 (∀𝑥𝐴 (𝜑 → (𝜓𝑥 = 𝑦)) ↔ (𝜑 → ∀𝑥𝐴 (𝜓𝑥 = 𝑦)))
52, 4bitri 275 . . 3 (∀𝑥𝐴 ((𝜑𝜓) → 𝑥 = 𝑦) ↔ (𝜑 → ∀𝑥𝐴 (𝜓𝑥 = 𝑦)))
65exbii 1851 . 2 (∃𝑦𝑥𝐴 ((𝜑𝜓) → 𝑥 = 𝑦) ↔ ∃𝑦(𝜑 → ∀𝑥𝐴 (𝜓𝑥 = 𝑦)))
7 df-rmo 3352 . . 3 (∃*𝑥𝐴 (𝜑𝜓) ↔ ∃*𝑥(𝑥𝐴 ∧ (𝜑𝜓)))
8 df-mo 2535 . . 3 (∃*𝑥(𝑥𝐴 ∧ (𝜑𝜓)) ↔ ∃𝑦𝑥((𝑥𝐴 ∧ (𝜑𝜓)) → 𝑥 = 𝑦))
9 impexp 452 . . . . . 6 (((𝑥𝐴 ∧ (𝜑𝜓)) → 𝑥 = 𝑦) ↔ (𝑥𝐴 → ((𝜑𝜓) → 𝑥 = 𝑦)))
109albii 1822 . . . . 5 (∀𝑥((𝑥𝐴 ∧ (𝜑𝜓)) → 𝑥 = 𝑦) ↔ ∀𝑥(𝑥𝐴 → ((𝜑𝜓) → 𝑥 = 𝑦)))
11 df-ral 3062 . . . . 5 (∀𝑥𝐴 ((𝜑𝜓) → 𝑥 = 𝑦) ↔ ∀𝑥(𝑥𝐴 → ((𝜑𝜓) → 𝑥 = 𝑦)))
1210, 11bitr4i 278 . . . 4 (∀𝑥((𝑥𝐴 ∧ (𝜑𝜓)) → 𝑥 = 𝑦) ↔ ∀𝑥𝐴 ((𝜑𝜓) → 𝑥 = 𝑦))
1312exbii 1851 . . 3 (∃𝑦𝑥((𝑥𝐴 ∧ (𝜑𝜓)) → 𝑥 = 𝑦) ↔ ∃𝑦𝑥𝐴 ((𝜑𝜓) → 𝑥 = 𝑦))
147, 8, 133bitri 297 . 2 (∃*𝑥𝐴 (𝜑𝜓) ↔ ∃𝑦𝑥𝐴 ((𝜑𝜓) → 𝑥 = 𝑦))
15 df-rmo 3352 . . . . 5 (∃*𝑥𝐴 𝜓 ↔ ∃*𝑥(𝑥𝐴𝜓))
16 df-mo 2535 . . . . 5 (∃*𝑥(𝑥𝐴𝜓) ↔ ∃𝑦𝑥((𝑥𝐴𝜓) → 𝑥 = 𝑦))
17 impexp 452 . . . . . . . 8 (((𝑥𝐴𝜓) → 𝑥 = 𝑦) ↔ (𝑥𝐴 → (𝜓𝑥 = 𝑦)))
1817albii 1822 . . . . . . 7 (∀𝑥((𝑥𝐴𝜓) → 𝑥 = 𝑦) ↔ ∀𝑥(𝑥𝐴 → (𝜓𝑥 = 𝑦)))
19 df-ral 3062 . . . . . . 7 (∀𝑥𝐴 (𝜓𝑥 = 𝑦) ↔ ∀𝑥(𝑥𝐴 → (𝜓𝑥 = 𝑦)))
2018, 19bitr4i 278 . . . . . 6 (∀𝑥((𝑥𝐴𝜓) → 𝑥 = 𝑦) ↔ ∀𝑥𝐴 (𝜓𝑥 = 𝑦))
2120exbii 1851 . . . . 5 (∃𝑦𝑥((𝑥𝐴𝜓) → 𝑥 = 𝑦) ↔ ∃𝑦𝑥𝐴 (𝜓𝑥 = 𝑦))
2215, 16, 213bitri 297 . . . 4 (∃*𝑥𝐴 𝜓 ↔ ∃𝑦𝑥𝐴 (𝜓𝑥 = 𝑦))
2322imbi2i 336 . . 3 ((𝜑 → ∃*𝑥𝐴 𝜓) ↔ (𝜑 → ∃𝑦𝑥𝐴 (𝜓𝑥 = 𝑦)))
24 19.37v 1996 . . 3 (∃𝑦(𝜑 → ∀𝑥𝐴 (𝜓𝑥 = 𝑦)) ↔ (𝜑 → ∃𝑦𝑥𝐴 (𝜓𝑥 = 𝑦)))
2523, 24bitr4i 278 . 2 ((𝜑 → ∃*𝑥𝐴 𝜓) ↔ ∃𝑦(𝜑 → ∀𝑥𝐴 (𝜓𝑥 = 𝑦)))
266, 14, 253bitr4i 303 1 (∃*𝑥𝐴 (𝜑𝜓) ↔ (𝜑 → ∃*𝑥𝐴 𝜓))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 205  wa 397  wal 1540  wex 1782  wnf 1786  wcel 2107  ∃*wmo 2533  wral 3061  ∃*wrmo 3351
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1914  ax-6 1972  ax-7 2012  ax-12 2172
This theorem depends on definitions:  df-bi 206  df-an 398  df-ex 1783  df-nf 1787  df-mo 2535  df-ral 3062  df-rmo 3352
This theorem is referenced by:  2reu1  3857
  Copyright terms: Public domain W3C validator