Users' Mathboxes Mathbox for Thierry Arnoux < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  rmounid Structured version   Visualization version   GIF version

Theorem rmounid 30259
Description: Case where an "at most one" restricted existential quantifier for a union is equivalent to such a quantifier for one of the sets. (Contributed by Thierry Arnoux, 27-Nov-2023.)
Hypothesis
Ref Expression
rmounid.1 ((𝜑𝑥𝐵) → ¬ 𝜓)
Assertion
Ref Expression
rmounid (𝜑 → (∃*𝑥 ∈ (𝐴𝐵)𝜓 ↔ ∃*𝑥𝐴 𝜓))
Distinct variable group:   𝜑,𝑥
Allowed substitution hints:   𝜓(𝑥)   𝐴(𝑥)   𝐵(𝑥)

Proof of Theorem rmounid
StepHypRef Expression
1 rmounid.1 . . . . . . . . . . . 12 ((𝜑𝑥𝐵) → ¬ 𝜓)
21ex 415 . . . . . . . . . . 11 (𝜑 → (𝑥𝐵 → ¬ 𝜓))
32con2d 136 . . . . . . . . . 10 (𝜑 → (𝜓 → ¬ 𝑥𝐵))
43imp 409 . . . . . . . . 9 ((𝜑𝜓) → ¬ 𝑥𝐵)
5 biorf 933 . . . . . . . . . 10 𝑥𝐵 → (𝑥𝐴 ↔ (𝑥𝐵𝑥𝐴)))
6 orcom 866 . . . . . . . . . 10 ((𝑥𝐴𝑥𝐵) ↔ (𝑥𝐵𝑥𝐴))
75, 6syl6bbr 291 . . . . . . . . 9 𝑥𝐵 → (𝑥𝐴 ↔ (𝑥𝐴𝑥𝐵)))
84, 7syl 17 . . . . . . . 8 ((𝜑𝜓) → (𝑥𝐴 ↔ (𝑥𝐴𝑥𝐵)))
9 elun 4125 . . . . . . . 8 (𝑥 ∈ (𝐴𝐵) ↔ (𝑥𝐴𝑥𝐵))
108, 9syl6bbr 291 . . . . . . 7 ((𝜑𝜓) → (𝑥𝐴𝑥 ∈ (𝐴𝐵)))
1110pm5.32da 581 . . . . . 6 (𝜑 → ((𝜓𝑥𝐴) ↔ (𝜓𝑥 ∈ (𝐴𝐵))))
1211biancomd 466 . . . . 5 (𝜑 → ((𝜓𝑥𝐴) ↔ (𝑥 ∈ (𝐴𝐵) ∧ 𝜓)))
1312bicomd 225 . . . 4 (𝜑 → ((𝑥 ∈ (𝐴𝐵) ∧ 𝜓) ↔ (𝜓𝑥𝐴)))
1413biancomd 466 . . 3 (𝜑 → ((𝑥 ∈ (𝐴𝐵) ∧ 𝜓) ↔ (𝑥𝐴𝜓)))
1514mobidv 2633 . 2 (𝜑 → (∃*𝑥(𝑥 ∈ (𝐴𝐵) ∧ 𝜓) ↔ ∃*𝑥(𝑥𝐴𝜓)))
16 df-rmo 3146 . 2 (∃*𝑥 ∈ (𝐴𝐵)𝜓 ↔ ∃*𝑥(𝑥 ∈ (𝐴𝐵) ∧ 𝜓))
17 df-rmo 3146 . 2 (∃*𝑥𝐴 𝜓 ↔ ∃*𝑥(𝑥𝐴𝜓))
1815, 16, 173bitr4g 316 1 (𝜑 → (∃*𝑥 ∈ (𝐴𝐵)𝜓 ↔ ∃*𝑥𝐴 𝜓))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 208  wa 398  wo 843  wcel 2114  ∃*wmo 2620  ∃*wrmo 3141  cun 3934
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2161  ax-12 2177  ax-ext 2793
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-tru 1540  df-ex 1781  df-nf 1785  df-sb 2070  df-mo 2622  df-clab 2800  df-cleq 2814  df-clel 2893  df-nfc 2963  df-rmo 3146  df-v 3496  df-un 3941
This theorem is referenced by:  disjxun0  30324
  Copyright terms: Public domain W3C validator