Theorem iuniin 4933

Description: Law combining indexed union with indexed intersection. Eq. 14 in [KuratowskiMostowski] p. 109. This theorem also appears as the last example at http://en.wikipedia.org/wiki/Union%5F%28set%5Ftheory%29. (Contributed by NM, 17-Aug-2004.) (Proof shortened by Andrew Salmon, 25-Jul-2011.)

Assertion

Ref	Expression
iuniin	⊢ ∪ 𝑥 ∈ 𝐴 ∩ 𝑦 ∈ 𝐵 𝐶 ⊆ ∩ 𝑦 ∈ 𝐵 ∪ 𝑥 ∈ 𝐴 𝐶

Distinct variable groups:   𝑥,𝑦   𝑦,𝐴   𝑥,𝐵

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

Proof of Theorem iuniin

Dummy variable 𝑧 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		r19.12 3252	. . . 4 ⊢ (∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 𝑧 ∈ 𝐶 → ∀𝑦 ∈ 𝐵 ∃𝑥 ∈ 𝐴 𝑧 ∈ 𝐶)
2		eliin 4926	. . . . . 6 ⊢ (𝑧 ∈ V → (𝑧 ∈ ∩ 𝑦 ∈ 𝐵 𝐶 ↔ ∀𝑦 ∈ 𝐵 𝑧 ∈ 𝐶))
3	2	elv 3428	. . . . 5 ⊢ (𝑧 ∈ ∩ 𝑦 ∈ 𝐵 𝐶 ↔ ∀𝑦 ∈ 𝐵 𝑧 ∈ 𝐶)
4	3	rexbii 3177	. . . 4 ⊢ (∃𝑥 ∈ 𝐴 𝑧 ∈ ∩ 𝑦 ∈ 𝐵 𝐶 ↔ ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 𝑧 ∈ 𝐶)
5		eliun 4925	. . . . 5 ⊢ (𝑧 ∈ ∪ 𝑥 ∈ 𝐴 𝐶 ↔ ∃𝑥 ∈ 𝐴 𝑧 ∈ 𝐶)
6	5	ralbii 3090	. . . 4 ⊢ (∀𝑦 ∈ 𝐵 𝑧 ∈ ∪ 𝑥 ∈ 𝐴 𝐶 ↔ ∀𝑦 ∈ 𝐵 ∃𝑥 ∈ 𝐴 𝑧 ∈ 𝐶)
7	1, 4, 6	3imtr4i 291	. . 3 ⊢ (∃𝑥 ∈ 𝐴 𝑧 ∈ ∩ 𝑦 ∈ 𝐵 𝐶 → ∀𝑦 ∈ 𝐵 𝑧 ∈ ∪ 𝑥 ∈ 𝐴 𝐶)
8		eliun 4925	. . 3 ⊢ (𝑧 ∈ ∪ 𝑥 ∈ 𝐴 ∩ 𝑦 ∈ 𝐵 𝐶 ↔ ∃𝑥 ∈ 𝐴 𝑧 ∈ ∩ 𝑦 ∈ 𝐵 𝐶)
9		eliin 4926	. . . 4 ⊢ (𝑧 ∈ V → (𝑧 ∈ ∩ 𝑦 ∈ 𝐵 ∪ 𝑥 ∈ 𝐴 𝐶 ↔ ∀𝑦 ∈ 𝐵 𝑧 ∈ ∪ 𝑥 ∈ 𝐴 𝐶))
10	9	elv 3428	. . 3 ⊢ (𝑧 ∈ ∩ 𝑦 ∈ 𝐵 ∪ 𝑥 ∈ 𝐴 𝐶 ↔ ∀𝑦 ∈ 𝐵 𝑧 ∈ ∪ 𝑥 ∈ 𝐴 𝐶)
11	7, 8, 10	3imtr4i 291	. 2 ⊢ (𝑧 ∈ ∪ 𝑥 ∈ 𝐴 ∩ 𝑦 ∈ 𝐵 𝐶 → 𝑧 ∈ ∩ 𝑦 ∈ 𝐵 ∪ 𝑥 ∈ 𝐴 𝐶)
12	11	ssriv 3921	1 ⊢ ∪ 𝑥 ∈ 𝐴 ∩ 𝑦 ∈ 𝐵 𝐶 ⊆ ∩ 𝑦 ∈ 𝐵 ∪ 𝑥 ∈ 𝐴 𝐶

Syntax hints:   ↔ wb 205   ∈ wcel 2108  ∀wral 3063  ∃wrex 3064  Vcvv 3422   ⊆ wss 3883  ∪ ciun 4921  ∩ ciin 4922

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1799  ax-4 1813  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2110  ax-9 2118  ax-10 2139  ax-11 2156  ax-12 2173  ax-ext 2709

This theorem depends on definitions:  df-bi 206  df-an 396  df-or 844  df-tru 1542  df-ex 1784  df-nf 1788  df-sb 2069  df-clab 2716  df-cleq 2730  df-clel 2817  df-ral 3068  df-rex 3069  df-v 3424  df-in 3890  df-ss 3900  df-iun 4923  df-iin 4924

This theorem is referenced by: (None)