| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > onsucb | GIF version | ||
| Description: A class is an ordinal number if and only if its successor is an ordinal number. Biconditional form of onsuc 4599. (Contributed by NM, 9-Sep-2003.) |
| Ref | Expression |
|---|---|
| onsucb | ⊢ (𝐴 ∈ On ↔ suc 𝐴 ∈ On) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | onsuc 4599 | . 2 ⊢ (𝐴 ∈ On → suc 𝐴 ∈ On) | |
| 2 | eloni 4472 | . . 3 ⊢ (suc 𝐴 ∈ On → Ord suc 𝐴) | |
| 3 | elex 2814 | . . . . 5 ⊢ (suc 𝐴 ∈ On → suc 𝐴 ∈ V) | |
| 4 | sucexb 4595 | . . . . 5 ⊢ (𝐴 ∈ V ↔ suc 𝐴 ∈ V) | |
| 5 | 3, 4 | sylibr 134 | . . . 4 ⊢ (suc 𝐴 ∈ On → 𝐴 ∈ V) |
| 6 | elong 4470 | . . . . 5 ⊢ (𝐴 ∈ V → (𝐴 ∈ On ↔ Ord 𝐴)) | |
| 7 | ordsucg 4600 | . . . . 5 ⊢ (𝐴 ∈ V → (Ord 𝐴 ↔ Ord suc 𝐴)) | |
| 8 | 6, 7 | bitrd 188 | . . . 4 ⊢ (𝐴 ∈ V → (𝐴 ∈ On ↔ Ord suc 𝐴)) |
| 9 | 5, 8 | syl 14 | . . 3 ⊢ (suc 𝐴 ∈ On → (𝐴 ∈ On ↔ Ord suc 𝐴)) |
| 10 | 2, 9 | mpbird 167 | . 2 ⊢ (suc 𝐴 ∈ On → 𝐴 ∈ On) |
| 11 | 1, 10 | impbii 126 | 1 ⊢ (𝐴 ∈ On ↔ suc 𝐴 ∈ On) |
| Colors of variables: wff set class |
| Syntax hints: ↔ wb 105 ∈ wcel 2202 Vcvv 2802 Ord word 4459 Oncon0 4460 suc csuc 4462 |
| 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 716 ax-5 1495 ax-7 1496 ax-gen 1497 ax-ie1 1541 ax-ie2 1542 ax-8 1552 ax-10 1553 ax-11 1554 ax-i12 1555 ax-bndl 1557 ax-4 1558 ax-17 1574 ax-i9 1578 ax-ial 1582 ax-i5r 1583 ax-13 2204 ax-14 2205 ax-ext 2213 ax-sep 4207 ax-pow 4264 ax-pr 4299 ax-un 4530 |
| This theorem depends on definitions: df-bi 117 df-3an 1006 df-tru 1400 df-nf 1509 df-sb 1811 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2363 df-ral 2515 df-rex 2516 df-v 2804 df-un 3204 df-in 3206 df-ss 3213 df-pw 3654 df-sn 3675 df-pr 3676 df-uni 3894 df-tr 4188 df-iord 4463 df-on 4465 df-suc 4468 |
| This theorem is referenced by: onsucmin 4605 onsucuni2 4662 |
| Copyright terms: Public domain | W3C validator |