![]() |
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 6385 | . . . . 5 ⊢ ((Ord 𝐵 ∧ 𝐴 ∈ 𝐵) → Ord 𝐴) | |
2 | ordnbtwn 6456 | . . . . . . . 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 7803 | . . . . . . 7 ⊢ (Ord 𝐴 ↔ Ord suc 𝐴) | |
7 | ordtri1 6396 | . . . . . . 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 2104 ⊆ wss 3947 Ord word 6362 suc csuc 6365 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1911 ax-6 1969 ax-7 2009 ax-8 2106 ax-9 2114 ax-ext 2701 ax-sep 5298 ax-nul 5305 ax-pr 5426 |
This theorem depends on definitions: df-bi 206 df-an 395 df-or 844 df-3or 1086 df-3an 1087 df-tru 1542 df-fal 1552 df-ex 1780 df-sb 2066 df-clab 2708 df-cleq 2722 df-clel 2808 df-ne 2939 df-ral 3060 df-rex 3069 df-rab 3431 df-v 3474 df-dif 3950 df-un 3952 df-in 3954 df-ss 3964 df-pss 3966 df-nul 4322 df-if 4528 df-pw 4603 df-sn 4628 df-pr 4630 df-op 4634 df-uni 4908 df-br 5148 df-opab 5210 df-tr 5265 df-eprel 5579 df-po 5587 df-so 5588 df-fr 5630 df-we 5632 df-ord 6366 df-on 6367 df-suc 6369 |
This theorem is referenced by: ordelsuc 7810 ordsucelsuc 7812 orduniorsuc 7820 tfindsg2 7853 oaordi 8548 oawordeulem 8556 omeulem2 8585 oeworde 8595 oelimcl 8602 oeeui 8604 nnaordi 8620 nnawordex 8639 oaabs2 8650 omxpenlem 9075 inf3lem5 9629 cantnflt 9669 cantnflem1d 9685 cnfcom 9697 r1ordg 9775 rankr1ag 9799 cfslb2n 10265 cfsmolem 10267 fin23lem26 10322 isf32lem3 10352 ttukeylem7 10512 indpi 10904 nolesgn2ores 27411 nogesgn1ores 27413 nosupbday 27444 nosupres 27446 nosupbnd1lem1 27447 nosupbnd2 27455 noinfbday 27459 noinfres 27461 noinfbnd1lem1 27462 noinfbnd2 27470 onsucss 42318 omabs2 42384 onsucunifi 42422 nadd1suc 42444 |
Copyright terms: Public domain | W3C validator |