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 41937
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 7757 . 2 E We On
2 weso 5666 . 2 ( E We On → E Or On)
3 sopo 5606 . . 3 ( E Or On → E Po On)
4 potr 5600 . . . 4 (( E Po On ∧ (𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ On)) → ((𝐴 E 𝐵𝐵 E 𝐶) → 𝐴 E 𝐶))
54ex 414 . . 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 397  w3a 1088  wcel 2107   class class class wbr 5147   E cep 5578   Po wpo 5585   Or wor 5586   We wwe 5629  Oncon0 6361
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2109  ax-9 2117  ax-ext 2704  ax-sep 5298  ax-nul 5305  ax-pr 5426
This theorem depends on definitions:  df-bi 206  df-an 398  df-or 847  df-3or 1089  df-3an 1090  df-tru 1545  df-fal 1555  df-ex 1783  df-sb 2069  df-clab 2711  df-cleq 2725  df-clel 2811  df-ne 2942  df-ral 3063  df-rex 3072  df-rab 3434  df-v 3477  df-dif 3950  df-un 3952  df-in 3954  df-ss 3964  df-pss 3966  df-nul 4322  df-if 4528  df-pw 4603  df-sn 4628  df-pr 4630  df-op 4634  df-uni 4908  df-br 5148  df-opab 5210  df-tr 5265  df-eprel 5579  df-po 5587  df-so 5588  df-fr 5630  df-we 5632  df-ord 6364  df-on 6365
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator