Users' Mathboxes Mathbox for Peter Mazsa < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  exanres3 Structured version   Visualization version   GIF version

Theorem exanres3 39235
Description: Equivalent expressions with restricted existential quantification. (Contributed by Peter Mazsa, 10-Sep-2021.)
Assertion
Ref Expression
exanres3 ((𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑊) → (∃𝑢 ∈ 𝐴 (𝐵 ∈ [𝑢]𝑅 ∧ 𝐶 ∈ [𝑢]𝑆) ↔ ∃𝑢 ∈ 𝐴 (𝑢𝑅𝐵 ∧ 𝑢𝑆𝐶)))
Distinct variable groups:   𝑢,𝐵   𝑢,𝐶   𝑢,𝑉   𝑢,𝑊
Allowed substitution hints:   𝐴(𝑢)   𝑅(𝑢)   𝑆(𝑢)

Proof of Theorem exanres3
StepHypRef Expression
1 elecALTV 39204 . . . 4 ((𝑢 ∈ V ∧ 𝐵 ∈ 𝑉) → (𝐵 ∈ [𝑢]𝑅 ↔ 𝑢𝑅𝐵))
21el2v1 39162 . . 3 (𝐵 ∈ 𝑉 → (𝐵 ∈ [𝑢]𝑅 ↔ 𝑢𝑅𝐵))
3 elecALTV 39204 . . . 4 ((𝑢 ∈ V ∧ 𝐶 ∈ 𝑊) → (𝐶 ∈ [𝑢]𝑆 ↔ 𝑢𝑆𝐶))
43el2v1 39162 . . 3 (𝐶 ∈ 𝑊 → (𝐶 ∈ [𝑢]𝑆 ↔ 𝑢𝑆𝐶))
52, 4bi2anan9 650 . 2 ((𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑊) → ((𝐵 ∈ [𝑢]𝑅 ∧ 𝐶 ∈ [𝑢]𝑆) ↔ (𝑢𝑅𝐵 ∧ 𝑢𝑆𝐶)))
65rexbidv 3186 1 ((𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑊) → (∃𝑢 ∈ 𝐴 (𝐵 ∈ [𝑢]𝑅 ∧ 𝐶 ∈ [𝑢]𝑆) ↔ ∃𝑢 ∈ 𝐴 (𝑢𝑅𝐵 ∧ 𝑢𝑆𝐶)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∈ wcel 2144  ∃wrex 3086  Vcvv 3450   class class class wbr 5102  [cec 8715
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 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-ext 2732  ax-sep 5248  ax-pr 5390
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-sb 2099  df-clab 2739  df-cleq 2752  df-clel 2835  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-ss 3896  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-sn 4584  df-pr 4586  df-op 4590  df-br 5103  df-opab 5167  df-xp 5656  df-cnv 5658  df-dm 5660  df-rn 5661  df-res 5662  df-ima 5663  df-ec 8719
This theorem is used by:  exanres2  39236  br1cossres2  39463
  Copyright terms: Public domain W3C validator