| 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 6387 | . . . . . . . 8 ⊢ ((Ord 𝐶 ∧ 𝐵 ∈ 𝐶) → Ord 𝐵) | |
| 2 | 1 | ex 418 | . . . . . . 7 ⊢ (Ord 𝐶 → (𝐵 ∈ 𝐶 → Ord 𝐵)) |
| 3 | 2 | ancld 560 | . . . . . 6 ⊢ (Ord 𝐶 → (𝐵 ∈ 𝐶 → (𝐵 ∈ 𝐶 ∧ Ord 𝐵))) |
| 4 | 3 | anc2li 565 | . . . . 5 ⊢ (Ord 𝐶 → (𝐵 ∈ 𝐶 → (Ord 𝐶 ∧ (𝐵 ∈ 𝐶 ∧ Ord 𝐵)))) |
| 5 | ordelpss 6393 | . . . . . . . . . 10 ⊢ ((Ord 𝐵 ∧ Ord 𝐶) → (𝐵 ∈ 𝐶 ↔ 𝐵 ⊊ 𝐶)) | |
| 6 | sspsstr 4035 | . . . . . . . . . . 11 ⊢ ((𝐴 ⊆ 𝐵 ∧ 𝐵 ⊊ 𝐶) → 𝐴 ⊊ 𝐶) | |
| 7 | 6 | expcom 419 | . . . . . . . . . 10 ⊢ (𝐵 ⊊ 𝐶 → (𝐴 ⊆ 𝐵 → 𝐴 ⊊ 𝐶)) |
| 8 | 5, 7 | biimtrdi 256 | . . . . . . . . 9 ⊢ ((Ord 𝐵 ∧ Ord 𝐶) → (𝐵 ∈ 𝐶 → (𝐴 ⊆ 𝐵 → 𝐴 ⊊ 𝐶))) |
| 9 | 8 | expcom 419 | . . . . . . . 8 ⊢ (Ord 𝐶 → (Ord 𝐵 → (𝐵 ∈ 𝐶 → (𝐴 ⊆ 𝐵 → 𝐴 ⊊ 𝐶)))) |
| 10 | 9 | com23 87 | . . . . . . 7 ⊢ (Ord 𝐶 → (𝐵 ∈ 𝐶 → (Ord 𝐵 → (𝐴 ⊆ 𝐵 → 𝐴 ⊊ 𝐶)))) |
| 11 | 10 | imp32 424 | . . . . . 6 ⊢ ((Ord 𝐶 ∧ (𝐵 ∈ 𝐶 ∧ Ord 𝐵)) → (𝐴 ⊆ 𝐵 → 𝐴 ⊊ 𝐶)) |
| 12 | 11 | com12 33 | . . . . 5 ⊢ (𝐴 ⊆ 𝐵 → ((Ord 𝐶 ∧ (𝐵 ∈ 𝐶 ∧ Ord 𝐵)) → 𝐴 ⊊ 𝐶)) |
| 13 | 4, 12 | syl9 78 | . . . 4 ⊢ (Ord 𝐶 → (𝐴 ⊆ 𝐵 → (𝐵 ∈ 𝐶 → 𝐴 ⊊ 𝐶))) |
| 14 | 13 | impd 416 | . . 3 ⊢ (Ord 𝐶 → ((𝐴 ⊆ 𝐵 ∧ 𝐵 ∈ 𝐶) → 𝐴 ⊊ 𝐶)) |
| 15 | 14 | adantl 487 | . 2 ⊢ ((Ord 𝐴 ∧ Ord 𝐶) → ((𝐴 ⊆ 𝐵 ∧ 𝐵 ∈ 𝐶) → 𝐴 ⊊ 𝐶)) |
| 16 | ordelpss 6393 | . 2 ⊢ ((Ord 𝐴 ∧ Ord 𝐶) → (𝐴 ∈ 𝐶 ↔ 𝐴 ⊊ 𝐶)) | |
| 17 | 15, 16 | sylibrd 262 | 1 ⊢ ((Ord 𝐴 ∧ Ord 𝐶) → ((𝐴 ⊆ 𝐵 ∧ 𝐵 ∈ 𝐶) → 𝐴 ∈ 𝐶)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 ∈ wcel 2144 ⊆ wss 3896 ⊊ wpss 4012 Ord word 6364 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-ext 2732 ax-sep 5248 ax-pr 5391 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-sb 2099 df-clab 2739 df-cleq 2752 df-clel 2835 df-ne 2956 df-ral 3077 df-rex 3087 df-rab 3413 df-v 3452 df-ss 3897 df-pss 4013 df-dif 4046 df-in 4090 df-un 4150 df-nul 4278 df-if 4482 df-pw 4558 df-sn 4585 df-pr 4587 df-op 4835 df-uni 4867 df-br 5103 df-opab 5167 df-tr 5212 df-eprel 5551 df-po 5559 df-so 5560 df-fr 5604 df-we 5606 df-ord 6368 |
| This theorem is used by: ontr2 6414 ordelinel 6469 smogt 8382 smocdmdom 8383 nnarcl 8632 nnawordex 8653 hfuniOLD 9932 coftr 10358 noetasuplem4 28102 noetainflem4 28106 addonbday 28674 z12bdaylem 28879 |
| Copyright terms: Public domain | W3C validator |