| 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 6446. (Revised by BJ, 28-Dec-2024.) |
| Ref | Expression |
|---|---|
| unisucg | ⊢ (𝐴 ∈ 𝑉 → (Tr 𝐴 ↔ ∪ suc 𝐴 = 𝐴)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ssequn1 4139 | . . 3 ⊢ (∪ 𝐴 ⊆ 𝐴 ↔ (∪ 𝐴 ∪ 𝐴) = 𝐴) | |
| 2 | 1 | a1i 11 | . 2 ⊢ (𝐴 ∈ 𝑉 → (∪ 𝐴 ⊆ 𝐴 ↔ (∪ 𝐴 ∪ 𝐴) = 𝐴)) |
| 3 | df-tr 5221 | . . 3 ⊢ (Tr 𝐴 ↔ ∪ 𝐴 ⊆ 𝐴) | |
| 4 | 3 | a1i 11 | . 2 ⊢ (𝐴 ∈ 𝑉 → (Tr 𝐴 ↔ ∪ 𝐴 ⊆ 𝐴)) |
| 5 | unisucs 6444 | . . 3 ⊢ (𝐴 ∈ 𝑉 → ∪ suc 𝐴 = (∪ 𝐴 ∪ 𝐴)) | |
| 6 | 5 | eqeq1d 2767 | . 2 ⊢ (𝐴 ∈ 𝑉 → (∪ suc 𝐴 = 𝐴 ↔ (∪ 𝐴 ∪ 𝐴) = 𝐴)) |
| 7 | 2, 4, 6 | 3bitr4d 314 | 1 ⊢ (𝐴 ∈ 𝑉 → (Tr 𝐴 ↔ ∪ suc 𝐴 = 𝐴)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 = wceq 1570 ∈ wcel 2146 ∪ cun 3904 ⊆ wss 3906 ∪ cuni 4874 Tr wtr 5220 suc csuc 6366 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2148 ax-9 2156 ax-ext 2737 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-tru 1573 df-ex 1813 df-sb 2100 df-clab 2744 df-cleq 2757 df-clel 2840 df-v 3459 df-un 3911 df-ss 3923 df-sn 4592 df-pr 4594 df-uni 4875 df-tr 5221 df-suc 6370 |
| This theorem is used by: unisuc 6446 onunisuc 6477 |
| Copyright terms: Public domain | W3C validator |