Users' Mathboxes Mathbox for Thierry Arnoux < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  iunrdx Structured version   Visualization version   GIF version

Theorem iunrdx 33158
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.
StepHypRef Expression
1 iunrdx.1 . . . . . . 7 (𝜑 → 𝐹:𝐴–onto→𝐶)
2 fof 6796 . . . . . . 7 (𝐹:𝐴–onto→𝐶 → 𝐹:𝐴⟶𝐶)
31, 2syl 18 . . . . . 6 (𝜑 → 𝐹:𝐴⟶𝐶)
43ffvelcdmda 7084 . . . . 5 ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝐹‘𝑥) ∈ 𝐶)
5 foelrn 7107 . . . . . 6 ((𝐹:𝐴–onto→𝐶 ∧ 𝑦 ∈ 𝐶) → ∃𝑥 ∈ 𝐴 𝑦 = (𝐹‘𝑥))
61, 5sylan 592 . . . . 5 ((𝜑 ∧ 𝑦 ∈ 𝐶) → ∃𝑥 ∈ 𝐴 𝑦 = (𝐹‘𝑥))
7 iunrdx.2 . . . . . 6 ((𝜑 ∧ 𝑦 = (𝐹‘𝑥)) → 𝐷 = 𝐵)
87eleq2d 2846 . . . . 5 ((𝜑 ∧ 𝑦 = (𝐹‘𝑥)) → (𝑧 ∈ 𝐷 ↔ 𝑧 ∈ 𝐵))
94, 6, 8rexxfrd 5370 . . . 4 (𝜑 → (∃𝑦 ∈ 𝐶 𝑧 ∈ 𝐷 ↔ ∃𝑥 ∈ 𝐴 𝑧 ∈ 𝐵))
109bicomd 226 . . 3 (𝜑 → (∃𝑥 ∈ 𝐴 𝑧 ∈ 𝐵 ↔ ∃𝑦 ∈ 𝐶 𝑧 ∈ 𝐷))
1110abbidv 2826 . 2 (𝜑 → {𝑧 ∣ ∃𝑥 ∈ 𝐴 𝑧 ∈ 𝐵} = {𝑧 ∣ ∃𝑦 ∈ 𝐶 𝑧 ∈ 𝐷})
12 df-iun 4952 . 2 ∪ 𝑥 ∈ 𝐴 𝐵 = {𝑧 ∣ ∃𝑥 ∈ 𝐴 𝑧 ∈ 𝐵}
13 df-iun 4952 . 2 ∪ 𝑦 ∈ 𝐶 𝐷 = {𝑧 ∣ ∃𝑦 ∈ 𝐶 𝑧 ∈ 𝐷}
1411, 12, 133eqtr4g 2820 1 (𝜑 → ∪ 𝑥 ∈ 𝐴 𝐵 = ∪ 𝑦 ∈ 𝐶 𝐷)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1569   ∈ wcel 2144  {cab 2738  ∃wrex 3086  ∪ ciun 4950  ⟶wf 6534  –onto→wfo 6536  ‘cfv 6538
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-sep 5248  ax-nul 5259  ax-pr 5390
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-ss 3896  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-sn 4584  df-pr 4586  df-op 4590  df-uni 4867  df-iun 4952  df-br 5103  df-opab 5167  df-mpt 5186  df-id 5545  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-rn 5661  df-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-fo 6544  df-fv 6546
This theorem is used by:  volmeas  34864
  Copyright terms: Public domain W3C validator