| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > iuneq2 | Structured version Visualization version GIF version | ||
| Description: Equality theorem for indexed union. (Contributed by NM, 22-Oct-2003.) |
| Ref | Expression |
|---|---|
| iuneq2 | ⊢ (∀𝑥 ∈ 𝐴 𝐵 = 𝐶 → ∪ 𝑥 ∈ 𝐴 𝐵 = ∪ 𝑥 ∈ 𝐴 𝐶) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ss2iun 4963 | . . 3 ⊢ (∀𝑥 ∈ 𝐴 𝐵 ⊆ 𝐶 → ∪ 𝑥 ∈ 𝐴 𝐵 ⊆ ∪ 𝑥 ∈ 𝐴 𝐶) | |
| 2 | ss2iun 4963 | . . 3 ⊢ (∀𝑥 ∈ 𝐴 𝐶 ⊆ 𝐵 → ∪ 𝑥 ∈ 𝐴 𝐶 ⊆ ∪ 𝑥 ∈ 𝐴 𝐵) | |
| 3 | 1, 2 | anim12i 613 | . 2 ⊢ ((∀𝑥 ∈ 𝐴 𝐵 ⊆ 𝐶 ∧ ∀𝑥 ∈ 𝐴 𝐶 ⊆ 𝐵) → (∪ 𝑥 ∈ 𝐴 𝐵 ⊆ ∪ 𝑥 ∈ 𝐴 𝐶 ∧ ∪ 𝑥 ∈ 𝐴 𝐶 ⊆ ∪ 𝑥 ∈ 𝐴 𝐵)) |
| 4 | eqss 3947 | . . . 4 ⊢ (𝐵 = 𝐶 ↔ (𝐵 ⊆ 𝐶 ∧ 𝐶 ⊆ 𝐵)) | |
| 5 | 4 | ralbii 3080 | . . 3 ⊢ (∀𝑥 ∈ 𝐴 𝐵 = 𝐶 ↔ ∀𝑥 ∈ 𝐴 (𝐵 ⊆ 𝐶 ∧ 𝐶 ⊆ 𝐵)) |
| 6 | r19.26 3094 | . . 3 ⊢ (∀𝑥 ∈ 𝐴 (𝐵 ⊆ 𝐶 ∧ 𝐶 ⊆ 𝐵) ↔ (∀𝑥 ∈ 𝐴 𝐵 ⊆ 𝐶 ∧ ∀𝑥 ∈ 𝐴 𝐶 ⊆ 𝐵)) | |
| 7 | 5, 6 | bitri 275 | . 2 ⊢ (∀𝑥 ∈ 𝐴 𝐵 = 𝐶 ↔ (∀𝑥 ∈ 𝐴 𝐵 ⊆ 𝐶 ∧ ∀𝑥 ∈ 𝐴 𝐶 ⊆ 𝐵)) |
| 8 | eqss 3947 | . 2 ⊢ (∪ 𝑥 ∈ 𝐴 𝐵 = ∪ 𝑥 ∈ 𝐴 𝐶 ↔ (∪ 𝑥 ∈ 𝐴 𝐵 ⊆ ∪ 𝑥 ∈ 𝐴 𝐶 ∧ ∪ 𝑥 ∈ 𝐴 𝐶 ⊆ ∪ 𝑥 ∈ 𝐴 𝐵)) | |
| 9 | 3, 7, 8 | 3imtr4i 292 | 1 ⊢ (∀𝑥 ∈ 𝐴 𝐵 = 𝐶 → ∪ 𝑥 ∈ 𝐴 𝐵 = ∪ 𝑥 ∈ 𝐴 𝐶) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1541 ∀wral 3049 ⊆ wss 3899 ∪ ciun 4944 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-ext 2706 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-tru 1544 df-ex 1781 df-sb 2068 df-clab 2713 df-cleq 2726 df-clel 2809 df-ral 3050 df-rex 3059 df-v 3440 df-ss 3916 df-iun 4946 |
| This theorem is referenced by: iuneq2i 4966 iuneq2dv 4969 iunxdif3 5048 oa0r 8463 om0r 8464 om1r 8468 oe1m 8470 oaass 8486 oarec 8487 omass 8505 oeoalem 8522 oeoelem 8524 cardiun 9892 kmlem11 10069 iuncld 22987 comppfsc 23474 istotbnd3 37911 sstotbnd 37915 heibor 37961 iuneq12f 38303 cnvtrclfv 43907 iuneq2df 45234 |
| Copyright terms: Public domain | W3C validator |