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

Theorem ordsucim 4569
Description: The successor of an ordinal class is ordinal. (Contributed by Jim Kingdon, 8-Nov-2018.)
Assertion
Ref Expression
ordsucim (Ord 𝐴 → Ord suc 𝐴)

Proof of Theorem ordsucim
Dummy variable 𝑥 is distinct from all other variables.
StepHypRef Expression
1 ordtr 4446 . . 3 (Ord 𝐴 → Tr 𝐴)
2 suctr 4489 . . 3 (Tr 𝐴 → Tr suc 𝐴)
31, 2syl 14 . 2 (Ord 𝐴 → Tr suc 𝐴)
4 df-suc 4439 . . . . . 6 suc 𝐴 = (𝐴 ∪ {𝐴})
54eleq2i 2276 . . . . 5 (𝑥 ∈ suc 𝐴𝑥 ∈ (𝐴 ∪ {𝐴}))
6 elun 3325 . . . . 5 (𝑥 ∈ (𝐴 ∪ {𝐴}) ↔ (𝑥𝐴𝑥 ∈ {𝐴}))
7 velsn 3663 . . . . . 6 (𝑥 ∈ {𝐴} ↔ 𝑥 = 𝐴)
87orbi2i 766 . . . . 5 ((𝑥𝐴𝑥 ∈ {𝐴}) ↔ (𝑥𝐴𝑥 = 𝐴))
95, 6, 83bitri 206 . . . 4 (𝑥 ∈ suc 𝐴 ↔ (𝑥𝐴𝑥 = 𝐴))
10 dford3 4435 . . . . . . . 8 (Ord 𝐴 ↔ (Tr 𝐴 ∧ ∀𝑥𝐴 Tr 𝑥))
1110simprbi 275 . . . . . . 7 (Ord 𝐴 → ∀𝑥𝐴 Tr 𝑥)
12 df-ral 2493 . . . . . . 7 (∀𝑥𝐴 Tr 𝑥 ↔ ∀𝑥(𝑥𝐴 → Tr 𝑥))
1311, 12sylib 122 . . . . . 6 (Ord 𝐴 → ∀𝑥(𝑥𝐴 → Tr 𝑥))
141319.21bi 1584 . . . . 5 (Ord 𝐴 → (𝑥𝐴 → Tr 𝑥))
15 treq 4167 . . . . . 6 (𝑥 = 𝐴 → (Tr 𝑥 ↔ Tr 𝐴))
161, 15syl5ibrcom 157 . . . . 5 (Ord 𝐴 → (𝑥 = 𝐴 → Tr 𝑥))
1714, 16jaod 721 . . . 4 (Ord 𝐴 → ((𝑥𝐴𝑥 = 𝐴) → Tr 𝑥))
189, 17biimtrid 152 . . 3 (Ord 𝐴 → (𝑥 ∈ suc 𝐴 → Tr 𝑥))
1918ralrimiv 2582 . 2 (Ord 𝐴 → ∀𝑥 ∈ suc 𝐴Tr 𝑥)
20 dford3 4435 . 2 (Ord suc 𝐴 ↔ (Tr suc 𝐴 ∧ ∀𝑥 ∈ suc 𝐴Tr 𝑥))
213, 19, 20sylanbrc 417 1 (Ord 𝐴 → Ord suc 𝐴)
Colors of variables: wff set class
Syntax hints:  wi 4  wo 712  wal 1373   = wceq 1375  wcel 2180  wral 2488  cun 3175  {csn 3646  Tr wtr 4161  Ord word 4430  suc csuc 4433
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 713  ax-5 1473  ax-7 1474  ax-gen 1475  ax-ie1 1519  ax-ie2 1520  ax-8 1530  ax-10 1531  ax-11 1532  ax-i12 1533  ax-bndl 1535  ax-4 1536  ax-17 1552  ax-i9 1556  ax-ial 1560  ax-i5r 1561  ax-ext 2191
This theorem depends on definitions:  df-bi 117  df-tru 1378  df-nf 1487  df-sb 1789  df-clab 2196  df-cleq 2202  df-clel 2205  df-nfc 2341  df-ral 2493  df-rex 2494  df-v 2781  df-un 3181  df-in 3183  df-ss 3190  df-sn 3652  df-uni 3868  df-tr 4162  df-iord 4434  df-suc 4439
This theorem is referenced by:  onsuc  4570  ordsucg  4571  onsucsssucr  4578  ordtriexmidlem  4588  2ordpr  4593  ordsuc  4632  nnsucsssuc  6608
  Copyright terms: Public domain W3C validator