Theorem untuni 36296

Description: The union of a class is untangled iff all its members are untangled. (Contributed by Scott Fenton, 28-Feb-2011.)

Assertion

Ref	Expression
untuni	⊢ (∀𝑥 ∈ ∪ 𝐴 ¬ 𝑥 ∈ 𝑥 ↔ ∀𝑦 ∈ 𝐴 ∀𝑥 ∈ 𝑦 ¬ 𝑥 ∈ 𝑥)

Distinct variable group:   𝑥,𝑦,𝐴

Proof of Theorem untuni

Step	Hyp	Ref	Expression
1		r19.23v 3191	. . . 4 ⊢ (∀𝑦 ∈ 𝐴 (𝑥 ∈ 𝑦 → ¬ 𝑥 ∈ 𝑥) ↔ (∃𝑦 ∈ 𝐴 𝑥 ∈ 𝑦 → ¬ 𝑥 ∈ 𝑥))
2	1	albii 1852	. . 3 ⊢ (∀𝑥∀𝑦 ∈ 𝐴 (𝑥 ∈ 𝑦 → ¬ 𝑥 ∈ 𝑥) ↔ ∀𝑥(∃𝑦 ∈ 𝐴 𝑥 ∈ 𝑦 → ¬ 𝑥 ∈ 𝑥))
3		ralcom4 3290	. . 3 ⊢ (∀𝑦 ∈ 𝐴 ∀𝑥(𝑥 ∈ 𝑦 → ¬ 𝑥 ∈ 𝑥) ↔ ∀𝑥∀𝑦 ∈ 𝐴 (𝑥 ∈ 𝑦 → ¬ 𝑥 ∈ 𝑥))
4		eluni2 4874	. . . . 5 ⊢ (𝑥 ∈ ∪ 𝐴 ↔ ∃𝑦 ∈ 𝐴 𝑥 ∈ 𝑦)
5	4	imbi1i 352	. . . 4 ⊢ ((𝑥 ∈ ∪ 𝐴 → ¬ 𝑥 ∈ 𝑥) ↔ (∃𝑦 ∈ 𝐴 𝑥 ∈ 𝑦 → ¬ 𝑥 ∈ 𝑥))
6	5	albii 1852	. . 3 ⊢ (∀𝑥(𝑥 ∈ ∪ 𝐴 → ¬ 𝑥 ∈ 𝑥) ↔ ∀𝑥(∃𝑦 ∈ 𝐴 𝑥 ∈ 𝑦 → ¬ 𝑥 ∈ 𝑥))
7	2, 3, 6	3bitr4ri 307	. 2 ⊢ (∀𝑥(𝑥 ∈ ∪ 𝐴 → ¬ 𝑥 ∈ 𝑥) ↔ ∀𝑦 ∈ 𝐴 ∀𝑥(𝑥 ∈ 𝑦 → ¬ 𝑥 ∈ 𝑥))
8		df-ral 3079	. 2 ⊢ (∀𝑥 ∈ ∪ 𝐴 ¬ 𝑥 ∈ 𝑥 ↔ ∀𝑥(𝑥 ∈ ∪ 𝐴 → ¬ 𝑥 ∈ 𝑥))
9		df-ral 3079	. . 3 ⊢ (∀𝑥 ∈ 𝑦 ¬ 𝑥 ∈ 𝑥 ↔ ∀𝑥(𝑥 ∈ 𝑦 → ¬ 𝑥 ∈ 𝑥))
10	9	ralbii 3110	. 2 ⊢ (∀𝑦 ∈ 𝐴 ∀𝑥 ∈ 𝑦 ¬ 𝑥 ∈ 𝑥 ↔ ∀𝑦 ∈ 𝐴 ∀𝑥(𝑥 ∈ 𝑦 → ¬ 𝑥 ∈ 𝑥))
11	7, 8, 10	3bitr4i 306	1 ⊢ (∀𝑥 ∈ ∪ 𝐴 ¬ 𝑥 ∈ 𝑥 ↔ ∀𝑦 ∈ 𝐴 ∀𝑥 ∈ 𝑦 ¬ 𝑥 ∈ 𝑥)

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209  ∀wal 1568   ∈ wcel 2145  ∀wral 3078  ∃wrex 3088  ∪ cuni 4870

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 2734

This proof depends on definitions:  df-bi 210  df-an 402  df-tru 1573  df-ex 1813  df-sb 2100  df-clab 2741  df-cleq 2754  df-clel 2837  df-ral 3079  df-rex 3089  df-v 3455  df-uni 4871

This theorem is used by:  untangtr  36301  dfon2lem3  36370  dfon2lem7  36374