| 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 45767 | . 2 ⊢ (∀𝑚 ∈ 𝑍 ∪ 𝑛 ∈ (𝑁...𝑚)𝐴 = ∪ 𝑛 ∈ (𝑁...𝑚)𝐵 → ∪ 𝑛 ∈ 𝑍 𝐴 ⊆ ∪ 𝑛 ∈ 𝑍 𝐵) |
| 3 | eqcom 2744 | . . . . 5 ⊢ (∪ 𝑛 ∈ (𝑁...𝑚)𝐴 = ∪ 𝑛 ∈ (𝑁...𝑚)𝐵 ↔ ∪ 𝑛 ∈ (𝑁...𝑚)𝐵 = ∪ 𝑛 ∈ (𝑁...𝑚)𝐴) | |
| 4 | 3 | ralbii 3084 | . . . 4 ⊢ (∀𝑚 ∈ 𝑍 ∪ 𝑛 ∈ (𝑁...𝑚)𝐴 = ∪ 𝑛 ∈ (𝑁...𝑚)𝐵 ↔ ∀𝑚 ∈ 𝑍 ∪ 𝑛 ∈ (𝑁...𝑚)𝐵 = ∪ 𝑛 ∈ (𝑁...𝑚)𝐴) |
| 5 | 4 | biimpi 216 | . . 3 ⊢ (∀𝑚 ∈ 𝑍 ∪ 𝑛 ∈ (𝑁...𝑚)𝐴 = ∪ 𝑛 ∈ (𝑁...𝑚)𝐵 → ∀𝑚 ∈ 𝑍 ∪ 𝑛 ∈ (𝑁...𝑚)𝐵 = ∪ 𝑛 ∈ (𝑁...𝑚)𝐴) |
| 6 | 1 | iuneqfzuzlem 45767 | . . 3 ⊢ (∀𝑚 ∈ 𝑍 ∪ 𝑛 ∈ (𝑁...𝑚)𝐵 = ∪ 𝑛 ∈ (𝑁...𝑚)𝐴 → ∪ 𝑛 ∈ 𝑍 𝐵 ⊆ ∪ 𝑛 ∈ 𝑍 𝐴) |
| 7 | 5, 6 | syl 17 | . 2 ⊢ (∀𝑚 ∈ 𝑍 ∪ 𝑛 ∈ (𝑁...𝑚)𝐴 = ∪ 𝑛 ∈ (𝑁...𝑚)𝐵 → ∪ 𝑛 ∈ 𝑍 𝐵 ⊆ ∪ 𝑛 ∈ 𝑍 𝐴) |
| 8 | 2, 7 | eqssd 3940 | 1 ⊢ (∀𝑚 ∈ 𝑍 ∪ 𝑛 ∈ (𝑁...𝑚)𝐴 = ∪ 𝑛 ∈ (𝑁...𝑚)𝐵 → ∪ 𝑛 ∈ 𝑍 𝐴 = ∪ 𝑛 ∈ 𝑍 𝐵) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1542 ∀wral 3052 ⊆ wss 3890 ∪ ciun 4934 ‘cfv 6490 (class class class)co 7358 ℤ≥cuz 12752 ...cfz 13424 |
| 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 2709 ax-sep 5231 ax-nul 5241 ax-pow 5300 ax-pr 5368 ax-un 7680 ax-cnex 11083 ax-resscn 11084 ax-pre-lttri 11101 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-nel 3038 df-ral 3053 df-rex 3063 df-rab 3391 df-v 3432 df-sbc 3730 df-csb 3839 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-nul 4275 df-if 4468 df-pw 4544 df-sn 4569 df-pr 4571 df-op 4575 df-uni 4852 df-iun 4936 df-br 5087 df-opab 5149 df-mpt 5168 df-id 5517 df-xp 5628 df-rel 5629 df-cnv 5630 df-co 5631 df-dm 5632 df-rn 5633 df-res 5634 df-ima 5635 df-iota 6446 df-fun 6492 df-fn 6493 df-f 6494 df-f1 6495 df-fo 6496 df-f1o 6497 df-fv 6498 df-ov 7361 df-oprab 7362 df-mpo 7363 df-1st 7933 df-2nd 7934 df-er 8634 df-en 8885 df-dom 8886 df-sdom 8887 df-pnf 11169 df-mnf 11170 df-xr 11171 df-ltxr 11172 df-le 11173 df-neg 11368 df-z 12490 df-uz 12753 df-fz 13425 |
| This theorem is referenced by: iundjiun 46892 |
| Copyright terms: Public domain | W3C validator |