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

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

Proof of Theorem unisucg
StepHypRef Expression
1 ssequn1 4187 . . 3 (∪ 𝐴 ⊆ 𝐴 ↔ (∪ 𝐴 ∪ 𝐴) = 𝐴)
21a1i 11 . 2 (𝐴 ∈ 𝑉 → (∪ 𝐴 ⊆ 𝐴 ↔ (∪ 𝐴 ∪ 𝐴) = 𝐴))
3 df-tr 5219 . . 3 (Tr 𝐴 ↔ ∪ 𝐴 ⊆ 𝐴)
43a1i 11 . 2 (𝐴 ∈ 𝑉 → (Tr 𝐴 ↔ ∪ 𝐴 ⊆ 𝐴))
5 unisucs 6468 . . 3 (𝐴 ∈ 𝑉 → ∪ suc 𝐴 = (∪ 𝐴 ∪ 𝐴))
65eqeq1d 2765 . 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 2147   ⊆ wss 3900   ∪ cun 4152  ∪ cuni 4872  Tr wtr 5218  suc csuc 6390
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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-ext 2735
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-tru 1573  df-ex 1813  df-sb 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-v 3456  df-ss 3901  df-un 4154  df-sn 4589  df-pr 4591  df-uni 4873  df-tr 5219  df-suc 6394
This theorem is used by:  unisuc  6470  onunisuc  6501
  Copyright terms: Public domain W3C validator