Theorem eliuniin2 42669

Description: Indexed union of indexed intersections. See eliincex 42660 for a counterexample showing that the precondition 𝐶 ≠ ∅ cannot be simply dropped. (Contributed by Glauco Siliprandi, 26-Jun-2021.)

Hypotheses

Ref	Expression
eliuniin2.1	⊢ Ⅎ𝑥𝐶
eliuniin2.2	⊢ 𝐴 = ∪ 𝑥 ∈ 𝐵 ∩ 𝑦 ∈ 𝐶 𝐷

Assertion

Ref	Expression
eliuniin2	⊢ (𝐶 ≠ ∅ → (𝑍 ∈ 𝐴 ↔ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐶 𝑍 ∈ 𝐷))

Distinct variable groups:   𝑥,𝐴   𝑦,𝐶   𝑥,𝑍   𝑦,𝑍

Allowed substitution hints:   𝐴(𝑦)   𝐵(𝑥,𝑦)   𝐶(𝑥)   𝐷(𝑥,𝑦)

Proof of Theorem eliuniin2

Step	Hyp	Ref	Expression
1		eliuniin2.2	. . . . 5 ⊢ 𝐴 = ∪ 𝑥 ∈ 𝐵 ∩ 𝑦 ∈ 𝐶 𝐷
2	1	eleq2i 2830	. . . 4 ⊢ (𝑍 ∈ 𝐴 ↔ 𝑍 ∈ ∪ 𝑥 ∈ 𝐵 ∩ 𝑦 ∈ 𝐶 𝐷)
3		eliun 4928	. . . 4 ⊢ (𝑍 ∈ ∪ 𝑥 ∈ 𝐵 ∩ 𝑦 ∈ 𝐶 𝐷 ↔ ∃𝑥 ∈ 𝐵 𝑍 ∈ ∩ 𝑦 ∈ 𝐶 𝐷)
4	2, 3	sylbb 218	. . 3 ⊢ (𝑍 ∈ 𝐴 → ∃𝑥 ∈ 𝐵 𝑍 ∈ ∩ 𝑦 ∈ 𝐶 𝐷)
5		eliin 4929	. . . . . 6 ⊢ (𝑍 ∈ ∩ 𝑦 ∈ 𝐶 𝐷 → (𝑍 ∈ ∩ 𝑦 ∈ 𝐶 𝐷 ↔ ∀𝑦 ∈ 𝐶 𝑍 ∈ 𝐷))
6	5	ibi 266	. . . . 5 ⊢ (𝑍 ∈ ∩ 𝑦 ∈ 𝐶 𝐷 → ∀𝑦 ∈ 𝐶 𝑍 ∈ 𝐷)
7	6	a1i 11	. . . 4 ⊢ (𝑍 ∈ 𝐴 → (𝑍 ∈ ∩ 𝑦 ∈ 𝐶 𝐷 → ∀𝑦 ∈ 𝐶 𝑍 ∈ 𝐷))
8	7	reximdv 3202	. . 3 ⊢ (𝑍 ∈ 𝐴 → (∃𝑥 ∈ 𝐵 𝑍 ∈ ∩ 𝑦 ∈ 𝐶 𝐷 → ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐶 𝑍 ∈ 𝐷))
9	4, 8	mpd 15	. 2 ⊢ (𝑍 ∈ 𝐴 → ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐶 𝑍 ∈ 𝐷)
10		eliuniin2.1	. . . 4 ⊢ Ⅎ𝑥𝐶
11		nfcv 2907	. . . 4 ⊢ Ⅎ𝑥∅
12	10, 11	nfne 3045	. . 3 ⊢ Ⅎ𝑥 𝐶 ≠ ∅
13		nfv 1917	. . 3 ⊢ Ⅎ𝑥 𝑍 ∈ 𝐴
14		simp2 1136	. . . . . . 7 ⊢ ((𝐶 ≠ ∅ ∧ 𝑥 ∈ 𝐵 ∧ ∀𝑦 ∈ 𝐶 𝑍 ∈ 𝐷) → 𝑥 ∈ 𝐵)
15		eliin2 42665	. . . . . . . 8 ⊢ (𝐶 ≠ ∅ → (𝑍 ∈ ∩ 𝑦 ∈ 𝐶 𝐷 ↔ ∀𝑦 ∈ 𝐶 𝑍 ∈ 𝐷))
16	15	biimpar 478	. . . . . . 7 ⊢ ((𝐶 ≠ ∅ ∧ ∀𝑦 ∈ 𝐶 𝑍 ∈ 𝐷) → 𝑍 ∈ ∩ 𝑦 ∈ 𝐶 𝐷)
17		rspe 3237	. . . . . . 7 ⊢ ((𝑥 ∈ 𝐵 ∧ 𝑍 ∈ ∩ 𝑦 ∈ 𝐶 𝐷) → ∃𝑥 ∈ 𝐵 𝑍 ∈ ∩ 𝑦 ∈ 𝐶 𝐷)
18	14, 16, 17	3imp3i2an 1344	. . . . . 6 ⊢ ((𝐶 ≠ ∅ ∧ 𝑥 ∈ 𝐵 ∧ ∀𝑦 ∈ 𝐶 𝑍 ∈ 𝐷) → ∃𝑥 ∈ 𝐵 𝑍 ∈ ∩ 𝑦 ∈ 𝐶 𝐷)
19	18, 3	sylibr 233	. . . . 5 ⊢ ((𝐶 ≠ ∅ ∧ 𝑥 ∈ 𝐵 ∧ ∀𝑦 ∈ 𝐶 𝑍 ∈ 𝐷) → 𝑍 ∈ ∪ 𝑥 ∈ 𝐵 ∩ 𝑦 ∈ 𝐶 𝐷)
20	19, 2	sylibr 233	. . . 4 ⊢ ((𝐶 ≠ ∅ ∧ 𝑥 ∈ 𝐵 ∧ ∀𝑦 ∈ 𝐶 𝑍 ∈ 𝐷) → 𝑍 ∈ 𝐴)
21	20	3exp 1118	. . 3 ⊢ (𝐶 ≠ ∅ → (𝑥 ∈ 𝐵 → (∀𝑦 ∈ 𝐶 𝑍 ∈ 𝐷 → 𝑍 ∈ 𝐴)))
22	12, 13, 21	rexlimd 3250	. 2 ⊢ (𝐶 ≠ ∅ → (∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐶 𝑍 ∈ 𝐷 → 𝑍 ∈ 𝐴))
23	9, 22	impbid2 225	1 ⊢ (𝐶 ≠ ∅ → (𝑍 ∈ 𝐴 ↔ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐶 𝑍 ∈ 𝐷))

Syntax hints:   → wi 4   ↔ wb 205   ∧ w3a 1086   = wceq 1539   ∈ wcel 2106  Ⅎwnfc 2887   ≠ wne 2943  ∀wral 3064  ∃wrex 3065  ∅c0 4256  ∪ ciun 4924  ∩ ciin 4925

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 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2709

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-3an 1088  df-tru 1542  df-fal 1552  df-ex 1783  df-nf 1787  df-sb 2068  df-clab 2716  df-cleq 2730  df-clel 2816  df-nfc 2889  df-ne 2944  df-ral 3069  df-rex 3070  df-v 3434  df-sbc 3717  df-csb 3833  df-dif 3890  df-nul 4257  df-iun 4926  df-iin 4927

This theorem is referenced by: (None)