| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > ordsucss | GIF version | ||
| Description: The successor of an element of an ordinal class is a subset of it. (Contributed by NM, 21-Jun-1998.) |
| Ref | Expression |
|---|---|
| ordsucss | ⊢ (Ord 𝐵 → (𝐴 ∈ 𝐵 → suc 𝐴 ⊆ 𝐵)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ordtr 4498 | . 2 ⊢ (Ord 𝐵 → Tr 𝐵) | |
| 2 | trss 4216 | . . . . 5 ⊢ (Tr 𝐵 → (𝐴 ∈ 𝐵 → 𝐴 ⊆ 𝐵)) | |
| 3 | snssi 3837 | . . . . . 6 ⊢ (𝐴 ∈ 𝐵 → {𝐴} ⊆ 𝐵) | |
| 4 | 3 | a1i 9 | . . . . 5 ⊢ (Tr 𝐵 → (𝐴 ∈ 𝐵 → {𝐴} ⊆ 𝐵)) |
| 5 | 2, 4 | jcad 307 | . . . 4 ⊢ (Tr 𝐵 → (𝐴 ∈ 𝐵 → (𝐴 ⊆ 𝐵 ∧ {𝐴} ⊆ 𝐵))) |
| 6 | unss 3392 | . . . 4 ⊢ ((𝐴 ⊆ 𝐵 ∧ {𝐴} ⊆ 𝐵) ↔ (𝐴 ∪ {𝐴}) ⊆ 𝐵) | |
| 7 | 5, 6 | imbitrdi 161 | . . 3 ⊢ (Tr 𝐵 → (𝐴 ∈ 𝐵 → (𝐴 ∪ {𝐴}) ⊆ 𝐵)) |
| 8 | df-suc 4491 | . . . 4 ⊢ suc 𝐴 = (𝐴 ∪ {𝐴}) | |
| 9 | 8 | sseq1i 3263 | . . 3 ⊢ (suc 𝐴 ⊆ 𝐵 ↔ (𝐴 ∪ {𝐴}) ⊆ 𝐵) |
| 10 | 7, 9 | imbitrrdi 162 | . 2 ⊢ (Tr 𝐵 → (𝐴 ∈ 𝐵 → suc 𝐴 ⊆ 𝐵)) |
| 11 | 1, 10 | syl 14 | 1 ⊢ (Ord 𝐵 → (𝐴 ∈ 𝐵 → suc 𝐴 ⊆ 𝐵)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ∈ wcel 2203 ∪ cun 3208 ⊆ wss 3210 {csn 3688 Tr wtr 4207 Ord word 4482 suc csuc 4485 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-io 717 ax-5 1496 ax-7 1497 ax-gen 1498 ax-ie1 1542 ax-ie2 1543 ax-8 1553 ax-10 1554 ax-11 1555 ax-i12 1556 ax-bndl 1558 ax-4 1559 ax-17 1575 ax-i9 1579 ax-ial 1583 ax-i5r 1584 ax-ext 2214 |
| This theorem depends on definitions: df-bi 117 df-tru 1401 df-nf 1510 df-sb 1812 df-clab 2219 df-cleq 2225 df-clel 2228 df-nfc 2373 df-ral 2525 df-v 2814 df-un 3214 df-in 3216 df-ss 3223 df-sn 3694 df-uni 3914 df-tr 4208 df-iord 4486 df-suc 4491 |
| This theorem is referenced by: ordelsuc 4626 tfrlemibfn 6558 tfr1onlembfn 6574 tfrcllembfn 6587 sucinc2 6678 nndomo 7117 prarloclemn 7813 ennnfonelemhom 13158 ennnfonelemrn 13162 |
| Copyright terms: Public domain | W3C validator |