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 32618
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 6745 . . . . . . 7 (𝐹:𝐴onto𝐶𝐹:𝐴𝐶)
31, 2syl 17 . . . . . 6 (𝜑𝐹:𝐴𝐶)
43ffvelcdmda 7029 . . . . 5 ((𝜑𝑥𝐴) → (𝐹𝑥) ∈ 𝐶)
5 foelrn 7052 . . . . . 6 ((𝐹:𝐴onto𝐶𝑦𝐶) → ∃𝑥𝐴 𝑦 = (𝐹𝑥))
61, 5sylan 581 . . . . 5 ((𝜑𝑦𝐶) → ∃𝑥𝐴 𝑦 = (𝐹𝑥))
7 iunrdx.2 . . . . . 6 ((𝜑𝑦 = (𝐹𝑥)) → 𝐷 = 𝐵)
87eleq2d 2821 . . . . 5 ((𝜑𝑦 = (𝐹𝑥)) → (𝑧𝐷𝑧𝐵))
94, 6, 8rexxfrd 5353 . . . 4 (𝜑 → (∃𝑦𝐶 𝑧𝐷 ↔ ∃𝑥𝐴 𝑧𝐵))
109bicomd 223 . . 3 (𝜑 → (∃𝑥𝐴 𝑧𝐵 ↔ ∃𝑦𝐶 𝑧𝐷))
1110abbidv 2801 . 2 (𝜑 → {𝑧 ∣ ∃𝑥𝐴 𝑧𝐵} = {𝑧 ∣ ∃𝑦𝐶 𝑧𝐷})
12 df-iun 4947 . 2 𝑥𝐴 𝐵 = {𝑧 ∣ ∃𝑥𝐴 𝑧𝐵}
13 df-iun 4947 . 2 𝑦𝐶 𝐷 = {𝑧 ∣ ∃𝑦𝐶 𝑧𝐷}
1411, 12, 133eqtr4g 2795 1 (𝜑 𝑥𝐴 𝐵 = 𝑦𝐶 𝐷)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395   = wceq 1542  wcel 2114  {cab 2713  wrex 3059   ciun 4945  wf 6487  ontowfo 6489  cfv 6491
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2183  ax-ext 2707  ax-sep 5240  ax-nul 5250  ax-pr 5376
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2538  df-eu 2568  df-clab 2714  df-cleq 2727  df-clel 2810  df-nfc 2884  df-ne 2932  df-ral 3051  df-rex 3060  df-rab 3399  df-v 3441  df-dif 3903  df-un 3905  df-ss 3917  df-nul 4285  df-if 4479  df-sn 4580  df-pr 4582  df-op 4586  df-uni 4863  df-iun 4947  df-br 5098  df-opab 5160  df-mpt 5179  df-id 5518  df-xp 5629  df-rel 5630  df-cnv 5631  df-co 5632  df-dm 5633  df-rn 5634  df-iota 6447  df-fun 6493  df-fn 6494  df-f 6495  df-fo 6497  df-fv 6499
This theorem is referenced by:  volmeas  34367
  Copyright terms: Public domain W3C validator