Users' Mathboxes Mathbox for Glauco Siliprandi < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  eliuniincex Structured version   Visualization version   GIF version

Theorem eliuniincex 43407
Description: Counterexample to show that the additional conditions in eliuniin 43397 and eliuniin2 43418 are actually needed. Notice that the definition of 𝐴 is not even needed (it can be any class). (Contributed by Glauco Siliprandi, 26-Jun-2021.)
Hypotheses
Ref Expression
eliuniincex.1 𝐵 = {∅}
eliuniincex.2 𝐶 = ∅
eliuniincex.3 𝐷 = ∅
eliuniincex.4 𝑍 = V
Assertion
Ref Expression
eliuniincex ¬ (𝑍𝐴 ↔ ∃𝑥𝐵𝑦𝐶 𝑍𝐷)
Distinct variable groups:   𝑥,𝐵   𝑦,𝐶   𝑥,𝑍
Allowed substitution hints:   𝐴(𝑥,𝑦)   𝐵(𝑦)   𝐶(𝑥)   𝐷(𝑥,𝑦)   𝑍(𝑦)

Proof of Theorem eliuniincex
StepHypRef Expression
1 eliuniincex.4 . . 3 𝑍 = V
2 nvel 5274 . . 3 ¬ V ∈ 𝐴
31, 2eqneltri 2853 . 2 ¬ 𝑍𝐴
4 0ex 5265 . . . . 5 ∅ ∈ V
54snid 4623 . . . 4 ∅ ∈ {∅}
6 eliuniincex.1 . . . 4 𝐵 = {∅}
75, 6eleqtrri 2833 . . 3 ∅ ∈ 𝐵
8 ral0 4471 . . 3 𝑦 ∈ ∅ 𝑍𝐷
9 nfcv 2904 . . . . 5 𝑥
10 nfcv 2904 . . . . . 6 𝑥𝑍
11 eliuniincex.3 . . . . . . 7 𝐷 = ∅
1211, 9nfcxfr 2902 . . . . . 6 𝑥𝐷
1310, 12nfel 2918 . . . . 5 𝑥 𝑍𝐷
149, 13nfral 3346 . . . 4 𝑥𝑦 ∈ ∅ 𝑍𝐷
15 eliuniincex.2 . . . . . 6 𝐶 = ∅
1615raleqi 3310 . . . . 5 (∀𝑦𝐶 𝑍𝐷 ↔ ∀𝑦 ∈ ∅ 𝑍𝐷)
1716a1i 11 . . . 4 (𝑥 = ∅ → (∀𝑦𝐶 𝑍𝐷 ↔ ∀𝑦 ∈ ∅ 𝑍𝐷))
1814, 17rspce 3569 . . 3 ((∅ ∈ 𝐵 ∧ ∀𝑦 ∈ ∅ 𝑍𝐷) → ∃𝑥𝐵𝑦𝐶 𝑍𝐷)
197, 8, 18mp2an 691 . 2 𝑥𝐵𝑦𝐶 𝑍𝐷
20 pm3.22 461 . . . 4 ((¬ 𝑍𝐴 ∧ ∃𝑥𝐵𝑦𝐶 𝑍𝐷) → (∃𝑥𝐵𝑦𝐶 𝑍𝐷 ∧ ¬ 𝑍𝐴))
2120olcd 873 . . 3 ((¬ 𝑍𝐴 ∧ ∃𝑥𝐵𝑦𝐶 𝑍𝐷) → ((𝑍𝐴 ∧ ¬ ∃𝑥𝐵𝑦𝐶 𝑍𝐷) ∨ (∃𝑥𝐵𝑦𝐶 𝑍𝐷 ∧ ¬ 𝑍𝐴)))
22 xor 1014 . . 3 (¬ (𝑍𝐴 ↔ ∃𝑥𝐵𝑦𝐶 𝑍𝐷) ↔ ((𝑍𝐴 ∧ ¬ ∃𝑥𝐵𝑦𝐶 𝑍𝐷) ∨ (∃𝑥𝐵𝑦𝐶 𝑍𝐷 ∧ ¬ 𝑍𝐴)))
2321, 22sylibr 233 . 2 ((¬ 𝑍𝐴 ∧ ∃𝑥𝐵𝑦𝐶 𝑍𝐷) → ¬ (𝑍𝐴 ↔ ∃𝑥𝐵𝑦𝐶 𝑍𝐷))
243, 19, 23mp2an 691 1 ¬ (𝑍𝐴 ↔ ∃𝑥𝐵𝑦𝐶 𝑍𝐷)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wb 205  wa 397  wo 846   = wceq 1542  wcel 2107  wral 3061  wrex 3070  Vcvv 3444  c0 4283  {csn 4587
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2109  ax-9 2117  ax-10 2138  ax-11 2155  ax-12 2172  ax-13 2371  ax-ext 2704  ax-sep 5257  ax-nul 5264
This theorem depends on definitions:  df-bi 206  df-an 398  df-or 847  df-tru 1545  df-fal 1555  df-ex 1783  df-nf 1787  df-sb 2069  df-clab 2711  df-cleq 2725  df-clel 2811  df-nfc 2886  df-ral 3062  df-rex 3071  df-v 3446  df-dif 3914  df-nul 4284  df-sn 4588
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator