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 45885
Description: Counterexample to show that the additional conditions in eliuniin 45875 and eliuniin2 45896 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 5284 . . 3 ¬ V ∈ 𝐴
31, 2eqneltri 2884 . 2 ¬ 𝑍𝐴
4 0ex 5272 . . . . 5 ∅ ∈ V
54snid 4630 . . . 4 ∅ ∈ {∅}
6 eliuniincex.1 . . . 4 𝐵 = {∅}
75, 6eleqtrri 2864 . . 3 ∅ ∈ 𝐵
8 ral0 4461 . . 3 𝑦 ∈ ∅ 𝑍𝐷
9 nfcv 2927 . . . . 5 𝑥
10 nfcv 2927 . . . . . 6 𝑥𝑍
11 eliuniincex.3 . . . . . . 7 𝐷 = ∅
1211, 9nfcxfr 2925 . . . . . 6 𝑥𝐷
1310, 12nfel 2941 . . . . 5 𝑥 𝑍𝐷
149, 13nfral 3365 . . . 4 𝑥𝑦 ∈ ∅ 𝑍𝐷
15 eliuniincex.2 . . . . . 6 𝐶 = ∅
1615raleqi 3323 . . . . 5 (∀𝑦𝐶 𝑍𝐷 ↔ ∀𝑦 ∈ ∅ 𝑍𝐷)
1716a1i 11 . . . 4 (𝑥 = ∅ → (∀𝑦𝐶 𝑍𝐷 ↔ ∀𝑦 ∈ ∅ 𝑍𝐷))
1814, 17rspce 3572 . . 3 ((∅ ∈ 𝐵 ∧ ∀𝑦 ∈ ∅ 𝑍𝐷) → ∃𝑥𝐵𝑦𝐶 𝑍𝐷)
197, 8, 18mp2an 705 . 2 𝑥𝐵𝑦𝐶 𝑍𝐷
20 pm3.22 465 . . . 4 ((¬ 𝑍𝐴 ∧ ∃𝑥𝐵𝑦𝐶 𝑍𝐷) → (∃𝑥𝐵𝑦𝐶 𝑍𝐷 ∧ ¬ 𝑍𝐴))
2120olcd 888 . . 3 ((¬ 𝑍𝐴 ∧ ∃𝑥𝐵𝑦𝐶 𝑍𝐷) → ((𝑍𝐴 ∧ ¬ ∃𝑥𝐵𝑦𝐶 𝑍𝐷) ∨ (∃𝑥𝐵𝑦𝐶 𝑍𝐷 ∧ ¬ 𝑍𝐴)))
22 xor 1032 . . 3 (¬ (𝑍𝐴 ↔ ∃𝑥𝐵𝑦𝐶 𝑍𝐷) ↔ ((𝑍𝐴 ∧ ¬ ∃𝑥𝐵𝑦𝐶 𝑍𝐷) ∨ (∃𝑥𝐵𝑦𝐶 𝑍𝐷 ∧ ¬ 𝑍𝐴)))
2321, 22sylibr 237 . 2 ((¬ 𝑍𝐴 ∧ ∃𝑥𝐵𝑦𝐶 𝑍𝐷) → ¬ (𝑍𝐴 ↔ ∃𝑥𝐵𝑦𝐶 𝑍𝐷))
243, 19, 23mp2an 705 1 ¬ (𝑍𝐴 ↔ ∃𝑥𝐵𝑦𝐶 𝑍𝐷)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3  wb 209  wa 401  wo 861   = wceq 1570  wcel 2146  wral 3081  wrex 3091  Vcvv 3457  c0 4286  {csn 4591
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 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-13 2406  ax-ext 2737  ax-sep 5259  ax-nul 5271
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ral 3082  df-rex 3092  df-v 3459  df-dif 3909  df-nul 4287  df-sn 4592
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator