Mathbox for ML |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > Mathboxes > sucneqoni | Structured version Visualization version GIF version |
Description: Inequality of an ordinal set with its successor. Does not use the axiom of regularity. (Contributed by ML, 18-Oct-2020.) |
Ref | Expression |
---|---|
sucneqoni.1 | ⊢ 𝑋 = suc 𝑌 |
sucneqoni.2 | ⊢ 𝑌 ∈ On |
Ref | Expression |
---|---|
sucneqoni | ⊢ 𝑋 ≠ 𝑌 |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | sucneqoni.1 | . . . 4 ⊢ 𝑋 = suc 𝑌 | |
2 | 1 | a1i 11 | . . 3 ⊢ (⊤ → 𝑋 = suc 𝑌) |
3 | sucneqoni.2 | . . . 4 ⊢ 𝑌 ∈ On | |
4 | 3 | a1i 11 | . . 3 ⊢ (⊤ → 𝑌 ∈ On) |
5 | 2, 4 | sucneqond 34645 | . 2 ⊢ (⊤ → 𝑋 ≠ 𝑌) |
6 | 5 | mptru 1540 | 1 ⊢ 𝑋 ≠ 𝑌 |
Colors of variables: wff setvar class |
Syntax hints: = wceq 1533 ⊤wtru 1534 ∈ wcel 2110 ≠ wne 3016 Oncon0 6190 suc csuc 6192 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1907 ax-6 1966 ax-7 2011 ax-8 2112 ax-9 2120 ax-10 2141 ax-11 2157 ax-12 2173 ax-ext 2793 ax-sep 5202 ax-nul 5209 ax-pr 5329 ax-un 7460 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1536 df-ex 1777 df-nf 1781 df-sb 2066 df-mo 2618 df-eu 2650 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ne 3017 df-ral 3143 df-rex 3144 df-rab 3147 df-v 3496 df-sbc 3772 df-dif 3938 df-un 3940 df-in 3942 df-ss 3951 df-pss 3953 df-nul 4291 df-if 4467 df-sn 4567 df-pr 4569 df-tp 4571 df-op 4573 df-uni 4838 df-br 5066 df-opab 5128 df-tr 5172 df-eprel 5464 df-po 5473 df-so 5474 df-fr 5513 df-we 5515 df-ord 6193 df-on 6194 df-suc 6196 |
This theorem is referenced by: finxpreclem3 34673 |
Copyright terms: Public domain | W3C validator |