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

Theorem ineleq 39552
Description: Equivalence of restricted universal quantifications. (Contributed by Peter Mazsa, 29-May-2018.)
Assertion
Ref Expression
ineleq (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 (𝑥 = 𝑦 ∨ (𝐶 ∩ 𝐷) = ∅) ↔ ∀𝑥 ∈ 𝐴 ∀𝑧∀𝑦 ∈ 𝐵 ((𝑧 ∈ 𝐶 ∧ 𝑧 ∈ 𝐷) → 𝑥 = 𝑦))
Distinct variable groups:   𝑧,𝐵   𝑧,𝐶   𝑧,𝐷   𝑥,𝑧   𝑦,𝑧
Allowed substitution hints:   𝐴(𝑥, 𝑦, 𝑧)   𝐵(𝑥, 𝑦)   𝐶(𝑥, 𝑦)   𝐷(𝑥, 𝑦)

Proof of Theorem ineleq
StepHypRef Expression
1 orcom 884 . . . . 5 ((𝑥 = 𝑦 ∨ (𝐶 ∩ 𝐷) = ∅) ↔ ((𝐶 ∩ 𝐷) = ∅ ∨ 𝑥 = 𝑦))
2 df-or 862 . . . . 5 (((𝐶 ∩ 𝐷) = ∅ ∨ 𝑥 = 𝑦) ↔ (¬ (𝐶 ∩ 𝐷) = ∅ → 𝑥 = 𝑦))
3 neq0 4302 . . . . . . . 8 (¬ (𝐶 ∩ 𝐷) = ∅ ↔ ∃𝑧 𝑧 ∈ (𝐶 ∩ 𝐷))
4 elin 4096 . . . . . . . . 9 (𝑧 ∈ (𝐶 ∩ 𝐷) ↔ (𝑧 ∈ 𝐶 ∧ 𝑧 ∈ 𝐷))
54exbii 1881 . . . . . . . 8 (∃𝑧 𝑧 ∈ (𝐶 ∩ 𝐷) ↔ ∃𝑧(𝑧 ∈ 𝐶 ∧ 𝑧 ∈ 𝐷))
63, 5bitri 278 . . . . . . 7 (¬ (𝐶 ∩ 𝐷) = ∅ ↔ ∃𝑧(𝑧 ∈ 𝐶 ∧ 𝑧 ∈ 𝐷))
76imbi1i 352 . . . . . 6 ((¬ (𝐶 ∩ 𝐷) = ∅ → 𝑥 = 𝑦) ↔ (∃𝑧(𝑧 ∈ 𝐶 ∧ 𝑧 ∈ 𝐷) → 𝑥 = 𝑦))
8 19.23v 1977 . . . . . 6 (∀𝑧((𝑧 ∈ 𝐶 ∧ 𝑧 ∈ 𝐷) → 𝑥 = 𝑦) ↔ (∃𝑧(𝑧 ∈ 𝐶 ∧ 𝑧 ∈ 𝐷) → 𝑥 = 𝑦))
97, 8bitr4i 281 . . . . 5 ((¬ (𝐶 ∩ 𝐷) = ∅ → 𝑥 = 𝑦) ↔ ∀𝑧((𝑧 ∈ 𝐶 ∧ 𝑧 ∈ 𝐷) → 𝑥 = 𝑦))
101, 2, 93bitri 300 . . . 4 ((𝑥 = 𝑦 ∨ (𝐶 ∩ 𝐷) = ∅) ↔ ∀𝑧((𝑧 ∈ 𝐶 ∧ 𝑧 ∈ 𝐷) → 𝑥 = 𝑦))
1110ralbii 3112 . . 3 (∀𝑦 ∈ 𝐵 (𝑥 = 𝑦 ∨ (𝐶 ∩ 𝐷) = ∅) ↔ ∀𝑦 ∈ 𝐵 ∀𝑧((𝑧 ∈ 𝐶 ∧ 𝑧 ∈ 𝐷) → 𝑥 = 𝑦))
12 ralcom4 3292 . . 3 (∀𝑦 ∈ 𝐵 ∀𝑧((𝑧 ∈ 𝐶 ∧ 𝑧 ∈ 𝐷) → 𝑥 = 𝑦) ↔ ∀𝑧∀𝑦 ∈ 𝐵 ((𝑧 ∈ 𝐶 ∧ 𝑧 ∈ 𝐷) → 𝑥 = 𝑦))
1311, 12bitri 278 . 2 (∀𝑦 ∈ 𝐵 (𝑥 = 𝑦 ∨ (𝐶 ∩ 𝐷) = ∅) ↔ ∀𝑧∀𝑦 ∈ 𝐵 ((𝑧 ∈ 𝐶 ∧ 𝑧 ∈ 𝐷) → 𝑥 = 𝑦))
1413ralbii 3112 1 (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 (𝑥 = 𝑦 ∨ (𝐶 ∩ 𝐷) = ∅) ↔ ∀𝑥 ∈ 𝐴 ∀𝑧∀𝑦 ∈ 𝐵 ((𝑧 ∈ 𝐶 ∧ 𝑧 ∈ 𝐷) → 𝑥 = 𝑦))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 401   ∨ wo 861  ∀wal 1568   = wceq 1570  ∃wex 1812   ∈ wcel 2147  ∀wral 3080   ∩ cin 4092  ∅c0 4281
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-11 2197  ax-ext 2735
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-ral 3081  df-v 3456  df-dif 4050  df-in 4094  df-nul 4282
This theorem is used by:  inecmo  39553
  Copyright terms: Public domain W3C validator