Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > ordtr2 | Structured version Visualization version GIF version |
Description: Transitive law for ordinal classes. (Contributed by NM, 12-Dec-2004.) (Proof shortened by Andrew Salmon, 25-Jul-2011.) |
Ref | Expression |
---|---|
ordtr2 | ⊢ ((Ord 𝐴 ∧ Ord 𝐶) → ((𝐴 ⊆ 𝐵 ∧ 𝐵 ∈ 𝐶) → 𝐴 ∈ 𝐶)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | ordelord 5662 | . . . . . . . 8 ⊢ ((Ord 𝐶 ∧ 𝐵 ∈ 𝐶) → Ord 𝐵) | |
2 | 1 | ex 449 | . . . . . . 7 ⊢ (Ord 𝐶 → (𝐵 ∈ 𝐶 → Ord 𝐵)) |
3 | 2 | ancld 574 | . . . . . 6 ⊢ (Ord 𝐶 → (𝐵 ∈ 𝐶 → (𝐵 ∈ 𝐶 ∧ Ord 𝐵))) |
4 | 3 | anc2li 578 | . . . . 5 ⊢ (Ord 𝐶 → (𝐵 ∈ 𝐶 → (Ord 𝐶 ∧ (𝐵 ∈ 𝐶 ∧ Ord 𝐵)))) |
5 | ordelpss 5668 | . . . . . . . . . 10 ⊢ ((Ord 𝐵 ∧ Ord 𝐶) → (𝐵 ∈ 𝐶 ↔ 𝐵 ⊊ 𝐶)) | |
6 | sspsstr 3674 | . . . . . . . . . . 11 ⊢ ((𝐴 ⊆ 𝐵 ∧ 𝐵 ⊊ 𝐶) → 𝐴 ⊊ 𝐶) | |
7 | 6 | expcom 450 | . . . . . . . . . 10 ⊢ (𝐵 ⊊ 𝐶 → (𝐴 ⊆ 𝐵 → 𝐴 ⊊ 𝐶)) |
8 | 5, 7 | syl6bi 242 | . . . . . . . . 9 ⊢ ((Ord 𝐵 ∧ Ord 𝐶) → (𝐵 ∈ 𝐶 → (𝐴 ⊆ 𝐵 → 𝐴 ⊊ 𝐶))) |
9 | 8 | expcom 450 | . . . . . . . 8 ⊢ (Ord 𝐶 → (Ord 𝐵 → (𝐵 ∈ 𝐶 → (𝐴 ⊆ 𝐵 → 𝐴 ⊊ 𝐶)))) |
10 | 9 | com23 84 | . . . . . . 7 ⊢ (Ord 𝐶 → (𝐵 ∈ 𝐶 → (Ord 𝐵 → (𝐴 ⊆ 𝐵 → 𝐴 ⊊ 𝐶)))) |
11 | 10 | imp32 448 | . . . . . 6 ⊢ ((Ord 𝐶 ∧ (𝐵 ∈ 𝐶 ∧ Ord 𝐵)) → (𝐴 ⊆ 𝐵 → 𝐴 ⊊ 𝐶)) |
12 | 11 | com12 32 | . . . . 5 ⊢ (𝐴 ⊆ 𝐵 → ((Ord 𝐶 ∧ (𝐵 ∈ 𝐶 ∧ Ord 𝐵)) → 𝐴 ⊊ 𝐶)) |
13 | 4, 12 | syl9 75 | . . . 4 ⊢ (Ord 𝐶 → (𝐴 ⊆ 𝐵 → (𝐵 ∈ 𝐶 → 𝐴 ⊊ 𝐶))) |
14 | 13 | impd 446 | . . 3 ⊢ (Ord 𝐶 → ((𝐴 ⊆ 𝐵 ∧ 𝐵 ∈ 𝐶) → 𝐴 ⊊ 𝐶)) |
15 | 14 | adantl 481 | . 2 ⊢ ((Ord 𝐴 ∧ Ord 𝐶) → ((𝐴 ⊆ 𝐵 ∧ 𝐵 ∈ 𝐶) → 𝐴 ⊊ 𝐶)) |
16 | ordelpss 5668 | . 2 ⊢ ((Ord 𝐴 ∧ Ord 𝐶) → (𝐴 ∈ 𝐶 ↔ 𝐴 ⊊ 𝐶)) | |
17 | 15, 16 | sylibrd 248 | 1 ⊢ ((Ord 𝐴 ∧ Ord 𝐶) → ((𝐴 ⊆ 𝐵 ∧ 𝐵 ∈ 𝐶) → 𝐴 ∈ 𝐶)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 383 ∈ wcel 1977 ⊆ wss 3540 ⊊ wpss 3541 Ord word 5639 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1713 ax-4 1728 ax-5 1827 ax-6 1875 ax-7 1922 ax-9 1986 ax-10 2006 ax-11 2021 ax-12 2034 ax-13 2234 ax-ext 2590 ax-sep 4709 ax-nul 4717 ax-pr 4833 |
This theorem depends on definitions: df-bi 196 df-or 384 df-an 385 df-3or 1032 df-3an 1033 df-tru 1478 df-ex 1696 df-nf 1701 df-sb 1868 df-eu 2462 df-mo 2463 df-clab 2597 df-cleq 2603 df-clel 2606 df-nfc 2740 df-ne 2782 df-ral 2901 df-rex 2902 df-rab 2905 df-v 3175 df-sbc 3403 df-dif 3543 df-un 3545 df-in 3547 df-ss 3554 df-pss 3556 df-nul 3875 df-if 4037 df-sn 4126 df-pr 4128 df-op 4132 df-uni 4373 df-br 4584 df-opab 4644 df-tr 4681 df-eprel 4949 df-po 4959 df-so 4960 df-fr 4997 df-we 4999 df-ord 5643 |
This theorem is referenced by: ordtr3OLD 5687 ontr2 5689 ordelinel 5742 ordelinelOLD 5743 smogt 7351 smorndom 7352 nnarcl 7583 nnawordex 7604 coftr 8978 nodenselem5 31084 hfuni 31461 |
Copyright terms: Public domain | W3C validator |