![]() |
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 4410 | . 2 ⊢ (Ord 𝐵 → Tr 𝐵) | |
2 | trss 4137 | . . . . 5 ⊢ (Tr 𝐵 → (𝐴 ∈ 𝐵 → 𝐴 ⊆ 𝐵)) | |
3 | snssi 3763 | . . . . . 6 ⊢ (𝐴 ∈ 𝐵 → {𝐴} ⊆ 𝐵) | |
4 | 3 | a1i 9 | . . . . 5 ⊢ (Tr 𝐵 → (𝐴 ∈ 𝐵 → {𝐴} ⊆ 𝐵)) |
5 | 2, 4 | jcad 307 | . . . 4 ⊢ (Tr 𝐵 → (𝐴 ∈ 𝐵 → (𝐴 ⊆ 𝐵 ∧ {𝐴} ⊆ 𝐵))) |
6 | unss 3334 | . . . 4 ⊢ ((𝐴 ⊆ 𝐵 ∧ {𝐴} ⊆ 𝐵) ↔ (𝐴 ∪ {𝐴}) ⊆ 𝐵) | |
7 | 5, 6 | imbitrdi 161 | . . 3 ⊢ (Tr 𝐵 → (𝐴 ∈ 𝐵 → (𝐴 ∪ {𝐴}) ⊆ 𝐵)) |
8 | df-suc 4403 | . . . 4 ⊢ suc 𝐴 = (𝐴 ∪ {𝐴}) | |
9 | 8 | sseq1i 3206 | . . 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 2164 ∪ cun 3152 ⊆ wss 3154 {csn 3619 Tr wtr 4128 Ord word 4394 suc csuc 4397 |
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 710 ax-5 1458 ax-7 1459 ax-gen 1460 ax-ie1 1504 ax-ie2 1505 ax-8 1515 ax-10 1516 ax-11 1517 ax-i12 1518 ax-bndl 1520 ax-4 1521 ax-17 1537 ax-i9 1541 ax-ial 1545 ax-i5r 1546 ax-ext 2175 |
This theorem depends on definitions: df-bi 117 df-tru 1367 df-nf 1472 df-sb 1774 df-clab 2180 df-cleq 2186 df-clel 2189 df-nfc 2325 df-ral 2477 df-v 2762 df-un 3158 df-in 3160 df-ss 3167 df-sn 3625 df-uni 3837 df-tr 4129 df-iord 4398 df-suc 4403 |
This theorem is referenced by: ordelsuc 4538 tfrlemibfn 6383 tfr1onlembfn 6399 tfrcllembfn 6412 sucinc2 6501 nndomo 6922 prarloclemn 7561 ennnfonelemhom 12575 ennnfonelemrn 12579 |
Copyright terms: Public domain | W3C validator |