| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > unisuc | GIF version | ||
| Description: A transitive class is equal to the union of its successor. Combines Theorem 4E of [Enderton] p. 72 and Exercise 6 of [Enderton] p. 73. (Contributed by NM, 30-Aug-1993.) |
| Ref | Expression |
|---|---|
| unisuc.1 | ⊢ 𝐴 ∈ V |
| Ref | Expression |
|---|---|
| unisuc | ⊢ (Tr 𝐴 ↔ ∪ suc 𝐴 = 𝐴) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ssequn1 3377 | . 2 ⊢ (∪ 𝐴 ⊆ 𝐴 ↔ (∪ 𝐴 ∪ 𝐴) = 𝐴) | |
| 2 | df-tr 4188 | . 2 ⊢ (Tr 𝐴 ↔ ∪ 𝐴 ⊆ 𝐴) | |
| 3 | df-suc 4468 | . . . . 5 ⊢ suc 𝐴 = (𝐴 ∪ {𝐴}) | |
| 4 | 3 | unieqi 3903 | . . . 4 ⊢ ∪ suc 𝐴 = ∪ (𝐴 ∪ {𝐴}) |
| 5 | uniun 3912 | . . . 4 ⊢ ∪ (𝐴 ∪ {𝐴}) = (∪ 𝐴 ∪ ∪ {𝐴}) | |
| 6 | unisuc.1 | . . . . . 6 ⊢ 𝐴 ∈ V | |
| 7 | 6 | unisn 3909 | . . . . 5 ⊢ ∪ {𝐴} = 𝐴 |
| 8 | 7 | uneq2i 3358 | . . . 4 ⊢ (∪ 𝐴 ∪ ∪ {𝐴}) = (∪ 𝐴 ∪ 𝐴) |
| 9 | 4, 5, 8 | 3eqtri 2256 | . . 3 ⊢ ∪ suc 𝐴 = (∪ 𝐴 ∪ 𝐴) |
| 10 | 9 | eqeq1i 2239 | . 2 ⊢ (∪ suc 𝐴 = 𝐴 ↔ (∪ 𝐴 ∪ 𝐴) = 𝐴) |
| 11 | 1, 2, 10 | 3bitr4i 212 | 1 ⊢ (Tr 𝐴 ↔ ∪ suc 𝐴 = 𝐴) |
| Colors of variables: wff set class |
| Syntax hints: ↔ wb 105 = wceq 1397 ∈ wcel 2202 Vcvv 2802 ∪ cun 3198 ⊆ wss 3200 {csn 3669 ∪ cuni 3893 Tr wtr 4187 suc csuc 4462 |
| 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 716 ax-5 1495 ax-7 1496 ax-gen 1497 ax-ie1 1541 ax-ie2 1542 ax-8 1552 ax-10 1553 ax-11 1554 ax-i12 1555 ax-bndl 1557 ax-4 1558 ax-17 1574 ax-i9 1578 ax-ial 1582 ax-i5r 1583 ax-ext 2213 |
| This theorem depends on definitions: df-bi 117 df-tru 1400 df-nf 1509 df-sb 1811 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2363 df-rex 2516 df-v 2804 df-un 3204 df-in 3206 df-ss 3213 df-sn 3675 df-pr 3676 df-uni 3894 df-tr 4188 df-suc 4468 |
| This theorem is referenced by: onunisuci 4529 ordsucunielexmid 4629 tfrexlem 6499 nnsucuniel 6662 |
| Copyright terms: Public domain | W3C validator |