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 6028 | . . . . . . 7 ⊢ (𝐹:𝐴–onto→𝐶 → 𝐹:𝐴⟶𝐶) | |
3 | 1, 2 | syl 17 | . . . . . 6 ⊢ (𝜑 → 𝐹:𝐴⟶𝐶) |
4 | 3 | ffvelrnda 6267 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝐹‘𝑥) ∈ 𝐶) |
5 | foelrn 6286 | . . . . . 6 ⊢ ((𝐹:𝐴–onto→𝐶 ∧ 𝑦 ∈ 𝐶) → ∃𝑥 ∈ 𝐴 𝑦 = (𝐹‘𝑥)) | |
6 | 1, 5 | sylan 487 | . . . . 5 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐶) → ∃𝑥 ∈ 𝐴 𝑦 = (𝐹‘𝑥)) |
7 | iunrdx.2 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑦 = (𝐹‘𝑥)) → 𝐷 = 𝐵) | |
8 | 7 | eleq2d 2673 | . . . . 5 ⊢ ((𝜑 ∧ 𝑦 = (𝐹‘𝑥)) → (𝑧 ∈ 𝐷 ↔ 𝑧 ∈ 𝐵)) |
9 | 4, 6, 8 | rexxfrd 4807 | . . . 4 ⊢ (𝜑 → (∃𝑦 ∈ 𝐶 𝑧 ∈ 𝐷 ↔ ∃𝑥 ∈ 𝐴 𝑧 ∈ 𝐵)) |
10 | 9 | bicomd 212 | . . 3 ⊢ (𝜑 → (∃𝑥 ∈ 𝐴 𝑧 ∈ 𝐵 ↔ ∃𝑦 ∈ 𝐶 𝑧 ∈ 𝐷)) |
11 | 10 | abbidv 2728 | . 2 ⊢ (𝜑 → {𝑧 ∣ ∃𝑥 ∈ 𝐴 𝑧 ∈ 𝐵} = {𝑧 ∣ ∃𝑦 ∈ 𝐶 𝑧 ∈ 𝐷}) |
12 | df-iun 4457 | . 2 ⊢ ∪ 𝑥 ∈ 𝐴 𝐵 = {𝑧 ∣ ∃𝑥 ∈ 𝐴 𝑧 ∈ 𝐵} | |
13 | df-iun 4457 | . 2 ⊢ ∪ 𝑦 ∈ 𝐶 𝐷 = {𝑧 ∣ ∃𝑦 ∈ 𝐶 𝑧 ∈ 𝐷} | |
14 | 11, 12, 13 | 3eqtr4g 2669 | 1 ⊢ (𝜑 → ∪ 𝑥 ∈ 𝐴 𝐵 = ∪ 𝑦 ∈ 𝐶 𝐷) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 383 = wceq 1475 ∈ wcel 1977 {cab 2596 ∃wrex 2897 ∪ ciun 4455 ⟶wf 5800 –onto→wfo 5802 ‘cfv 5804 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1713 ax-4 1728 ax-5 1827 ax-6 1875 ax-7 1922 ax-9 1986 ax-10 2006 ax-11 2021 ax-12 2034 ax-13 2234 ax-ext 2590 ax-sep 4709 ax-nul 4717 ax-pr 4833 |
This theorem depends on definitions: df-bi 196 df-or 384 df-an 385 df-3an 1033 df-tru 1478 df-ex 1696 df-nf 1701 df-sb 1868 df-eu 2462 df-mo 2463 df-clab 2597 df-cleq 2603 df-clel 2606 df-nfc 2740 df-ral 2901 df-rex 2902 df-rab 2905 df-v 3175 df-sbc 3403 df-dif 3543 df-un 3545 df-in 3547 df-ss 3554 df-nul 3875 df-if 4037 df-sn 4126 df-pr 4128 df-op 4132 df-uni 4373 df-iun 4457 df-br 4584 df-opab 4644 df-mpt 4645 df-id 4953 df-xp 5044 df-rel 5045 df-cnv 5046 df-co 5047 df-dm 5048 df-rn 5049 df-iota 5768 df-fun 5806 df-fn 5807 df-f 5808 df-fo 5810 df-fv 5812 |
This theorem is referenced by: volmeas 29621 |
Copyright terms: Public domain | W3C validator |