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

Theorem inecmo 39024
Description: Equivalence of a double restricted universal quantification and a restricted "at most one" inside a universal quantification. (Contributed by Peter Mazsa, 29-May-2018.)
Hypothesis
Ref Expression
inecmo.1 (𝑥 = 𝑦𝐵 = 𝐶)
Assertion
Ref Expression
inecmo (Rel 𝑅 → (∀𝑥𝐴𝑦𝐴 (𝑥 = 𝑦 ∨ ([𝐵]𝑅 ∩ [𝐶]𝑅) = ∅) ↔ ∀𝑧∃*𝑥𝐴 𝐵𝑅𝑧))
Distinct variable groups:   𝑥,𝐴,𝑦,𝑧   𝑦,𝐵,𝑧   𝑥,𝐶,𝑧   𝑥,𝑅,𝑦,𝑧
Allowed substitution hints:   𝐵(𝑥)   𝐶(𝑦)

Proof of Theorem inecmo
StepHypRef Expression
1 ineleq 39023 . . 3 (∀𝑥𝐴𝑦𝐴 (𝑥 = 𝑦 ∨ ([𝐵]𝑅 ∩ [𝐶]𝑅) = ∅) ↔ ∀𝑥𝐴𝑧𝑦𝐴 ((𝑧 ∈ [𝐵]𝑅𝑧 ∈ [𝐶]𝑅) → 𝑥 = 𝑦))
2 ralcom4 3291 . . 3 (∀𝑥𝐴𝑧𝑦𝐴 ((𝑧 ∈ [𝐵]𝑅𝑧 ∈ [𝐶]𝑅) → 𝑥 = 𝑦) ↔ ∀𝑧𝑥𝐴𝑦𝐴 ((𝑧 ∈ [𝐵]𝑅𝑧 ∈ [𝐶]𝑅) → 𝑥 = 𝑦))
31, 2bitri 278 . 2 (∀𝑥𝐴𝑦𝐴 (𝑥 = 𝑦 ∨ ([𝐵]𝑅 ∩ [𝐶]𝑅) = ∅) ↔ ∀𝑧𝑥𝐴𝑦𝐴 ((𝑧 ∈ [𝐵]𝑅𝑧 ∈ [𝐶]𝑅) → 𝑥 = 𝑦))
4 inecmo.1 . . . . . 6 (𝑥 = 𝑦𝐵 = 𝐶)
54breq1d 5119 . . . . 5 (𝑥 = 𝑦 → (𝐵𝑅𝑧𝐶𝑅𝑧))
65rmo4 3693 . . . 4 (∃*𝑥𝐴 𝐵𝑅𝑧 ↔ ∀𝑥𝐴𝑦𝐴 ((𝐵𝑅𝑧𝐶𝑅𝑧) → 𝑥 = 𝑦))
7 relelec 8738 . . . . . . 7 (Rel 𝑅 → (𝑧 ∈ [𝐵]𝑅𝐵𝑅𝑧))
8 relelec 8738 . . . . . . 7 (Rel 𝑅 → (𝑧 ∈ [𝐶]𝑅𝐶𝑅𝑧))
97, 8anbi12d 643 . . . . . 6 (Rel 𝑅 → ((𝑧 ∈ [𝐵]𝑅𝑧 ∈ [𝐶]𝑅) ↔ (𝐵𝑅𝑧𝐶𝑅𝑧)))
109imbi1d 344 . . . . 5 (Rel 𝑅 → (((𝑧 ∈ [𝐵]𝑅𝑧 ∈ [𝐶]𝑅) → 𝑥 = 𝑦) ↔ ((𝐵𝑅𝑧𝐶𝑅𝑧) → 𝑥 = 𝑦)))
11102ralbidv 3229 . . . 4 (Rel 𝑅 → (∀𝑥𝐴𝑦𝐴 ((𝑧 ∈ [𝐵]𝑅𝑧 ∈ [𝐶]𝑅) → 𝑥 = 𝑦) ↔ ∀𝑥𝐴𝑦𝐴 ((𝐵𝑅𝑧𝐶𝑅𝑧) → 𝑥 = 𝑦)))
126, 11bitr4id 293 . . 3 (Rel 𝑅 → (∃*𝑥𝐴 𝐵𝑅𝑧 ↔ ∀𝑥𝐴𝑦𝐴 ((𝑧 ∈ [𝐵]𝑅𝑧 ∈ [𝐶]𝑅) → 𝑥 = 𝑦)))
1312albidv 1950 . 2 (Rel 𝑅 → (∀𝑧∃*𝑥𝐴 𝐵𝑅𝑧 ↔ ∀𝑧𝑥𝐴𝑦𝐴 ((𝑧 ∈ [𝐵]𝑅𝑧 ∈ [𝐶]𝑅) → 𝑥 = 𝑦)))
143, 13bitr4id 293 1 (Rel 𝑅 → (∀𝑥𝐴𝑦𝐴 (𝑥 = 𝑦 ∨ ([𝐵]𝑅 ∩ [𝐶]𝑅) = ∅) ↔ ∀𝑧∃*𝑥𝐴 𝐵𝑅𝑧))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 209  wa 400  wo 860  wal 1568   = wceq 1570  wcel 2143  wral 3079  ∃*wrmo 3368  cin 3904  c0 4286   class class class wbr 5109  Rel wrel 5666  [cec 8688
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-11 2192  ax-ext 2735  ax-sep 5257  ax-pr 5404
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-sb 2097  df-mo 2567  df-clab 2742  df-cleq 2755  df-clel 2838  df-ral 3080  df-rex 3090  df-rmo 3369  df-rab 3417  df-v 3457  df-dif 3908  df-un 3910  df-in 3912  df-ss 3922  df-nul 4287  df-if 4488  df-sn 4590  df-pr 4592  df-op 4596  df-br 5110  df-opab 5174  df-xp 5667  df-rel 5668  df-cnv 5669  df-dm 5671  df-rn 5672  df-res 5673  df-ima 5674  df-ec 8692
This theorem is referenced by:  inecmo2  39025  ineccnvmo  39026  disjres  39513
  Copyright terms: Public domain W3C validator