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 39286
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 4299 . . . . . . . 8 (¬ (𝐶 ∩ 𝐷) = ∅ ↔ ∃𝑧 𝑧 ∈ (𝐶 ∩ 𝐷))
4 elin 3915 . . . . . . . . 9 (𝑧 ∈ (𝐶 ∩ 𝐷) ↔ (𝑧 ∈ 𝐶 ∧ 𝑧 ∈ 𝐷))
54exbii 1881 . . . . . . . 8 (∃𝑧 𝑧 ∈ (𝐶 ∩ 𝐷) ↔ ∃𝑧(𝑧 ∈ 𝐶 ∧ 𝑧 ∈ 𝐷))
63, 5bitri 278 . . . . . . 7 (¬ (𝐶 ∩ 𝐷) = ∅ ↔ ∃𝑧(𝑧 ∈ 𝐶 ∧ 𝑧 ∈ 𝐷))
76imbi1i 352 . . . . . 6 ((¬ (𝐶 ∩ 𝐷) = ∅ → 𝑥 = 𝑦) ↔ (∃𝑧(𝑧 ∈ 𝐶 ∧ 𝑧 ∈ 𝐷) → 𝑥 = 𝑦))
8 19.23v 1975 . . . . . 6 (∀𝑧((𝑧 ∈ 𝐶 ∧ 𝑧 ∈ 𝐷) → 𝑥 = 𝑦) ↔ (∃𝑧(𝑧 ∈ 𝐶 ∧ 𝑧 ∈ 𝐷) → 𝑥 = 𝑦))
97, 8bitr4i 281 . . . . 5 ((¬ (𝐶 ∩ 𝐷) = ∅ → 𝑥 = 𝑦) ↔ ∀𝑧((𝑧 ∈ 𝐶 ∧ 𝑧 ∈ 𝐷) → 𝑥 = 𝑦))
101, 2, 93bitri 300 . . . 4 ((𝑥 = 𝑦 ∨ (𝐶 ∩ 𝐷) = ∅) ↔ ∀𝑧((𝑧 ∈ 𝐶 ∧ 𝑧 ∈ 𝐷) → 𝑥 = 𝑦))
1110ralbii 3109 . . 3 (∀𝑦 ∈ 𝐵 (𝑥 = 𝑦 ∨ (𝐶 ∩ 𝐷) = ∅) ↔ ∀𝑦 ∈ 𝐵 ∀𝑧((𝑧 ∈ 𝐶 ∧ 𝑧 ∈ 𝐷) → 𝑥 = 𝑦))
12 ralcom4 3289 . . 3 (∀𝑦 ∈ 𝐵 ∀𝑧((𝑧 ∈ 𝐶 ∧ 𝑧 ∈ 𝐷) → 𝑥 = 𝑦) ↔ ∀𝑧∀𝑦 ∈ 𝐵 ((𝑧 ∈ 𝐶 ∧ 𝑧 ∈ 𝐷) → 𝑥 = 𝑦))
1311, 12bitri 278 . 2 (∀𝑦 ∈ 𝐵 (𝑥 = 𝑦 ∨ (𝐶 ∩ 𝐷) = ∅) ↔ ∀𝑧∀𝑦 ∈ 𝐵 ((𝑧 ∈ 𝐶 ∧ 𝑧 ∈ 𝐷) → 𝑥 = 𝑦))
1413ralbii 3109 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 2145  ∀wral 3077   ∩ cin 3898  ∅c0 4279
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 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-11 2194  ax-ext 2733
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 2100  df-clab 2740  df-cleq 2753  df-clel 2836  df-ral 3078  df-v 3453  df-dif 3902  df-in 3906  df-nul 4280
This theorem is used by:  inecmo  39287
  Copyright terms: Public domain W3C validator