| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > iunsuc | Structured version Visualization version GIF version | ||
| Description: Inductive definition for the indexed union at a successor. (Contributed by Mario Carneiro, 4-Feb-2013.) (Proof shortened by Mario Carneiro, 18-Nov-2016.) |
| Ref | Expression |
|---|---|
| iunsuc.1 | ⊢ 𝐴 ∈ V |
| iunsuc.2 | ⊢ (𝑥 = 𝐴 → 𝐵 = 𝐶) |
| Ref | Expression |
|---|---|
| iunsuc | ⊢ ∪ 𝑥 ∈ suc 𝐴𝐵 = (∪ 𝑥 ∈ 𝐴 𝐵 ∪ 𝐶) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | df-suc 6341 | . . 3 ⊢ suc 𝐴 = (𝐴 ∪ {𝐴}) | |
| 2 | iuneq1 4975 | . . 3 ⊢ (suc 𝐴 = (𝐴 ∪ {𝐴}) → ∪ 𝑥 ∈ suc 𝐴𝐵 = ∪ 𝑥 ∈ (𝐴 ∪ {𝐴})𝐵) | |
| 3 | 1, 2 | ax-mp 5 | . 2 ⊢ ∪ 𝑥 ∈ suc 𝐴𝐵 = ∪ 𝑥 ∈ (𝐴 ∪ {𝐴})𝐵 |
| 4 | iunxun 5061 | . 2 ⊢ ∪ 𝑥 ∈ (𝐴 ∪ {𝐴})𝐵 = (∪ 𝑥 ∈ 𝐴 𝐵 ∪ ∪ 𝑥 ∈ {𝐴}𝐵) | |
| 5 | iunsuc.1 | . . . 4 ⊢ 𝐴 ∈ V | |
| 6 | iunsuc.2 | . . . 4 ⊢ (𝑥 = 𝐴 → 𝐵 = 𝐶) | |
| 7 | 5, 6 | iunxsn 5058 | . . 3 ⊢ ∪ 𝑥 ∈ {𝐴}𝐵 = 𝐶 |
| 8 | 7 | uneq2i 4131 | . 2 ⊢ (∪ 𝑥 ∈ 𝐴 𝐵 ∪ ∪ 𝑥 ∈ {𝐴}𝐵) = (∪ 𝑥 ∈ 𝐴 𝐵 ∪ 𝐶) |
| 9 | 3, 4, 8 | 3eqtri 2757 | 1 ⊢ ∪ 𝑥 ∈ suc 𝐴𝐵 = (∪ 𝑥 ∈ 𝐴 𝐵 ∪ 𝐶) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1540 ∈ wcel 2109 Vcvv 3450 ∪ cun 3915 {csn 4592 ∪ ciun 4958 suc csuc 6337 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-ext 2702 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-tru 1543 df-ex 1780 df-sb 2066 df-clab 2709 df-cleq 2722 df-clel 2804 df-ral 3046 df-rex 3055 df-v 3452 df-un 3922 df-ss 3934 df-sn 4593 df-iun 4960 df-suc 6341 |
| This theorem is referenced by: pwsdompw 10163 |
| Copyright terms: Public domain | W3C validator |