Theorem ontr2 2259

Description: Transitive law for ordinal numbers. Exercise 3 of [TakeutiZaring] p. 40.

Assertion

Ref	Expression
ontr2	⊢ ((A ∈ On ∧ C ∈ On) → ((A ⊆ B ∧ B ∈ C) → A ∈ C))

Proof of Theorem ontr2

Step	Hyp	Ref	Expression
1		ordtr2 2257	. 2 ⊢ ((Ord A ∧ Ord C) → ((A ⊆ B ∧ B ∈ C) → A ∈ C))
2		eloni 2209	. 2 ⊢ (A ∈ On → Ord A)
3		eloni 2209	. 2 ⊢ (C ∈ On → Ord C)
4	1, 2, 3	syl2an 349	1 ⊢ ((A ∈ On ∧ C ∈ On) → ((A ⊆ B ∧ B ∈ C) → A ∈ C))

Syntax hints:   → wi 2   ∧ wa 196   ∈ wcel 1092   ⊆ wss 1487  Ord word 2198  Oncon0 2199

This theorem is referenced by:  alephle 3689

This theorem was proved from axioms:  ax-1 3  ax-2 4  ax-3 5  ax-mp 6  ax-4 673  ax-5 674  ax-6 675  ax-7 676  ax-gen 677  ax-8 798  ax-9 799  ax-10 800  ax-11 801  ax-12 802  ax-13 804  ax-14 805  ax-16 922  ax-17 925  ax-ext 1074  ax-rep 1075  ax-pow 1077

This theorem depends on definitions:  df-bi 128  df-or 197  df-an 198  df-3or 582  df-3an 583  df-ex 679  df-sb 853  df-clab 1093  df-cleq 1097  df-clel 1099  df-ral 1205  df-rex 1206  df-v 1349  df-dif 1489  df-un 1490  df-in 1491  df-ss 1492  df-nul 1708  df-pw 1799  df-sn 1811  df-pr 1812  df-op 1815  df-uni 1920  df-tr 2042  df-br 2063  df-opab 2098  df-eprel 2122  df-po 2128  df-so 2138  df-fr 2169  df-we 2186  df-ord 2202  df-on 2203

metamath.org