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 32633
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 6752 . . . . . . 7 (𝐹:𝐴onto𝐶𝐹:𝐴𝐶)
31, 2syl 17 . . . . . 6 (𝜑𝐹:𝐴𝐶)
43ffvelcdmda 7036 . . . . 5 ((𝜑𝑥𝐴) → (𝐹𝑥) ∈ 𝐶)
5 foelrn 7059 . . . . . 6 ((𝐹:𝐴onto𝐶𝑦𝐶) → ∃𝑥𝐴 𝑦 = (𝐹𝑥))
61, 5sylan 581 . . . . 5 ((𝜑𝑦𝐶) → ∃𝑥𝐴 𝑦 = (𝐹𝑥))
7 iunrdx.2 . . . . . 6 ((𝜑𝑦 = (𝐹𝑥)) → 𝐷 = 𝐵)
87eleq2d 2822 . . . . 5 ((𝜑𝑦 = (𝐹𝑥)) → (𝑧𝐷𝑧𝐵))
94, 6, 8rexxfrd 5351 . . . 4 (𝜑 → (∃𝑦𝐶 𝑧𝐷 ↔ ∃𝑥𝐴 𝑧𝐵))
109bicomd 223 . . 3 (𝜑 → (∃𝑥𝐴 𝑧𝐵 ↔ ∃𝑦𝐶 𝑧𝐷))
1110abbidv 2802 . 2 (𝜑 → {𝑧 ∣ ∃𝑥𝐴 𝑧𝐵} = {𝑧 ∣ ∃𝑦𝐶 𝑧𝐷})
12 df-iun 4935 . 2 𝑥𝐴 𝐵 = {𝑧 ∣ ∃𝑥𝐴 𝑧𝐵}
13 df-iun 4935 . 2 𝑦𝐶 𝐷 = {𝑧 ∣ ∃𝑦𝐶 𝑧𝐷}
1411, 12, 133eqtr4g 2796 1 (𝜑 𝑥𝐴 𝐵 = 𝑦𝐶 𝐷)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395   = wceq 1542  wcel 2114  {cab 2714  wrex 3061   ciun 4933  wf 6494  ontowfo 6496  cfv 6498
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 2185  ax-ext 2708  ax-sep 5231  ax-nul 5241  ax-pr 5375
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 2539  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2811  df-nfc 2885  df-ne 2933  df-ral 3052  df-rex 3062  df-rab 3390  df-v 3431  df-dif 3892  df-un 3894  df-in 3896  df-ss 3906  df-nul 4274  df-if 4467  df-sn 4568  df-pr 4570  df-op 4574  df-uni 4851  df-iun 4935  df-br 5086  df-opab 5148  df-mpt 5167  df-id 5526  df-xp 5637  df-rel 5638  df-cnv 5639  df-co 5640  df-dm 5641  df-rn 5642  df-iota 6454  df-fun 6500  df-fn 6501  df-f 6502  df-fo 6504  df-fv 6506
This theorem is referenced by:  volmeas  34375
  Copyright terms: Public domain W3C validator