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

Theorem unisuc 6447
Description: A transitive class is equal to the union of its successor, inference form. Combines Theorem 4E of [Enderton] p. 72 and Exercise 6 of [Enderton] p. 73. (Contributed by NM, 30-Aug-1993.)
Hypothesis
Ref Expression
unisuc.1 𝐴 ∈ V
Assertion
Ref Expression
unisuc (Tr 𝐴 ↔ ∪ suc 𝐴 = 𝐴)

Proof of Theorem unisuc
StepHypRef Expression
1 unisuc.1 . 2 𝐴 ∈ V
2 unisucg 6446 . 2 (𝐴 ∈ V → (Tr 𝐴 ↔ ∪ suc 𝐴 = 𝐴))
31, 2ax-mp 5 1 (Tr 𝐴 ↔ ∪ suc 𝐴 = 𝐴)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   ↔ wb 209   = wceq 1569   ∈ wcel 2144  Vcvv 3450  ∪ cuni 4866  Tr wtr 5211  suc csuc 6367
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-ext 2732
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-tru 1572  df-ex 1812  df-sb 2099  df-clab 2739  df-cleq 2752  df-clel 2835  df-v 3452  df-ss 3897  df-un 4150  df-sn 4585  df-pr 4587  df-uni 4867  df-tr 5212  df-suc 6371
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator