ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  unisucg GIF version

Theorem unisucg 4559
Description: A transitive class is equal to the union of its successor. Combines Theorem 4E of [Enderton] p. 72 and Exercise 6 of [Enderton] p. 73. (Contributed by Jim Kingdon, 18-Aug-2019.)
Assertion
Ref Expression
unisucg (𝐴 ∈ 𝑉 → (Tr 𝐴 ↔ ∪ suc 𝐴 = 𝐴))

Proof of Theorem unisucg
StepHypRef Expression
1 df-tr 4230 . . 3 (Tr 𝐴 ↔ ∪ 𝐴 ⊆ 𝐴)
2 ssequn1 3399 . . 3 (∪ 𝐴 ⊆ 𝐴 ↔ (∪ 𝐴 ∪ 𝐴) = 𝐴)
31, 2bitri 184 . 2 (Tr 𝐴 ↔ (∪ 𝐴 ∪ 𝐴) = 𝐴)
4 df-suc 4516 . . . . . 6 suc 𝐴 = (𝐴 ∪ {𝐴})
54unieqi 3945 . . . . 5 ∪ suc 𝐴 = ∪ (𝐴 ∪ {𝐴})
6 uniun 3954 . . . . 5 ∪ (𝐴 ∪ {𝐴}) = (∪ 𝐴 ∪ ∪ {𝐴})
75, 6eqtri 2259 . . . 4 ∪ suc 𝐴 = (∪ 𝐴 ∪ ∪ {𝐴})
8 unisng 3952 . . . . 5 (𝐴 ∈ 𝑉 → ∪ {𝐴} = 𝐴)
98uneq2d 3383 . . . 4 (𝐴 ∈ 𝑉 → (∪ 𝐴 ∪ ∪ {𝐴}) = (∪ 𝐴 ∪ 𝐴))
107, 9eqtrid 2283 . . 3 (𝐴 ∈ 𝑉 → ∪ suc 𝐴 = (∪ 𝐴 ∪ 𝐴))
1110eqeq1d 2247 . 2 (𝐴 ∈ 𝑉 → (∪ suc 𝐴 = 𝐴 ↔ (∪ 𝐴 ∪ 𝐴) = 𝐴))
123, 11bitr4id 199 1 (𝐴 ∈ 𝑉 → (Tr 𝐴 ↔ ∪ suc 𝐴 = 𝐴))
Colors of variables:    wff set class
This proof depends on syntax axioms:   → wi 4   ↔ wb 105   = wceq 1402   ∈ wcel 2209   ∪ cun 3218   ⊆ wss 3220  {csn 3709  ∪ cuni 3935  Tr wtr 4229  suc csuc 4510
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-ext 2220
This proof depends on definitions:  df-bi 117  df-tru 1405  df-nf 1514  df-sb 1816  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-rex 2534  df-v 2823  df-un 3224  df-in 3226  df-ss 3233  df-sn 3715  df-pr 3716  df-uni 3936  df-tr 4230  df-suc 4516
This theorem is used by:  onsucuni2  4711  nlimsucg  4713  ctmlemr  7449  nnnninfeq2  7470  nnsf  17214  peano4nninf  17215  nnnninfex  17231
  Copyright terms: Public domain W3C validator