MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  kmlem4 Structured version   Visualization version   GIF version

Theorem kmlem4 9579
Description: Lemma for 5-quantifier AC of Kurt Maes, Th. 4, part of 3 => 4. (Contributed by NM, 26-Mar-2004.)
Assertion
Ref Expression
kmlem4 ((𝑤𝑥𝑧𝑤) → ((𝑧 (𝑥 ∖ {𝑧})) ∩ 𝑤) = ∅)
Distinct variable group:   𝑥,𝑤,𝑧

Proof of Theorem kmlem4
Dummy variables 𝑣 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 elequ1 2121 . . . . . . 7 (𝑣 = 𝑤 → (𝑣𝑥𝑤𝑥))
2 neeq2 3079 . . . . . . 7 (𝑣 = 𝑤 → (𝑧𝑣𝑧𝑤))
31, 2anbi12d 632 . . . . . 6 (𝑣 = 𝑤 → ((𝑣𝑥𝑧𝑣) ↔ (𝑤𝑥𝑧𝑤)))
4 elequ2 2129 . . . . . . 7 (𝑣 = 𝑤 → (𝑦𝑣𝑦𝑤))
54notbid 320 . . . . . 6 (𝑣 = 𝑤 → (¬ 𝑦𝑣 ↔ ¬ 𝑦𝑤))
63, 5imbi12d 347 . . . . 5 (𝑣 = 𝑤 → (((𝑣𝑥𝑧𝑣) → ¬ 𝑦𝑣) ↔ ((𝑤𝑥𝑧𝑤) → ¬ 𝑦𝑤)))
76spvv 2003 . . . 4 (∀𝑣((𝑣𝑥𝑧𝑣) → ¬ 𝑦𝑣) → ((𝑤𝑥𝑧𝑤) → ¬ 𝑦𝑤))
8 eldif 3946 . . . . 5 (𝑦 ∈ (𝑧 (𝑥 ∖ {𝑧})) ↔ (𝑦𝑧 ∧ ¬ 𝑦 (𝑥 ∖ {𝑧})))
9 simpr 487 . . . . . 6 ((𝑦𝑧 ∧ ¬ 𝑦 (𝑥 ∖ {𝑧})) → ¬ 𝑦 (𝑥 ∖ {𝑧}))
10 eluni 4841 . . . . . . . 8 (𝑦 (𝑥 ∖ {𝑧}) ↔ ∃𝑣(𝑦𝑣𝑣 ∈ (𝑥 ∖ {𝑧})))
1110notbii 322 . . . . . . 7 𝑦 (𝑥 ∖ {𝑧}) ↔ ¬ ∃𝑣(𝑦𝑣𝑣 ∈ (𝑥 ∖ {𝑧})))
12 alnex 1782 . . . . . . 7 (∀𝑣 ¬ (𝑦𝑣𝑣 ∈ (𝑥 ∖ {𝑧})) ↔ ¬ ∃𝑣(𝑦𝑣𝑣 ∈ (𝑥 ∖ {𝑧})))
13 con2b 362 . . . . . . . . 9 ((𝑦𝑣 → ¬ 𝑣 ∈ (𝑥 ∖ {𝑧})) ↔ (𝑣 ∈ (𝑥 ∖ {𝑧}) → ¬ 𝑦𝑣))
14 imnan 402 . . . . . . . . 9 ((𝑦𝑣 → ¬ 𝑣 ∈ (𝑥 ∖ {𝑧})) ↔ ¬ (𝑦𝑣𝑣 ∈ (𝑥 ∖ {𝑧})))
15 eldifsn 4719 . . . . . . . . . . 11 (𝑣 ∈ (𝑥 ∖ {𝑧}) ↔ (𝑣𝑥𝑣𝑧))
16 necom 3069 . . . . . . . . . . . 12 (𝑣𝑧𝑧𝑣)
1716anbi2i 624 . . . . . . . . . . 11 ((𝑣𝑥𝑣𝑧) ↔ (𝑣𝑥𝑧𝑣))
1815, 17bitri 277 . . . . . . . . . 10 (𝑣 ∈ (𝑥 ∖ {𝑧}) ↔ (𝑣𝑥𝑧𝑣))
1918imbi1i 352 . . . . . . . . 9 ((𝑣 ∈ (𝑥 ∖ {𝑧}) → ¬ 𝑦𝑣) ↔ ((𝑣𝑥𝑧𝑣) → ¬ 𝑦𝑣))
2013, 14, 193bitr3i 303 . . . . . . . 8 (¬ (𝑦𝑣𝑣 ∈ (𝑥 ∖ {𝑧})) ↔ ((𝑣𝑥𝑧𝑣) → ¬ 𝑦𝑣))
2120albii 1820 . . . . . . 7 (∀𝑣 ¬ (𝑦𝑣𝑣 ∈ (𝑥 ∖ {𝑧})) ↔ ∀𝑣((𝑣𝑥𝑧𝑣) → ¬ 𝑦𝑣))
2211, 12, 213bitr2i 301 . . . . . 6 𝑦 (𝑥 ∖ {𝑧}) ↔ ∀𝑣((𝑣𝑥𝑧𝑣) → ¬ 𝑦𝑣))
239, 22sylib 220 . . . . 5 ((𝑦𝑧 ∧ ¬ 𝑦 (𝑥 ∖ {𝑧})) → ∀𝑣((𝑣𝑥𝑧𝑣) → ¬ 𝑦𝑣))
248, 23sylbi 219 . . . 4 (𝑦 ∈ (𝑧 (𝑥 ∖ {𝑧})) → ∀𝑣((𝑣𝑥𝑧𝑣) → ¬ 𝑦𝑣))
257, 24syl11 33 . . 3 ((𝑤𝑥𝑧𝑤) → (𝑦 ∈ (𝑧 (𝑥 ∖ {𝑧})) → ¬ 𝑦𝑤))
2625ralrimiv 3181 . 2 ((𝑤𝑥𝑧𝑤) → ∀𝑦 ∈ (𝑧 (𝑥 ∖ {𝑧})) ¬ 𝑦𝑤)
27 disj 4399 . 2 (((𝑧 (𝑥 ∖ {𝑧})) ∩ 𝑤) = ∅ ↔ ∀𝑦 ∈ (𝑧 (𝑥 ∖ {𝑧})) ¬ 𝑦𝑤)
2826, 27sylibr 236 1 ((𝑤𝑥𝑧𝑤) → ((𝑧 (𝑥 ∖ {𝑧})) ∩ 𝑤) = ∅)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wa 398  wal 1535   = wceq 1537  wex 1780  wcel 2114  wne 3016  wral 3138  cdif 3933  cin 3935  c0 4291  {csn 4567   cuni 4838
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2161  ax-12 2177  ax-ext 2793
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-tru 1540  df-ex 1781  df-nf 1785  df-sb 2070  df-clab 2800  df-cleq 2814  df-clel 2893  df-nfc 2963  df-ne 3017  df-ral 3143  df-v 3496  df-dif 3939  df-in 3943  df-nul 4292  df-sn 4568  df-uni 4839
This theorem is referenced by:  kmlem5  9580  kmlem11  9586
  Copyright terms: Public domain W3C validator