![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > ordsucss | Structured version Visualization version GIF version |
Description: The successor of an element of an ordinal class is a subset of it. Lemma 1.14 of [Schloeder] p. 2. (Contributed by NM, 21-Jun-1998.) |
Ref | Expression |
---|---|
ordsucss | ⊢ (Ord 𝐵 → (𝐴 ∈ 𝐵 → suc 𝐴 ⊆ 𝐵)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | ordelord 6396 | . . . . 5 ⊢ ((Ord 𝐵 ∧ 𝐴 ∈ 𝐵) → Ord 𝐴) | |
2 | ordnbtwn 6467 | . . . . . . . 8 ⊢ (Ord 𝐴 → ¬ (𝐴 ∈ 𝐵 ∧ 𝐵 ∈ suc 𝐴)) | |
3 | imnan 398 | . . . . . . . 8 ⊢ ((𝐴 ∈ 𝐵 → ¬ 𝐵 ∈ suc 𝐴) ↔ ¬ (𝐴 ∈ 𝐵 ∧ 𝐵 ∈ suc 𝐴)) | |
4 | 2, 3 | sylibr 233 | . . . . . . 7 ⊢ (Ord 𝐴 → (𝐴 ∈ 𝐵 → ¬ 𝐵 ∈ suc 𝐴)) |
5 | 4 | adantr 479 | . . . . . 6 ⊢ ((Ord 𝐴 ∧ Ord 𝐵) → (𝐴 ∈ 𝐵 → ¬ 𝐵 ∈ suc 𝐴)) |
6 | ordsuc 7824 | . . . . . . 7 ⊢ (Ord 𝐴 ↔ Ord suc 𝐴) | |
7 | ordtri1 6407 | . . . . . . 7 ⊢ ((Ord suc 𝐴 ∧ Ord 𝐵) → (suc 𝐴 ⊆ 𝐵 ↔ ¬ 𝐵 ∈ suc 𝐴)) | |
8 | 6, 7 | sylanb 579 | . . . . . 6 ⊢ ((Ord 𝐴 ∧ Ord 𝐵) → (suc 𝐴 ⊆ 𝐵 ↔ ¬ 𝐵 ∈ suc 𝐴)) |
9 | 5, 8 | sylibrd 258 | . . . . 5 ⊢ ((Ord 𝐴 ∧ Ord 𝐵) → (𝐴 ∈ 𝐵 → suc 𝐴 ⊆ 𝐵)) |
10 | 1, 9 | sylan 578 | . . . 4 ⊢ (((Ord 𝐵 ∧ 𝐴 ∈ 𝐵) ∧ Ord 𝐵) → (𝐴 ∈ 𝐵 → suc 𝐴 ⊆ 𝐵)) |
11 | 10 | exp31 418 | . . 3 ⊢ (Ord 𝐵 → (𝐴 ∈ 𝐵 → (Ord 𝐵 → (𝐴 ∈ 𝐵 → suc 𝐴 ⊆ 𝐵)))) |
12 | 11 | pm2.43b 55 | . 2 ⊢ (𝐴 ∈ 𝐵 → (Ord 𝐵 → (𝐴 ∈ 𝐵 → suc 𝐴 ⊆ 𝐵))) |
13 | 12 | pm2.43b 55 | 1 ⊢ (Ord 𝐵 → (𝐴 ∈ 𝐵 → suc 𝐴 ⊆ 𝐵)) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ↔ wb 205 ∧ wa 394 ∈ wcel 2098 ⊆ wss 3949 Ord word 6373 suc csuc 6376 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1789 ax-4 1803 ax-5 1905 ax-6 1963 ax-7 2003 ax-8 2100 ax-9 2108 ax-ext 2699 ax-sep 5303 ax-nul 5310 ax-pr 5433 |
This theorem depends on definitions: df-bi 206 df-an 395 df-or 846 df-3or 1085 df-3an 1086 df-tru 1536 df-fal 1546 df-ex 1774 df-sb 2060 df-clab 2706 df-cleq 2720 df-clel 2806 df-ne 2938 df-ral 3059 df-rex 3068 df-rab 3431 df-v 3475 df-dif 3952 df-un 3954 df-in 3956 df-ss 3966 df-pss 3968 df-nul 4327 df-if 4533 df-pw 4608 df-sn 4633 df-pr 4635 df-op 4639 df-uni 4913 df-br 5153 df-opab 5215 df-tr 5270 df-eprel 5586 df-po 5594 df-so 5595 df-fr 5637 df-we 5639 df-ord 6377 df-on 6378 df-suc 6380 |
This theorem is referenced by: ordelsuc 7831 ordsucelsuc 7833 orduniorsuc 7841 tfindsg2 7874 oaordi 8575 oawordeulem 8583 omeulem2 8612 oeworde 8622 oelimcl 8629 oeeui 8631 nnaordi 8647 nnawordex 8666 oaabs2 8678 omxpenlem 9106 inf3lem5 9665 cantnflt 9705 cantnflem1d 9721 cnfcom 9733 r1ordg 9811 rankr1ag 9835 cfslb2n 10301 cfsmolem 10303 fin23lem26 10358 isf32lem3 10388 ttukeylem7 10548 indpi 10940 nolesgn2ores 27633 nogesgn1ores 27635 nosupbday 27666 nosupres 27668 nosupbnd1lem1 27669 nosupbnd2 27677 noinfbday 27681 noinfres 27683 noinfbnd1lem1 27684 noinfbnd2 27692 onsucss 42744 omabs2 42810 onsucunifi 42848 nadd1suc 42870 |
Copyright terms: Public domain | W3C validator |