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 33227
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 6815 . . . . . . 7 (𝐹:𝐴⟶onto𝐶 → 𝐹:𝐴⟶𝐶)
31, 2syl 18 . . . . . 6 (𝜑 → 𝐹:𝐴⟶𝐶)
43ffvelcdmda 7105 . . . . 5 ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝐹‘𝑥) ∈ 𝐶)
5 foelrn 7128 . . . . . 6 ((𝐹:𝐴⟶onto𝐶 ∧ 𝑦 ∈ 𝐶) → ∃𝑥 ∈ 𝐴 𝑦 = (𝐹‘𝑥))
61, 5sylan 592 . . . . 5 ((𝜑 ∧ 𝑦 ∈ 𝐶) → ∃𝑥 ∈ 𝐴 𝑦 = (𝐹‘𝑥))
7 iunrdx.2 . . . . . 6 ((𝜑 ∧ 𝑦 = (𝐹‘𝑥)) → 𝐷 = 𝐵)
87eleq2d 2850 . . . . 5 ((𝜑 ∧ 𝑦 = (𝐹‘𝑥)) → (𝑧 ∈ 𝐷 ↔ 𝑧 ∈ 𝐵))
94, 6, 8rexxfrd 5375 . . . 4 (𝜑 → (∃𝑦 ∈ 𝐶 𝑧 ∈ 𝐷 ↔ ∃𝑥 ∈ 𝐴 𝑧 ∈ 𝐵))
109bicomd 226 . . 3 (𝜑 → (∃𝑥 ∈ 𝐴 𝑧 ∈ 𝐵 ↔ ∃𝑦 ∈ 𝐶 𝑧 ∈ 𝐷))
1110abbidv 2829 . 2 (𝜑 → {𝑧 ∣ ∃𝑥 ∈ 𝐴 𝑧 ∈ 𝐵} = {𝑧 ∣ ∃𝑦 ∈ 𝐶 𝑧 ∈ 𝐷})
12 df-iun 4956 . 2 ∪ 𝑥 ∈ 𝐴 𝐵 = {𝑧 ∣ ∃𝑥 ∈ 𝐴 𝑧 ∈ 𝐵}
13 df-iun 4956 . 2 ∪ 𝑦 ∈ 𝐶 𝐷 = {𝑧 ∣ ∃𝑦 ∈ 𝐶 𝑧 ∈ 𝐷}
1411, 12, 133eqtr4g 2823 1 (𝜑 → ∪ 𝑥 ∈ 𝐴 𝐵 = ∪ 𝑦 ∈ 𝐶 𝐷)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2147  {cab 2741  ∃wrex 3090  ∪ ciun 4954  ⟶wf 6551  ⟶ontowfo 6553  ‘cfv 6555
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5252  ax-nul 5263  ax-pr 5395
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-iun 4956  df-br 5107  df-opab 5171  df-mpt 5190  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-iota 6509  df-fun 6557  df-fn 6558  df-f 6559  df-fo 6561  df-fv 6563
This theorem is used by:  volmeas  34931
  Copyright terms: Public domain W3C validator