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

Theorem rexiunxp 5821
Description: Write a double restricted quantification as one universal quantifier. In this version of rexxp 5823, 𝐵(𝑦) is not assumed to be constant. (Contributed by Mario Carneiro, 14-Feb-2015.)
Hypothesis
Ref Expression
ralxp.1 (𝑥 = ⟨𝑦, 𝑧⟩ → (𝜑 ↔ 𝜓))
Assertion
Ref Expression
rexiunxp (∃𝑥 ∈ ∪ 𝑦 ∈ 𝐴 ({𝑦} × 𝐵)𝜑 ↔ ∃𝑦 ∈ 𝐴 ∃𝑧 ∈ 𝐵 𝜓)
Distinct variable groups:   𝑥,𝑦,𝑧,𝐴   𝑥,𝐵,𝑧   𝜑,𝑦,𝑧   𝜓,𝑥
Allowed substitution hints:   𝜑(𝑥)   𝜓(𝑦, 𝑧)   𝐵(𝑦)

Proof of Theorem rexiunxp
StepHypRef Expression
1 ralxp.1 . . . . . 6 (𝑥 = ⟨𝑦, 𝑧⟩ → (𝜑 ↔ 𝜓))
21notbid 321 . . . . 5 (𝑥 = ⟨𝑦, 𝑧⟩ → (¬ 𝜑 ↔ ¬ 𝜓))
32raliunxp 5820 . . . 4 (∀𝑥 ∈ ∪ 𝑦 ∈ 𝐴 ({𝑦} × 𝐵) ¬ 𝜑 ↔ ∀𝑦 ∈ 𝐴 ∀𝑧 ∈ 𝐵 ¬ 𝜓)
4 ralnex 3091 . . . . 5 (∀𝑧 ∈ 𝐵 ¬ 𝜓 ↔ ¬ ∃𝑧 ∈ 𝐵 𝜓)
54ralbii 3111 . . . 4 (∀𝑦 ∈ 𝐴 ∀𝑧 ∈ 𝐵 ¬ 𝜓 ↔ ∀𝑦 ∈ 𝐴 ¬ ∃𝑧 ∈ 𝐵 𝜓)
63, 5bitri 278 . . 3 (∀𝑥 ∈ ∪ 𝑦 ∈ 𝐴 ({𝑦} × 𝐵) ¬ 𝜑 ↔ ∀𝑦 ∈ 𝐴 ¬ ∃𝑧 ∈ 𝐵 𝜓)
76notbii 323 . 2 (¬ ∀𝑥 ∈ ∪ 𝑦 ∈ 𝐴 ({𝑦} × 𝐵) ¬ 𝜑 ↔ ¬ ∀𝑦 ∈ 𝐴 ¬ ∃𝑧 ∈ 𝐵 𝜓)
8 dfrex2 3092 . 2 (∃𝑥 ∈ ∪ 𝑦 ∈ 𝐴 ({𝑦} × 𝐵)𝜑 ↔ ¬ ∀𝑥 ∈ ∪ 𝑦 ∈ 𝐴 ({𝑦} × 𝐵) ¬ 𝜑)
9 dfrex2 3092 . 2 (∃𝑦 ∈ 𝐴 ∃𝑧 ∈ 𝐵 𝜓 ↔ ¬ ∀𝑦 ∈ 𝐴 ¬ ∃𝑧 ∈ 𝐵 𝜓)
107, 8, 93bitr4i 306 1 (∃𝑥 ∈ ∪ 𝑦 ∈ 𝐴 ({𝑦} × 𝐵)𝜑 ↔ ∃𝑦 ∈ 𝐴 ∃𝑧 ∈ 𝐵 𝜓)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   = wceq 1569  ∀wral 3079  ∃wrex 3089  {csn 4587  ⟨cop 4837  ∪ ciun 4953   × cxp 5652
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1944  ax-6 2001  ax-7 2042  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2196  ax-12 2215  ax-ext 2735  ax-sep 5251  ax-pr 5394
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2101  df-clab 2742  df-cleq 2755  df-clel 2838  df-nfc 2912  df-ral 3080  df-rex 3090  df-rab 3416  df-v 3455  df-sbc 3742  df-csb 3851  df-ss 3900  df-dif 4049  df-in 4093  df-un 4153  df-nul 4281  df-if 4485  df-sn 4588  df-pr 4590  df-op 4838  df-iun 4955  df-opab 5170  df-xp 5660  df-rel 5661
This theorem is used by:  rexxp  5823  fsumvma  27552  cvmliftlem15  36184  filnetlem4  37296
  Copyright terms: Public domain W3C validator