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

Theorem 2ralunsn 4615
Description: Double restricted quantification over the union of a set and a singleton, using implicit substitution. (Contributed by Paul Chapman, 17-Nov-2012.)
Hypotheses
Ref Expression
2ralunsn.1 (𝑥 = 𝐵 → (𝜑𝜒))
2ralunsn.2 (𝑦 = 𝐵 → (𝜑𝜓))
2ralunsn.3 (𝑥 = 𝐵 → (𝜓𝜃))
Assertion
Ref Expression
2ralunsn (𝐵𝐶 → (∀𝑥 ∈ (𝐴 ∪ {𝐵})∀𝑦 ∈ (𝐴 ∪ {𝐵})𝜑 ↔ ((∀𝑥𝐴𝑦𝐴 𝜑 ∧ ∀𝑥𝐴 𝜓) ∧ (∀𝑦𝐴 𝜒𝜃))))
Distinct variable groups:   𝑥,𝐴   𝑥,𝐵,𝑦   𝑥,𝐶   𝜒,𝑥   𝜓,𝑦   𝜃,𝑥
Allowed substitution hints:   𝜑(𝑥,𝑦)   𝜓(𝑥)   𝜒(𝑦)   𝜃(𝑦)   𝐴(𝑦)   𝐶(𝑦)

Proof of Theorem 2ralunsn
StepHypRef Expression
1 2ralunsn.2 . . . 4 (𝑦 = 𝐵 → (𝜑𝜓))
21ralunsn 4614 . . 3 (𝐵𝐶 → (∀𝑦 ∈ (𝐴 ∪ {𝐵})𝜑 ↔ (∀𝑦𝐴 𝜑𝜓)))
32ralbidv 3167 . 2 (𝐵𝐶 → (∀𝑥 ∈ (𝐴 ∪ {𝐵})∀𝑦 ∈ (𝐴 ∪ {𝐵})𝜑 ↔ ∀𝑥 ∈ (𝐴 ∪ {𝐵})(∀𝑦𝐴 𝜑𝜓)))
4 2ralunsn.1 . . . . . 6 (𝑥 = 𝐵 → (𝜑𝜒))
54ralbidv 3167 . . . . 5 (𝑥 = 𝐵 → (∀𝑦𝐴 𝜑 ↔ ∀𝑦𝐴 𝜒))
6 2ralunsn.3 . . . . 5 (𝑥 = 𝐵 → (𝜓𝜃))
75, 6anbi12d 625 . . . 4 (𝑥 = 𝐵 → ((∀𝑦𝐴 𝜑𝜓) ↔ (∀𝑦𝐴 𝜒𝜃)))
87ralunsn 4614 . . 3 (𝐵𝐶 → (∀𝑥 ∈ (𝐴 ∪ {𝐵})(∀𝑦𝐴 𝜑𝜓) ↔ (∀𝑥𝐴 (∀𝑦𝐴 𝜑𝜓) ∧ (∀𝑦𝐴 𝜒𝜃))))
9 r19.26 3245 . . . 4 (∀𝑥𝐴 (∀𝑦𝐴 𝜑𝜓) ↔ (∀𝑥𝐴𝑦𝐴 𝜑 ∧ ∀𝑥𝐴 𝜓))
109anbi1i 618 . . 3 ((∀𝑥𝐴 (∀𝑦𝐴 𝜑𝜓) ∧ (∀𝑦𝐴 𝜒𝜃)) ↔ ((∀𝑥𝐴𝑦𝐴 𝜑 ∧ ∀𝑥𝐴 𝜓) ∧ (∀𝑦𝐴 𝜒𝜃)))
118, 10syl6bb 279 . 2 (𝐵𝐶 → (∀𝑥 ∈ (𝐴 ∪ {𝐵})(∀𝑦𝐴 𝜑𝜓) ↔ ((∀𝑥𝐴𝑦𝐴 𝜑 ∧ ∀𝑥𝐴 𝜓) ∧ (∀𝑦𝐴 𝜒𝜃))))
123, 11bitrd 271 1 (𝐵𝐶 → (∀𝑥 ∈ (𝐴 ∪ {𝐵})∀𝑦 ∈ (𝐴 ∪ {𝐵})𝜑 ↔ ((∀𝑥𝐴𝑦𝐴 𝜑 ∧ ∀𝑥𝐴 𝜓) ∧ (∀𝑦𝐴 𝜒𝜃))))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 198  wa 385   = wceq 1653  wcel 2157  wral 3089  cun 3767  {csn 4368
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1891  ax-4 1905  ax-5 2006  ax-6 2072  ax-7 2107  ax-9 2166  ax-10 2185  ax-11 2200  ax-12 2213  ax-ext 2777
This theorem depends on definitions:  df-bi 199  df-an 386  df-or 875  df-3an 1110  df-tru 1657  df-ex 1876  df-nf 1880  df-sb 2065  df-clab 2786  df-cleq 2792  df-clel 2795  df-nfc 2930  df-ral 3094  df-v 3387  df-sbc 3634  df-un 3774  df-sn 4369
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator