| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > unisucg | Structured version Visualization version GIF version | ||
| Description: A transitive class is equal to the union of its successor, closed form. Combines Theorem 4E of [Enderton] p. 72 and Exercise 6 of [Enderton] p. 73. (Contributed by NM, 30-Aug-1993.) Generalize from unisuc 6443. (Revised by BJ, 28-Dec-2024.) |
| Ref | Expression |
|---|---|
| unisucg | ⊢ (𝐴 ∈ 𝑉 → (Tr 𝐴 ↔ ∪ suc 𝐴 = 𝐴)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ssequn1 4147 | . . 3 ⊢ (∪ 𝐴 ⊆ 𝐴 ↔ (∪ 𝐴 ∪ 𝐴) = 𝐴) | |
| 2 | 1 | a1i 11 | . 2 ⊢ (𝐴 ∈ 𝑉 → (∪ 𝐴 ⊆ 𝐴 ↔ (∪ 𝐴 ∪ 𝐴) = 𝐴)) |
| 3 | df-tr 5223 | . . 3 ⊢ (Tr 𝐴 ↔ ∪ 𝐴 ⊆ 𝐴) | |
| 4 | 3 | a1i 11 | . 2 ⊢ (𝐴 ∈ 𝑉 → (Tr 𝐴 ↔ ∪ 𝐴 ⊆ 𝐴)) |
| 5 | unisucs 6441 | . . 3 ⊢ (𝐴 ∈ 𝑉 → ∪ suc 𝐴 = (∪ 𝐴 ∪ 𝐴)) | |
| 6 | 5 | eqeq1d 2771 | . 2 ⊢ (𝐴 ∈ 𝑉 → (∪ suc 𝐴 = 𝐴 ↔ (∪ 𝐴 ∪ 𝐴) = 𝐴)) |
| 7 | 2, 4, 6 | 3bitr4d 314 | 1 ⊢ (𝐴 ∈ 𝑉 → (Tr 𝐴 ↔ ∪ suc 𝐴 = 𝐴)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 209 = wceq 1567 ∈ wcel 2149 ∪ cun 3911 ⊆ wss 3913 ∪ cuni 4876 Tr wtr 5222 suc csuc 6363 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1822 ax-4 1836 ax-5 1937 ax-6 1994 ax-7 2035 ax-8 2151 ax-9 2159 ax-ext 2741 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-tru 1570 df-ex 1807 df-sb 2098 df-clab 2748 df-cleq 2761 df-clel 2844 df-v 3465 df-un 3918 df-ss 3930 df-sn 4595 df-pr 4597 df-uni 4877 df-tr 5223 df-suc 6367 |
| This theorem is referenced by: unisuc 6443 onunisuc 6474 |
| Copyright terms: Public domain | W3C validator |