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 6273 | . . . . . . . 8 ⊢ ((Ord 𝐶 ∧ 𝐵 ∈ 𝐶) → Ord 𝐵) | |
2 | 1 | ex 412 | . . . . . . 7 ⊢ (Ord 𝐶 → (𝐵 ∈ 𝐶 → Ord 𝐵)) |
3 | 2 | ancld 550 | . . . . . 6 ⊢ (Ord 𝐶 → (𝐵 ∈ 𝐶 → (𝐵 ∈ 𝐶 ∧ Ord 𝐵))) |
4 | 3 | anc2li 555 | . . . . 5 ⊢ (Ord 𝐶 → (𝐵 ∈ 𝐶 → (Ord 𝐶 ∧ (𝐵 ∈ 𝐶 ∧ Ord 𝐵)))) |
5 | ordelpss 6279 | . . . . . . . . . 10 ⊢ ((Ord 𝐵 ∧ Ord 𝐶) → (𝐵 ∈ 𝐶 ↔ 𝐵 ⊊ 𝐶)) | |
6 | sspsstr 4036 | . . . . . . . . . . 11 ⊢ ((𝐴 ⊆ 𝐵 ∧ 𝐵 ⊊ 𝐶) → 𝐴 ⊊ 𝐶) | |
7 | 6 | expcom 413 | . . . . . . . . . 10 ⊢ (𝐵 ⊊ 𝐶 → (𝐴 ⊆ 𝐵 → 𝐴 ⊊ 𝐶)) |
8 | 5, 7 | syl6bi 252 | . . . . . . . . 9 ⊢ ((Ord 𝐵 ∧ Ord 𝐶) → (𝐵 ∈ 𝐶 → (𝐴 ⊆ 𝐵 → 𝐴 ⊊ 𝐶))) |
9 | 8 | expcom 413 | . . . . . . . 8 ⊢ (Ord 𝐶 → (Ord 𝐵 → (𝐵 ∈ 𝐶 → (𝐴 ⊆ 𝐵 → 𝐴 ⊊ 𝐶)))) |
10 | 9 | com23 86 | . . . . . . 7 ⊢ (Ord 𝐶 → (𝐵 ∈ 𝐶 → (Ord 𝐵 → (𝐴 ⊆ 𝐵 → 𝐴 ⊊ 𝐶)))) |
11 | 10 | imp32 418 | . . . . . 6 ⊢ ((Ord 𝐶 ∧ (𝐵 ∈ 𝐶 ∧ Ord 𝐵)) → (𝐴 ⊆ 𝐵 → 𝐴 ⊊ 𝐶)) |
12 | 11 | com12 32 | . . . . 5 ⊢ (𝐴 ⊆ 𝐵 → ((Ord 𝐶 ∧ (𝐵 ∈ 𝐶 ∧ Ord 𝐵)) → 𝐴 ⊊ 𝐶)) |
13 | 4, 12 | syl9 77 | . . . 4 ⊢ (Ord 𝐶 → (𝐴 ⊆ 𝐵 → (𝐵 ∈ 𝐶 → 𝐴 ⊊ 𝐶))) |
14 | 13 | impd 410 | . . 3 ⊢ (Ord 𝐶 → ((𝐴 ⊆ 𝐵 ∧ 𝐵 ∈ 𝐶) → 𝐴 ⊊ 𝐶)) |
15 | 14 | adantl 481 | . 2 ⊢ ((Ord 𝐴 ∧ Ord 𝐶) → ((𝐴 ⊆ 𝐵 ∧ 𝐵 ∈ 𝐶) → 𝐴 ⊊ 𝐶)) |
16 | ordelpss 6279 | . 2 ⊢ ((Ord 𝐴 ∧ Ord 𝐶) → (𝐴 ∈ 𝐶 ↔ 𝐴 ⊊ 𝐶)) | |
17 | 15, 16 | sylibrd 258 | 1 ⊢ ((Ord 𝐴 ∧ Ord 𝐶) → ((𝐴 ⊆ 𝐵 ∧ 𝐵 ∈ 𝐶) → 𝐴 ∈ 𝐶)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 395 ∈ wcel 2108 ⊆ wss 3883 ⊊ wpss 3884 Ord word 6250 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1799 ax-4 1813 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2110 ax-9 2118 ax-11 2156 ax-ext 2709 ax-sep 5218 ax-nul 5225 ax-pr 5347 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 844 df-3or 1086 df-3an 1087 df-tru 1542 df-fal 1552 df-ex 1784 df-sb 2069 df-clab 2716 df-cleq 2730 df-clel 2817 df-ne 2943 df-ral 3068 df-rex 3069 df-rab 3072 df-v 3424 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-pss 3902 df-nul 4254 df-if 4457 df-pw 4532 df-sn 4559 df-pr 4561 df-op 4565 df-uni 4837 df-br 5071 df-opab 5133 df-tr 5188 df-eprel 5486 df-po 5494 df-so 5495 df-fr 5535 df-we 5537 df-ord 6254 |
This theorem is referenced by: ontr2 6298 ordelinel 6349 smogt 8169 smorndom 8170 nnarcl 8409 nnawordex 8430 coftr 9960 noetasuplem4 33866 noetainflem4 33870 hfuni 34413 |
Copyright terms: Public domain | W3C validator |