Users' Mathboxes Mathbox for Richard Penner < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  oneptr Structured version   Visualization version   GIF version

Theorem oneptr 43796
Description: The strict order on the ordinals is transitive. Theorem 1.9(ii) of [Schloeder] p. 1. (Contributed by RP, 15-Jan-2025.)
Assertion
Ref Expression
oneptr ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ On) → ((𝐴 E 𝐵𝐵 E 𝐶) → 𝐴 E 𝐶))

Proof of Theorem oneptr
StepHypRef Expression
1 epweon 7754 . 2 E We On
2 weso 5636 . 2 ( E We On → E Or On)
3 sopo 5572 . . 3 ( E Or On → E Po On)
4 potr 5566 . . . 4 (( E Po On ∧ (𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ On)) → ((𝐴 E 𝐵𝐵 E 𝐶) → 𝐴 E 𝐶))
54ex 416 . . 3 ( E Po On → ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ On) → ((𝐴 E 𝐵𝐵 E 𝐶) → 𝐴 E 𝐶)))
63, 5syl 17 . 2 ( E Or On → ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ On) → ((𝐴 E 𝐵𝐵 E 𝐶) → 𝐴 E 𝐶)))
71, 2, 6mp2b 10 1 ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ On) → ((𝐴 E 𝐵𝐵 E 𝐶) → 𝐴 E 𝐶))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 399  w3a 1097  wcel 2141   class class class wbr 5099   E cep 5544   Po wpo 5551   Or wor 5552   We wwe 5597  Oncon0 6342
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1814  ax-4 1828  ax-5 1929  ax-6 1986  ax-7 2027  ax-8 2143  ax-9 2151  ax-ext 2733  ax-sep 5245  ax-pr 5389
This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3or 1098  df-3an 1099  df-tru 1562  df-fal 1572  df-ex 1799  df-sb 2090  df-clab 2740  df-cleq 2753  df-clel 2836  df-ne 2957  df-ral 3076  df-rex 3086  df-rab 3414  df-v 3455  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-pss 3924  df-nul 4286  df-if 4480  df-pw 4556  df-sn 4582  df-pr 4584  df-op 4588  df-uni 4865  df-br 5100  df-opab 5162  df-tr 5207  df-eprel 5545  df-po 5553  df-so 5554  df-fr 5598  df-we 5600  df-ord 6345  df-on 6346
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator