| 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 6366 | . . 3 ⊢ suc 𝐴 = (𝐴 ∪ {𝐴}) | |
| 2 | iuneq1 4973 | . . 3 ⊢ (suc 𝐴 = (𝐴 ∪ {𝐴}) → ∪ 𝑥 ∈ suc 𝐴𝐵 = ∪ 𝑥 ∈ (𝐴 ∪ {𝐴})𝐵) | |
| 3 | 1, 2 | ax-mp 5 | . 2 ⊢ ∪ 𝑥 ∈ suc 𝐴𝐵 = ∪ 𝑥 ∈ (𝐴 ∪ {𝐴})𝐵 |
| 4 | iunxun 5060 | . 2 ⊢ ∪ 𝑥 ∈ (𝐴 ∪ {𝐴})𝐵 = (∪ 𝑥 ∈ 𝐴 𝐵 ∪ ∪ 𝑥 ∈ {𝐴}𝐵) | |
| 5 | iunsuc.1 | . . . 4 ⊢ 𝐴 ∈ V | |
| 6 | iunsuc.2 | . . . 4 ⊢ (𝑥 = 𝐴 → 𝐵 = 𝐶) | |
| 7 | 5, 6 | iunxsn 5057 | . . 3 ⊢ ∪ 𝑥 ∈ {𝐴}𝐵 = 𝐶 |
| 8 | 7 | uneq2i 4119 | . 2 ⊢ (∪ 𝑥 ∈ 𝐴 𝐵 ∪ ∪ 𝑥 ∈ {𝐴}𝐵) = (∪ 𝑥 ∈ 𝐴 𝐵 ∪ 𝐶) |
| 9 | 3, 4, 8 | 3eqtri 2790 | 1 ⊢ ∪ 𝑥 ∈ suc 𝐴𝐵 = (∪ 𝑥 ∈ 𝐴 𝐵 ∪ 𝐶) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1570 ∈ wcel 2143 Vcvv 3455 ∪ cun 3903 {csn 4589 ∪ ciun 4956 suc csuc 6362 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-ext 2735 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-tru 1573 df-ex 1810 df-sb 2097 df-clab 2742 df-cleq 2755 df-clel 2838 df-ral 3080 df-rex 3090 df-v 3457 df-un 3910 df-ss 3922 df-sn 4590 df-iun 4958 df-suc 6366 |
| This theorem is referenced by: pwsdompw 10182 |
| Copyright terms: Public domain | W3C validator |