MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  unisucg Structured version   Visualization version   GIF version

Theorem unisucg 6443
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 6444. (Revised by BJ, 28-Dec-2024.)
Assertion
Ref Expression
unisucg (𝐴 ∈ 𝑉 → (Tr 𝐴 ↔ ∪ suc 𝐴 = 𝐴))

Proof of Theorem unisucg
StepHypRef Expression
1 ssequn1 4132 . . 3 (∪ 𝐴 ⊆ 𝐴 ↔ (∪ 𝐴 ∪ 𝐴) = 𝐴)
21a1i 11 . 2 (𝐴 ∈ 𝑉 → (∪ 𝐴 ⊆ 𝐴 ↔ (∪ 𝐴 ∪ 𝐴) = 𝐴))
3 df-tr 5213 . . 3 (Tr 𝐴 ↔ ∪ 𝐴 ⊆ 𝐴)
43a1i 11 . 2 (𝐴 ∈ 𝑉 → (Tr 𝐴 ↔ ∪ 𝐴 ⊆ 𝐴))
5 unisucs 6442 . . 3 (𝐴 ∈ 𝑉 → ∪ suc 𝐴 = (∪ 𝐴 ∪ 𝐴))
65eqeq1d 2763 . 2 (𝐴 ∈ 𝑉 → (∪ suc 𝐴 = 𝐴 ↔ (∪ 𝐴 ∪ 𝐴) = 𝐴))
72, 4, 63bitr4d 314 1 (𝐴 ∈ 𝑉 → (Tr 𝐴 ↔ ∪ suc 𝐴 = 𝐴))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   = wceq 1570   ∈ wcel 2145   ∪ cun 3897   ⊆ wss 3899  ∪ cuni 4867  Tr wtr 5212  suc csuc 6364
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 2147  ax-9 2155  ax-ext 2733
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 2740  df-cleq 2753  df-clel 2836  df-v 3453  df-un 3904  df-ss 3916  df-sn 4585  df-pr 4587  df-uni 4868  df-tr 5213  df-suc 6368
This theorem is used by:  unisuc  6444  onunisuc  6475
  Copyright terms: Public domain W3C validator