Theorem iunrdx 30315

Description: Re-index an indexed union. (Contributed by Thierry Arnoux, 6-Apr-2017.)

Hypotheses

Ref	Expression
iunrdx.1	⊢ (𝜑 → 𝐹:𝐴–onto→𝐶)
iunrdx.2	⊢ ((𝜑 ∧ 𝑦 = (𝐹‘𝑥)) → 𝐷 = 𝐵)

Assertion

Ref	Expression
iunrdx	⊢ (𝜑 → ∪ 𝑥 ∈ 𝐴 𝐵 = ∪ 𝑦 ∈ 𝐶 𝐷)

Distinct variable groups:   𝑥,𝑦,𝐴   𝑦,𝐵   𝑥,𝐶,𝑦   𝑥,𝐷   𝑥,𝐹,𝑦   𝜑,𝑥,𝑦

Allowed substitution hints:   𝐵(𝑥)   𝐷(𝑦)

Proof of Theorem iunrdx

Dummy variable 𝑧 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		iunrdx.1	. . . . . . 7 ⊢ (𝜑 → 𝐹:𝐴–onto→𝐶)
2		fof 6590	. . . . . . 7 ⊢ (𝐹:𝐴–onto→𝐶 → 𝐹:𝐴⟶𝐶)
3	1, 2	syl 17	. . . . . 6 ⊢ (𝜑 → 𝐹:𝐴⟶𝐶)
4	3	ffvelrnda 6851	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝐹‘𝑥) ∈ 𝐶)
5		foelrn 6872	. . . . . 6 ⊢ ((𝐹:𝐴–onto→𝐶 ∧ 𝑦 ∈ 𝐶) → ∃𝑥 ∈ 𝐴 𝑦 = (𝐹‘𝑥))
6	1, 5	sylan 582	. . . . 5 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐶) → ∃𝑥 ∈ 𝐴 𝑦 = (𝐹‘𝑥))
7		iunrdx.2	. . . . . 6 ⊢ ((𝜑 ∧ 𝑦 = (𝐹‘𝑥)) → 𝐷 = 𝐵)
8	7	eleq2d 2898	. . . . 5 ⊢ ((𝜑 ∧ 𝑦 = (𝐹‘𝑥)) → (𝑧 ∈ 𝐷 ↔ 𝑧 ∈ 𝐵))
9	4, 6, 8	rexxfrd 5310	. . . 4 ⊢ (𝜑 → (∃𝑦 ∈ 𝐶 𝑧 ∈ 𝐷 ↔ ∃𝑥 ∈ 𝐴 𝑧 ∈ 𝐵))
10	9	bicomd 225	. . 3 ⊢ (𝜑 → (∃𝑥 ∈ 𝐴 𝑧 ∈ 𝐵 ↔ ∃𝑦 ∈ 𝐶 𝑧 ∈ 𝐷))
11	10	abbidv 2885	. 2 ⊢ (𝜑 → {𝑧 ∣ ∃𝑥 ∈ 𝐴 𝑧 ∈ 𝐵} = {𝑧 ∣ ∃𝑦 ∈ 𝐶 𝑧 ∈ 𝐷})
12		df-iun 4921	. 2 ⊢ ∪ 𝑥 ∈ 𝐴 𝐵 = {𝑧 ∣ ∃𝑥 ∈ 𝐴 𝑧 ∈ 𝐵}
13		df-iun 4921	. 2 ⊢ ∪ 𝑦 ∈ 𝐶 𝐷 = {𝑧 ∣ ∃𝑦 ∈ 𝐶 𝑧 ∈ 𝐷}
14	11, 12, 13	3eqtr4g 2881	1 ⊢ (𝜑 → ∪ 𝑥 ∈ 𝐴 𝐵 = ∪ 𝑦 ∈ 𝐶 𝐷)

Syntax hints:   → wi 4   ∧ wa 398   = wceq 1537   ∈ wcel 2114  {cab 2799  ∃wrex 3139  ∪ ciun 4919  ⟶wf 6351  –onto→wfo 6353  ‘cfv 6355

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  ax-sep 5203  ax-nul 5210  ax-pr 5330

This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1085  df-tru 1540  df-ex 1781  df-nf 1785  df-sb 2070  df-mo 2622  df-eu 2654  df-clab 2800  df-cleq 2814  df-clel 2893  df-nfc 2963  df-ral 3143  df-rex 3144  df-rab 3147  df-v 3496  df-sbc 3773  df-dif 3939  df-un 3941  df-in 3943  df-ss 3952  df-nul 4292  df-if 4468  df-sn 4568  df-pr 4570  df-op 4574  df-uni 4839  df-iun 4921  df-br 5067  df-opab 5129  df-mpt 5147  df-id 5460  df-xp 5561  df-rel 5562  df-cnv 5563  df-co 5564  df-dm 5565  df-rn 5566  df-iota 6314  df-fun 6357  df-fn 6358  df-f 6359  df-fo 6361  df-fv 6363

This theorem is referenced by:  volmeas  31490