| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > iunsuc | 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 4461 | . . 3 ⊢ suc 𝐴 = (𝐴 ∪ {𝐴}) | |
| 2 | iuneq1 3977 | . . 3 ⊢ (suc 𝐴 = (𝐴 ∪ {𝐴}) → ∪ 𝑥 ∈ suc 𝐴𝐵 = ∪ 𝑥 ∈ (𝐴 ∪ {𝐴})𝐵) | |
| 3 | 1, 2 | ax-mp 5 | . 2 ⊢ ∪ 𝑥 ∈ suc 𝐴𝐵 = ∪ 𝑥 ∈ (𝐴 ∪ {𝐴})𝐵 |
| 4 | iunxun 4044 | . 2 ⊢ ∪ 𝑥 ∈ (𝐴 ∪ {𝐴})𝐵 = (∪ 𝑥 ∈ 𝐴 𝐵 ∪ ∪ 𝑥 ∈ {𝐴}𝐵) | |
| 5 | iunsuc.1 | . . . 4 ⊢ 𝐴 ∈ V | |
| 6 | iunsuc.2 | . . . 4 ⊢ (𝑥 = 𝐴 → 𝐵 = 𝐶) | |
| 7 | 5, 6 | iunxsn 4041 | . . 3 ⊢ ∪ 𝑥 ∈ {𝐴}𝐵 = 𝐶 |
| 8 | 7 | uneq2i 3355 | . 2 ⊢ (∪ 𝑥 ∈ 𝐴 𝐵 ∪ ∪ 𝑥 ∈ {𝐴}𝐵) = (∪ 𝑥 ∈ 𝐴 𝐵 ∪ 𝐶) |
| 9 | 3, 4, 8 | 3eqtri 2254 | 1 ⊢ ∪ 𝑥 ∈ suc 𝐴𝐵 = (∪ 𝑥 ∈ 𝐴 𝐵 ∪ 𝐶) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 = wceq 1395 ∈ wcel 2200 Vcvv 2799 ∪ cun 3195 {csn 3666 ∪ ciun 3964 suc csuc 4455 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-io 714 ax-5 1493 ax-7 1494 ax-gen 1495 ax-ie1 1539 ax-ie2 1540 ax-8 1550 ax-10 1551 ax-11 1552 ax-i12 1553 ax-bndl 1555 ax-4 1556 ax-17 1572 ax-i9 1576 ax-ial 1580 ax-i5r 1581 ax-ext 2211 |
| This theorem depends on definitions: df-bi 117 df-3an 1004 df-tru 1398 df-nf 1507 df-sb 1809 df-clab 2216 df-cleq 2222 df-clel 2225 df-nfc 2361 df-ral 2513 df-rex 2514 df-v 2801 df-sbc 3029 df-un 3201 df-in 3203 df-ss 3210 df-sn 3672 df-iun 3966 df-suc 4461 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |