sucneqond - Mathbox for ML

	Mathbox for ML		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > Mathboxes > sucneqond		Structured version Visualization version GIF version

Theorem sucneqond 38256

Description: Inequality of an ordinal set with its successor. Does not use the axiom of regularity. (Contributed by ML, 18-Oct-2020.)

**Hypotheses**
Ref	Expression
sucneqond.1	⊢ (𝜑 → 𝑋 = suc 𝑌)
sucneqond.2	⊢ (𝜑 → 𝑌 ∈ On)

**Assertion**
Ref	Expression
sucneqond	⊢ (𝜑 → 𝑋 ≠ 𝑌)

**Proof of Theorem sucneqond**
Step	Hyp	Ref	Expression
1		sucneqond.2	. . . . 5 ⊢ (𝜑 → 𝑌 ∈ On)
2		sucidg 6439	. . . . 5 ⊢ (𝑌 ∈ On → 𝑌 ∈ suc 𝑌)
3	1, 2	syl 18	. . . 4 ⊢ (𝜑 → 𝑌 ∈ suc 𝑌)
4		sucneqond.1	. . . 4 ⊢ (𝜑 → 𝑋 = suc 𝑌)
5	3, 4	eleqtrrd 2864	. . 3 ⊢ (𝜑 → 𝑌 ∈ 𝑋)
6		onsuc 7813	. . . . . . . 8 ⊢ (𝑌 ∈ On → suc 𝑌 ∈ On)
7	1, 6	syl 18	. . . . . . 7 ⊢ (𝜑 → suc 𝑌 ∈ On)
8	4, 7	eqeltrd 2861	. . . . . 6 ⊢ (𝜑 → 𝑋 ∈ On)
9		eloni 6365	. . . . . 6 ⊢ (𝑋 ∈ On → Ord 𝑋)
10	8, 9	syl 18	. . . . 5 ⊢ (𝜑 → Ord 𝑋)
11		ordirr 6373	. . . . 5 ⊢ (Ord 𝑋 → ¬ 𝑋 ∈ 𝑋)
12	10, 11	syl 18	. . . 4 ⊢ (𝜑 → ¬ 𝑋 ∈ 𝑋)
13		eleq1 2849	. . . . . 6 ⊢ (𝑋 = 𝑌 → (𝑋 ∈ 𝑋 ↔ 𝑌 ∈ 𝑋))
14	13	biimprd 251	. . . . 5 ⊢ (𝑋 = 𝑌 → (𝑌 ∈ 𝑋 → 𝑋 ∈ 𝑋))
15	14	con3d 153	. . . 4 ⊢ (𝑋 = 𝑌 → (¬ 𝑋 ∈ 𝑋 → ¬ 𝑌 ∈ 𝑋))
16	12, 15	syl5com 32	. . 3 ⊢ (𝜑 → (𝑋 = 𝑌 → ¬ 𝑌 ∈ 𝑋))
17	5, 16	mt2d 137	. 2 ⊢ (𝜑 → ¬ 𝑋 = 𝑌)
18	17	neqned 2963	1 ⊢ (𝜑 → 𝑋 ≠ 𝑌)

Colors of variables: wff setvar class

This proof depends on syntax axioms: ¬ wn 3 → wi 4 = wceq 1570 ∈ wcel 2145 ≠ wne 2956 Ord word 6354 Oncon0 6355 suc csuc 6357

This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-ext 2733 ax-sep 5249 ax-pr 5391 ax-un 7740

This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-sb 2100 df-clab 2740 df-cleq 2753 df-clel 2836 df-ne 2957 df-ral 3078 df-rex 3088 df-rab 3414 df-v 3453 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-br 5104 df-opab 5168 df-tr 5213 df-eprel 5551 df-po 5559 df-so 5560 df-fr 5604 df-we 5606 df-ord 6358 df-on 6359 df-suc 6361

This theorem is used by: sucneqoni 38257