| Mathbox for Glauco Siliprandi |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > iuneqfzuz | Structured version Visualization version GIF version | ||
| Description: If two unions indexed by upper integers are equal if they agree on any partial indexed union. (Contributed by Glauco Siliprandi, 17-Aug-2020.) |
| Ref | Expression |
|---|---|
| iuneqfzuz.z | ⊢ 𝑍 = (ℤ≥‘𝑁) |
| Ref | Expression |
|---|---|
| iuneqfzuz | ⊢ (∀𝑚 ∈ 𝑍 ∪ 𝑛 ∈ (𝑁...𝑚)𝐴 = ∪ 𝑛 ∈ (𝑁...𝑚)𝐵 → ∪ 𝑛 ∈ 𝑍 𝐴 = ∪ 𝑛 ∈ 𝑍 𝐵) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | iuneqfzuz.z | . . 3 ⊢ 𝑍 = (ℤ≥‘𝑁) | |
| 2 | 1 | iuneqfzuzlem 45791 | . 2 ⊢ (∀𝑚 ∈ 𝑍 ∪ 𝑛 ∈ (𝑁...𝑚)𝐴 = ∪ 𝑛 ∈ (𝑁...𝑚)𝐵 → ∪ 𝑛 ∈ 𝑍 𝐴 ⊆ ∪ 𝑛 ∈ 𝑍 𝐵) |
| 3 | eqcom 2748 | . . . . 5 ⊢ (∪ 𝑛 ∈ (𝑁...𝑚)𝐴 = ∪ 𝑛 ∈ (𝑁...𝑚)𝐵 ↔ ∪ 𝑛 ∈ (𝑁...𝑚)𝐵 = ∪ 𝑛 ∈ (𝑁...𝑚)𝐴) | |
| 4 | 3 | ralbii 3087 | . . . 4 ⊢ (∀𝑚 ∈ 𝑍 ∪ 𝑛 ∈ (𝑁...𝑚)𝐴 = ∪ 𝑛 ∈ (𝑁...𝑚)𝐵 ↔ ∀𝑚 ∈ 𝑍 ∪ 𝑛 ∈ (𝑁...𝑚)𝐵 = ∪ 𝑛 ∈ (𝑁...𝑚)𝐴) |
| 5 | 4 | biimpi 218 | . . 3 ⊢ (∀𝑚 ∈ 𝑍 ∪ 𝑛 ∈ (𝑁...𝑚)𝐴 = ∪ 𝑛 ∈ (𝑁...𝑚)𝐵 → ∀𝑚 ∈ 𝑍 ∪ 𝑛 ∈ (𝑁...𝑚)𝐵 = ∪ 𝑛 ∈ (𝑁...𝑚)𝐴) |
| 6 | 1 | iuneqfzuzlem 45791 | . . 3 ⊢ (∀𝑚 ∈ 𝑍 ∪ 𝑛 ∈ (𝑁...𝑚)𝐵 = ∪ 𝑛 ∈ (𝑁...𝑚)𝐴 → ∪ 𝑛 ∈ 𝑍 𝐵 ⊆ ∪ 𝑛 ∈ 𝑍 𝐴) |
| 7 | 5, 6 | syl 17 | . 2 ⊢ (∀𝑚 ∈ 𝑍 ∪ 𝑛 ∈ (𝑁...𝑚)𝐴 = ∪ 𝑛 ∈ (𝑁...𝑚)𝐵 → ∪ 𝑛 ∈ 𝑍 𝐵 ⊆ ∪ 𝑛 ∈ 𝑍 𝐴) |
| 8 | 2, 7 | eqssd 3933 | 1 ⊢ (∀𝑚 ∈ 𝑍 ∪ 𝑛 ∈ (𝑁...𝑚)𝐴 = ∪ 𝑛 ∈ (𝑁...𝑚)𝐵 → ∪ 𝑛 ∈ 𝑍 𝐴 = ∪ 𝑛 ∈ 𝑍 𝐵) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1548 ∀wral 3055 ⊆ wss 3884 ∪ ciun 4923 ‘cfv 6488 (class class class)co 7359 ℤ≥cuz 12783 ...cfz 13456 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1803 ax-4 1817 ax-5 1918 ax-6 1975 ax-7 2016 ax-8 2123 ax-9 2131 ax-10 2154 ax-11 2170 ax-12 2191 ax-ext 2713 ax-sep 5220 ax-nul 5230 ax-pow 5296 ax-pr 5364 ax-un 7681 ax-cnex 11090 ax-resscn 11091 ax-pre-lttri 11108 |
| This theorem depends on definitions: df-bi 209 df-an 398 df-or 855 df-3or 1094 df-3an 1095 df-tru 1551 df-fal 1561 df-ex 1788 df-nf 1792 df-sb 2075 df-mo 2545 df-eu 2575 df-clab 2720 df-cleq 2733 df-clel 2816 df-nfc 2890 df-ne 2937 df-nel 3041 df-ral 3056 df-rex 3066 df-rab 3394 df-v 3435 df-sbc 3725 df-csb 3833 df-dif 3887 df-un 3889 df-in 3891 df-ss 3901 df-nul 4264 df-if 4457 df-pw 4533 df-sn 4558 df-pr 4560 df-op 4564 df-uni 4841 df-iun 4925 df-br 5075 df-opab 5137 df-mpt 5156 df-id 5515 df-xp 5626 df-rel 5627 df-cnv 5628 df-co 5629 df-dm 5630 df-rn 5631 df-res 5632 df-ima 5633 df-iota 6444 df-fun 6490 df-fn 6491 df-f 6492 df-f1 6493 df-fo 6494 df-f1o 6495 df-fv 6496 df-ov 7362 df-oprab 7363 df-mpo 7364 df-1st 7933 df-2nd 7934 df-er 8637 df-en 8888 df-dom 8889 df-sdom 8890 df-pnf 11177 df-mnf 11178 df-xr 11179 df-ltxr 11180 df-le 11181 df-neg 11376 df-z 12520 df-uz 12784 df-fz 13457 |
| This theorem is referenced by: iundjiun 46915 |
| Copyright terms: Public domain | W3C validator |