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

Theorem suctr 4158
Description: The successor of a transitive class is transitive. (Contributed by Alan Sare, 11-Apr-2009.)
Assertion
Ref Expression
suctr (Tr 𝐴 → Tr suc 𝐴)

Proof of Theorem suctr
Dummy variables 𝑦 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 simpr 103 . . . . 5 ((𝑧𝑦𝑦 ∈ suc 𝐴) → 𝑦 ∈ suc 𝐴)
2 vex 2560 . . . . . 6 𝑦 ∈ V
32elsuc 4143 . . . . 5 (𝑦 ∈ suc 𝐴 ↔ (𝑦𝐴𝑦 = 𝐴))
41, 3sylib 127 . . . 4 ((𝑧𝑦𝑦 ∈ suc 𝐴) → (𝑦𝐴𝑦 = 𝐴))
5 simpl 102 . . . . . . 7 ((𝑧𝑦𝑦 ∈ suc 𝐴) → 𝑧𝑦)
6 eleq2 2101 . . . . . . 7 (𝑦 = 𝐴 → (𝑧𝑦𝑧𝐴))
75, 6syl5ibcom 144 . . . . . 6 ((𝑧𝑦𝑦 ∈ suc 𝐴) → (𝑦 = 𝐴𝑧𝐴))
8 elelsuc 4146 . . . . . 6 (𝑧𝐴𝑧 ∈ suc 𝐴)
97, 8syl6 29 . . . . 5 ((𝑧𝑦𝑦 ∈ suc 𝐴) → (𝑦 = 𝐴𝑧 ∈ suc 𝐴))
10 trel 3861 . . . . . . . . 9 (Tr 𝐴 → ((𝑧𝑦𝑦𝐴) → 𝑧𝐴))
1110expd 245 . . . . . . . 8 (Tr 𝐴 → (𝑧𝑦 → (𝑦𝐴𝑧𝐴)))
1211adantrd 264 . . . . . . 7 (Tr 𝐴 → ((𝑧𝑦𝑦 ∈ suc 𝐴) → (𝑦𝐴𝑧𝐴)))
1312, 8syl8 65 . . . . . 6 (Tr 𝐴 → ((𝑧𝑦𝑦 ∈ suc 𝐴) → (𝑦𝐴𝑧 ∈ suc 𝐴)))
14 jao 672 . . . . . 6 ((𝑦𝐴𝑧 ∈ suc 𝐴) → ((𝑦 = 𝐴𝑧 ∈ suc 𝐴) → ((𝑦𝐴𝑦 = 𝐴) → 𝑧 ∈ suc 𝐴)))
1513, 14syl6 29 . . . . 5 (Tr 𝐴 → ((𝑧𝑦𝑦 ∈ suc 𝐴) → ((𝑦 = 𝐴𝑧 ∈ suc 𝐴) → ((𝑦𝐴𝑦 = 𝐴) → 𝑧 ∈ suc 𝐴))))
169, 15mpdi 38 . . . 4 (Tr 𝐴 → ((𝑧𝑦𝑦 ∈ suc 𝐴) → ((𝑦𝐴𝑦 = 𝐴) → 𝑧 ∈ suc 𝐴)))
174, 16mpdi 38 . . 3 (Tr 𝐴 → ((𝑧𝑦𝑦 ∈ suc 𝐴) → 𝑧 ∈ suc 𝐴))
1817alrimivv 1755 . 2 (Tr 𝐴 → ∀𝑧𝑦((𝑧𝑦𝑦 ∈ suc 𝐴) → 𝑧 ∈ suc 𝐴))
19 dftr2 3856 . 2 (Tr suc 𝐴 ↔ ∀𝑧𝑦((𝑧𝑦𝑦 ∈ suc 𝐴) → 𝑧 ∈ suc 𝐴))
2018, 19sylibr 137 1 (Tr 𝐴 → Tr suc 𝐴)
Colors of variables: wff set class
Syntax hints:  wi 4  wa 97  wo 629  wal 1241   = wceq 1243  wcel 1393  Tr wtr 3854  suc csuc 4102
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 99  ax-ia2 100  ax-ia3 101  ax-io 630  ax-5 1336  ax-7 1337  ax-gen 1338  ax-ie1 1382  ax-ie2 1383  ax-8 1395  ax-10 1396  ax-11 1397  ax-i12 1398  ax-bndl 1399  ax-4 1400  ax-17 1419  ax-i9 1423  ax-ial 1427  ax-i5r 1428  ax-ext 2022
This theorem depends on definitions:  df-bi 110  df-tru 1246  df-nf 1350  df-sb 1646  df-clab 2027  df-cleq 2033  df-clel 2036  df-nfc 2167  df-v 2559  df-un 2922  df-in 2924  df-ss 2931  df-sn 3381  df-uni 3581  df-tr 3855  df-suc 4108
This theorem is referenced by:  ordsucim  4226  ordom  4329
  Copyright terms: Public domain W3C validator