| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > onsucelsucr | GIF version | ||
| Description: Membership is inherited by predecessors. The converse, for all ordinals, implies excluded middle, as shown at onsucelsucexmid 4567. However, the converse does hold where 𝐵 is a natural number, as seen at nnsucelsuc 6558. (Contributed by Jim Kingdon, 17-Jul-2019.) |
| Ref | Expression |
|---|---|
| onsucelsucr | ⊢ (𝐵 ∈ On → (suc 𝐴 ∈ suc 𝐵 → 𝐴 ∈ 𝐵)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | elex 2774 | . . . 4 ⊢ (suc 𝐴 ∈ suc 𝐵 → suc 𝐴 ∈ V) | |
| 2 | sucexb 4534 | . . . 4 ⊢ (𝐴 ∈ V ↔ suc 𝐴 ∈ V) | |
| 3 | 1, 2 | sylibr 134 | . . 3 ⊢ (suc 𝐴 ∈ suc 𝐵 → 𝐴 ∈ V) |
| 4 | onelss 4423 | . . . . . . 7 ⊢ (𝐵 ∈ On → (suc 𝐴 ∈ 𝐵 → suc 𝐴 ⊆ 𝐵)) | |
| 5 | eqimss 3238 | . . . . . . . 8 ⊢ (suc 𝐴 = 𝐵 → suc 𝐴 ⊆ 𝐵) | |
| 6 | 5 | a1i 9 | . . . . . . 7 ⊢ (𝐵 ∈ On → (suc 𝐴 = 𝐵 → suc 𝐴 ⊆ 𝐵)) |
| 7 | 4, 6 | jaod 718 | . . . . . 6 ⊢ (𝐵 ∈ On → ((suc 𝐴 ∈ 𝐵 ∨ suc 𝐴 = 𝐵) → suc 𝐴 ⊆ 𝐵)) |
| 8 | 7 | adantl 277 | . . . . 5 ⊢ ((𝐴 ∈ V ∧ 𝐵 ∈ On) → ((suc 𝐴 ∈ 𝐵 ∨ suc 𝐴 = 𝐵) → suc 𝐴 ⊆ 𝐵)) |
| 9 | elsucg 4440 | . . . . . . 7 ⊢ (suc 𝐴 ∈ V → (suc 𝐴 ∈ suc 𝐵 ↔ (suc 𝐴 ∈ 𝐵 ∨ suc 𝐴 = 𝐵))) | |
| 10 | 2, 9 | sylbi 121 | . . . . . 6 ⊢ (𝐴 ∈ V → (suc 𝐴 ∈ suc 𝐵 ↔ (suc 𝐴 ∈ 𝐵 ∨ suc 𝐴 = 𝐵))) |
| 11 | 10 | adantr 276 | . . . . 5 ⊢ ((𝐴 ∈ V ∧ 𝐵 ∈ On) → (suc 𝐴 ∈ suc 𝐵 ↔ (suc 𝐴 ∈ 𝐵 ∨ suc 𝐴 = 𝐵))) |
| 12 | eloni 4411 | . . . . . 6 ⊢ (𝐵 ∈ On → Ord 𝐵) | |
| 13 | ordelsuc 4542 | . . . . . 6 ⊢ ((𝐴 ∈ V ∧ Ord 𝐵) → (𝐴 ∈ 𝐵 ↔ suc 𝐴 ⊆ 𝐵)) | |
| 14 | 12, 13 | sylan2 286 | . . . . 5 ⊢ ((𝐴 ∈ V ∧ 𝐵 ∈ On) → (𝐴 ∈ 𝐵 ↔ suc 𝐴 ⊆ 𝐵)) |
| 15 | 8, 11, 14 | 3imtr4d 203 | . . . 4 ⊢ ((𝐴 ∈ V ∧ 𝐵 ∈ On) → (suc 𝐴 ∈ suc 𝐵 → 𝐴 ∈ 𝐵)) |
| 16 | 15 | impancom 260 | . . 3 ⊢ ((𝐴 ∈ V ∧ suc 𝐴 ∈ suc 𝐵) → (𝐵 ∈ On → 𝐴 ∈ 𝐵)) |
| 17 | 3, 16 | mpancom 422 | . 2 ⊢ (suc 𝐴 ∈ suc 𝐵 → (𝐵 ∈ On → 𝐴 ∈ 𝐵)) |
| 18 | 17 | com12 30 | 1 ⊢ (𝐵 ∈ On → (suc 𝐴 ∈ suc 𝐵 → 𝐴 ∈ 𝐵)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ↔ wb 105 ∨ wo 709 = wceq 1364 ∈ wcel 2167 Vcvv 2763 ⊆ wss 3157 Ord word 4398 Oncon0 4399 suc csuc 4401 |
| 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 1461 ax-7 1462 ax-gen 1463 ax-ie1 1507 ax-ie2 1508 ax-8 1518 ax-10 1519 ax-11 1520 ax-i12 1521 ax-bndl 1523 ax-4 1524 ax-17 1540 ax-i9 1544 ax-ial 1548 ax-i5r 1549 ax-13 2169 ax-14 2170 ax-ext 2178 ax-sep 4152 ax-pow 4208 ax-pr 4243 ax-un 4469 |
| This theorem depends on definitions: df-bi 117 df-tru 1367 df-nf 1475 df-sb 1777 df-clab 2183 df-cleq 2189 df-clel 2192 df-nfc 2328 df-ral 2480 df-rex 2481 df-v 2765 df-un 3161 df-in 3163 df-ss 3170 df-pw 3608 df-sn 3629 df-pr 3630 df-uni 3841 df-tr 4133 df-iord 4402 df-on 4404 df-suc 4407 |
| This theorem is referenced by: nnsucelsuc 6558 |
| Copyright terms: Public domain | W3C validator |