Theorem kmlem4 10156

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.

Step	Hyp	Ref	Expression
1		elequ1 2153	. . . . . . 7 ⊢ (𝑣 = 𝑤 → (𝑣 ∈ 𝑥 ↔ 𝑤 ∈ 𝑥))
2		neeq2 3024	. . . . . . 7 ⊢ (𝑣 = 𝑤 → (𝑧 ≠ 𝑣 ↔ 𝑧 ≠ 𝑤))
3	1, 2	anbi12d 644	. . . . . 6 ⊢ (𝑣 = 𝑤 → ((𝑣 ∈ 𝑥 ∧ 𝑧 ≠ 𝑣) ↔ (𝑤 ∈ 𝑥 ∧ 𝑧 ≠ 𝑤)))
4		elequ2 2161	. . . . . . 7 ⊢ (𝑣 = 𝑤 → (𝑦 ∈ 𝑣 ↔ 𝑦 ∈ 𝑤))
5	4	notbid 321	. . . . . 6 ⊢ (𝑣 = 𝑤 → (¬ 𝑦 ∈ 𝑣 ↔ ¬ 𝑦 ∈ 𝑤))
6	3, 5	imbi12d 347	. . . . 5 ⊢ (𝑣 = 𝑤 → (((𝑣 ∈ 𝑥 ∧ 𝑧 ≠ 𝑣) → ¬ 𝑦 ∈ 𝑣) ↔ ((𝑤 ∈ 𝑥 ∧ 𝑧 ≠ 𝑤) → ¬ 𝑦 ∈ 𝑤)))
7	6	spvv 2021	. . . 4 ⊢ (∀𝑣((𝑣 ∈ 𝑥 ∧ 𝑧 ≠ 𝑣) → ¬ 𝑦 ∈ 𝑣) → ((𝑤 ∈ 𝑥 ∧ 𝑧 ≠ 𝑤) → ¬ 𝑦 ∈ 𝑤))
8		eldif 3918	. . . . 5 ⊢ (𝑦 ∈ (𝑧 ∖ ∪ (𝑥 ∖ {𝑧})) ↔ (𝑦 ∈ 𝑧 ∧ ¬ 𝑦 ∈ ∪ (𝑥 ∖ {𝑧})))
9		eluni 4880	. . . . . . . 8 ⊢ (𝑦 ∈ ∪ (𝑥 ∖ {𝑧}) ↔ ∃𝑣(𝑦 ∈ 𝑣 ∧ 𝑣 ∈ (𝑥 ∖ {𝑧})))
10	9	notbii 323	. . . . . . 7 ⊢ (¬ 𝑦 ∈ ∪ (𝑥 ∖ {𝑧}) ↔ ¬ ∃𝑣(𝑦 ∈ 𝑣 ∧ 𝑣 ∈ (𝑥 ∖ {𝑧})))
11		alnex 1814	. . . . . . 7 ⊢ (∀𝑣 ¬ (𝑦 ∈ 𝑣 ∧ 𝑣 ∈ (𝑥 ∖ {𝑧})) ↔ ¬ ∃𝑣(𝑦 ∈ 𝑣 ∧ 𝑣 ∈ (𝑥 ∖ {𝑧})))
12		con2b 362	. . . . . . . . 9 ⊢ ((𝑦 ∈ 𝑣 → ¬ 𝑣 ∈ (𝑥 ∖ {𝑧})) ↔ (𝑣 ∈ (𝑥 ∖ {𝑧}) → ¬ 𝑦 ∈ 𝑣))
13		imnan 405	. . . . . . . . 9 ⊢ ((𝑦 ∈ 𝑣 → ¬ 𝑣 ∈ (𝑥 ∖ {𝑧})) ↔ ¬ (𝑦 ∈ 𝑣 ∧ 𝑣 ∈ (𝑥 ∖ {𝑧})))
14		eldifsn 4758	. . . . . . . . . . 11 ⊢ (𝑣 ∈ (𝑥 ∖ {𝑧}) ↔ (𝑣 ∈ 𝑥 ∧ 𝑣 ≠ 𝑧))
15		necom 3014	. . . . . . . . . . . 12 ⊢ (𝑣 ≠ 𝑧 ↔ 𝑧 ≠ 𝑣)
16	15	anbi2i 635	. . . . . . . . . . 11 ⊢ ((𝑣 ∈ 𝑥 ∧ 𝑣 ≠ 𝑧) ↔ (𝑣 ∈ 𝑥 ∧ 𝑧 ≠ 𝑣))
17	14, 16	bitri 278	. . . . . . . . . 10 ⊢ (𝑣 ∈ (𝑥 ∖ {𝑧}) ↔ (𝑣 ∈ 𝑥 ∧ 𝑧 ≠ 𝑣))
18	17	imbi1i 352	. . . . . . . . 9 ⊢ ((𝑣 ∈ (𝑥 ∖ {𝑧}) → ¬ 𝑦 ∈ 𝑣) ↔ ((𝑣 ∈ 𝑥 ∧ 𝑧 ≠ 𝑣) → ¬ 𝑦 ∈ 𝑣))
19	12, 13, 18	3bitr3i 304	. . . . . . . 8 ⊢ (¬ (𝑦 ∈ 𝑣 ∧ 𝑣 ∈ (𝑥 ∖ {𝑧})) ↔ ((𝑣 ∈ 𝑥 ∧ 𝑧 ≠ 𝑣) → ¬ 𝑦 ∈ 𝑣))
20	19	albii 1852	. . . . . . 7 ⊢ (∀𝑣 ¬ (𝑦 ∈ 𝑣 ∧ 𝑣 ∈ (𝑥 ∖ {𝑧})) ↔ ∀𝑣((𝑣 ∈ 𝑥 ∧ 𝑧 ≠ 𝑣) → ¬ 𝑦 ∈ 𝑣))
21	10, 11, 20	3bitr2i 302	. . . . . 6 ⊢ (¬ 𝑦 ∈ ∪ (𝑥 ∖ {𝑧}) ↔ ∀𝑣((𝑣 ∈ 𝑥 ∧ 𝑧 ≠ 𝑣) → ¬ 𝑦 ∈ 𝑣))
22	21	bilani 510	. . . . 5 ⊢ ((𝑦 ∈ 𝑧 ∧ ¬ 𝑦 ∈ ∪ (𝑥 ∖ {𝑧})) → ∀𝑣((𝑣 ∈ 𝑥 ∧ 𝑧 ≠ 𝑣) → ¬ 𝑦 ∈ 𝑣))
23	8, 22	sylbi 220	. . . 4 ⊢ (𝑦 ∈ (𝑧 ∖ ∪ (𝑥 ∖ {𝑧})) → ∀𝑣((𝑣 ∈ 𝑥 ∧ 𝑧 ≠ 𝑣) → ¬ 𝑦 ∈ 𝑣))
24	7, 23	syl11 34	. . 3 ⊢ ((𝑤 ∈ 𝑥 ∧ 𝑧 ≠ 𝑤) → (𝑦 ∈ (𝑧 ∖ ∪ (𝑥 ∖ {𝑧})) → ¬ 𝑦 ∈ 𝑤))
25	24	ralrimiv 3159	. 2 ⊢ ((𝑤 ∈ 𝑥 ∧ 𝑧 ≠ 𝑤) → ∀𝑦 ∈ (𝑧 ∖ ∪ (𝑥 ∖ {𝑧})) ¬ 𝑦 ∈ 𝑤)
26		disj 4413	. 2 ⊢ (((𝑧 ∖ ∪ (𝑥 ∖ {𝑧})) ∩ 𝑤) = ∅ ↔ ∀𝑦 ∈ (𝑧 ∖ ∪ (𝑥 ∖ {𝑧})) ¬ 𝑦 ∈ 𝑤)
27	25, 26	sylibr 237	1 ⊢ ((𝑤 ∈ 𝑥 ∧ 𝑧 ≠ 𝑤) → ((𝑧 ∖ ∪ (𝑥 ∖ {𝑧})) ∩ 𝑤) = ∅)

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ∧ wa 401  ∀wal 1568   = wceq 1570  ∃wex 1812   ∈ wcel 2146   ≠ wne 2961  ∀wral 3082   ∖ cdif 3905   ∩ cin 3907  ∅c0 4289  {csn 4594  ∪ cuni 4877

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-ext 2738

This proof depends on definitions:  df-bi 210  df-an 402  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2100  df-clab 2745  df-cleq 2758  df-clel 2841  df-ne 2962  df-ral 3083  df-v 3460  df-dif 3911  df-in 3915  df-nul 4290  df-sn 4595  df-uni 4878

This theorem is used by:  kmlem5  10157  kmlem11  10163