Theorem onsucsssucr 4510

Description: The subclass relationship between two ordinals is inherited by their predecessors. The converse implies excluded middle, as shown at onsucsssucexmid 4528. (Contributed by Mario Carneiro and Jim Kingdon, 29-Jul-2019.)

Assertion

Ref	Expression
onsucsssucr	⊢ ((𝐴 ∈ On ∧ Ord 𝐵) → (suc 𝐴 ⊆ suc 𝐵 → 𝐴 ⊆ 𝐵))

Proof of Theorem onsucsssucr

Step	Hyp	Ref	Expression
1		ordsucim 4501	. . 3 ⊢ (Ord 𝐵 → Ord suc 𝐵)
2		ordelsuc 4506	. . 3 ⊢ ((𝐴 ∈ On ∧ Ord suc 𝐵) → (𝐴 ∈ suc 𝐵 ↔ suc 𝐴 ⊆ suc 𝐵))
3	1, 2	sylan2 286	. 2 ⊢ ((𝐴 ∈ On ∧ Ord 𝐵) → (𝐴 ∈ suc 𝐵 ↔ suc 𝐴 ⊆ suc 𝐵))
4		ordtr 4380	. . . 4 ⊢ (Ord 𝐵 → Tr 𝐵)
5		trsucss 4425	. . . 4 ⊢ (Tr 𝐵 → (𝐴 ∈ suc 𝐵 → 𝐴 ⊆ 𝐵))
6	4, 5	syl 14	. . 3 ⊢ (Ord 𝐵 → (𝐴 ∈ suc 𝐵 → 𝐴 ⊆ 𝐵))
7	6	adantl 277	. 2 ⊢ ((𝐴 ∈ On ∧ Ord 𝐵) → (𝐴 ∈ suc 𝐵 → 𝐴 ⊆ 𝐵))
8	3, 7	sylbird 170	1 ⊢ ((𝐴 ∈ On ∧ Ord 𝐵) → (suc 𝐴 ⊆ suc 𝐵 → 𝐴 ⊆ 𝐵))

Syntax hints:   → wi 4   ∧ wa 104   ↔ wb 105   ∈ wcel 2148   ⊆ wss 3131  Tr wtr 4103  Ord word 4364  Oncon0 4365  suc csuc 4367

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 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-ext 2159

This theorem depends on definitions:  df-bi 117  df-tru 1356  df-nf 1461  df-sb 1763  df-clab 2164  df-cleq 2170  df-clel 2173  df-nfc 2308  df-ral 2460  df-rex 2461  df-v 2741  df-un 3135  df-in 3137  df-ss 3144  df-sn 3600  df-uni 3812  df-tr 4104  df-iord 4368  df-suc 4373

This theorem is referenced by:  nnsucsssuc  6496