![]() |
Mathbox for Thierry Arnoux |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > Mathboxes > iunrdx | Structured version Visualization version GIF version |
Description: Re-index an indexed union. (Contributed by Thierry Arnoux, 6-Apr-2017.) |
Ref | Expression |
---|---|
iunrdx.1 | ⊢ (𝜑 → 𝐹:𝐴–onto→𝐶) |
iunrdx.2 | ⊢ ((𝜑 ∧ 𝑦 = (𝐹‘𝑥)) → 𝐷 = 𝐵) |
Ref | Expression |
---|---|
iunrdx | ⊢ (𝜑 → ∪ 𝑥 ∈ 𝐴 𝐵 = ∪ 𝑦 ∈ 𝐶 𝐷) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | iunrdx.1 | . . . . . . 7 ⊢ (𝜑 → 𝐹:𝐴–onto→𝐶) | |
2 | fof 6565 | . . . . . . 7 ⊢ (𝐹:𝐴–onto→𝐶 → 𝐹:𝐴⟶𝐶) | |
3 | 1, 2 | syl 17 | . . . . . 6 ⊢ (𝜑 → 𝐹:𝐴⟶𝐶) |
4 | 3 | ffvelrnda 6828 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝐹‘𝑥) ∈ 𝐶) |
5 | foelrn 6849 | . . . . . 6 ⊢ ((𝐹:𝐴–onto→𝐶 ∧ 𝑦 ∈ 𝐶) → ∃𝑥 ∈ 𝐴 𝑦 = (𝐹‘𝑥)) | |
6 | 1, 5 | sylan 583 | . . . . 5 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐶) → ∃𝑥 ∈ 𝐴 𝑦 = (𝐹‘𝑥)) |
7 | iunrdx.2 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑦 = (𝐹‘𝑥)) → 𝐷 = 𝐵) | |
8 | 7 | eleq2d 2875 | . . . . 5 ⊢ ((𝜑 ∧ 𝑦 = (𝐹‘𝑥)) → (𝑧 ∈ 𝐷 ↔ 𝑧 ∈ 𝐵)) |
9 | 4, 6, 8 | rexxfrd 5275 | . . . 4 ⊢ (𝜑 → (∃𝑦 ∈ 𝐶 𝑧 ∈ 𝐷 ↔ ∃𝑥 ∈ 𝐴 𝑧 ∈ 𝐵)) |
10 | 9 | bicomd 226 | . . 3 ⊢ (𝜑 → (∃𝑥 ∈ 𝐴 𝑧 ∈ 𝐵 ↔ ∃𝑦 ∈ 𝐶 𝑧 ∈ 𝐷)) |
11 | 10 | abbidv 2862 | . 2 ⊢ (𝜑 → {𝑧 ∣ ∃𝑥 ∈ 𝐴 𝑧 ∈ 𝐵} = {𝑧 ∣ ∃𝑦 ∈ 𝐶 𝑧 ∈ 𝐷}) |
12 | df-iun 4883 | . 2 ⊢ ∪ 𝑥 ∈ 𝐴 𝐵 = {𝑧 ∣ ∃𝑥 ∈ 𝐴 𝑧 ∈ 𝐵} | |
13 | df-iun 4883 | . 2 ⊢ ∪ 𝑦 ∈ 𝐶 𝐷 = {𝑧 ∣ ∃𝑦 ∈ 𝐶 𝑧 ∈ 𝐷} | |
14 | 11, 12, 13 | 3eqtr4g 2858 | 1 ⊢ (𝜑 → ∪ 𝑥 ∈ 𝐴 𝐵 = ∪ 𝑦 ∈ 𝐶 𝐷) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 399 = wceq 1538 ∈ wcel 2111 {cab 2776 ∃wrex 3107 ∪ ciun 4881 ⟶wf 6320 –onto→wfo 6322 ‘cfv 6324 |
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 1911 ax-6 1970 ax-7 2015 ax-8 2113 ax-9 2121 ax-10 2142 ax-11 2158 ax-12 2175 ax-ext 2770 ax-sep 5167 ax-nul 5174 ax-pr 5295 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 845 df-3an 1086 df-tru 1541 df-ex 1782 df-nf 1786 df-sb 2070 df-mo 2598 df-eu 2629 df-clab 2777 df-cleq 2791 df-clel 2870 df-nfc 2938 df-ral 3111 df-rex 3112 df-v 3443 df-sbc 3721 df-dif 3884 df-un 3886 df-in 3888 df-ss 3898 df-nul 4244 df-if 4426 df-sn 4526 df-pr 4528 df-op 4532 df-uni 4801 df-iun 4883 df-br 5031 df-opab 5093 df-mpt 5111 df-id 5425 df-xp 5525 df-rel 5526 df-cnv 5527 df-co 5528 df-dm 5529 df-rn 5530 df-iota 6283 df-fun 6326 df-fn 6327 df-f 6328 df-fo 6330 df-fv 6332 |
This theorem is referenced by: volmeas 31600 |
Copyright terms: Public domain | W3C validator |