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 37614

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 6408	. . . . 5 ⊢ (𝑌 ∈ On → 𝑌 ∈ suc 𝑌)
3	1, 2	syl 17	. . . 4 ⊢ (𝜑 → 𝑌 ∈ suc 𝑌)
4		sucneqond.1	. . . 4 ⊢ (𝜑 → 𝑋 = suc 𝑌)
5	3, 4	eleqtrrd 2840	. . 3 ⊢ (𝜑 → 𝑌 ∈ 𝑋)
6		onsuc 7765	. . . . . . . 8 ⊢ (𝑌 ∈ On → suc 𝑌 ∈ On)
7	1, 6	syl 17	. . . . . . 7 ⊢ (𝜑 → suc 𝑌 ∈ On)
8	4, 7	eqeltrd 2837	. . . . . 6 ⊢ (𝜑 → 𝑋 ∈ On)
9		eloni 6335	. . . . . 6 ⊢ (𝑋 ∈ On → Ord 𝑋)
10	8, 9	syl 17	. . . . 5 ⊢ (𝜑 → Ord 𝑋)
11		ordirr 6343	. . . . 5 ⊢ (Ord 𝑋 → ¬ 𝑋 ∈ 𝑋)
12	10, 11	syl 17	. . . 4 ⊢ (𝜑 → ¬ 𝑋 ∈ 𝑋)
13		eleq1 2825	. . . . . 6 ⊢ (𝑋 = 𝑌 → (𝑋 ∈ 𝑋 ↔ 𝑌 ∈ 𝑋))
14	13	biimprd 248	. . . . 5 ⊢ (𝑋 = 𝑌 → (𝑌 ∈ 𝑋 → 𝑋 ∈ 𝑋))
15	14	con3d 152	. . . 4 ⊢ (𝑋 = 𝑌 → (¬ 𝑋 ∈ 𝑋 → ¬ 𝑌 ∈ 𝑋))
16	12, 15	syl5com 31	. . 3 ⊢ (𝜑 → (𝑋 = 𝑌 → ¬ 𝑌 ∈ 𝑋))
17	5, 16	mt2d 136	. 2 ⊢ (𝜑 → ¬ 𝑋 = 𝑌)
18	17	neqned 2940	1 ⊢ (𝜑 → 𝑋 ≠ 𝑌)

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 = wceq 1542 ∈ wcel 2114 ≠ wne 2933 Ord word 6324 Oncon0 6325 suc csuc 6327

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-ext 2709 ax-sep 5243 ax-pr 5379 ax-un 7690

This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-sb 2069 df-clab 2716 df-cleq 2729 df-clel 2812 df-ne 2934 df-ral 3053 df-rex 3063 df-rab 3402 df-v 3444 df-dif 3906 df-un 3908 df-in 3910 df-ss 3920 df-pss 3923 df-nul 4288 df-if 4482 df-pw 4558 df-sn 4583 df-pr 4585 df-op 4589 df-uni 4866 df-br 5101 df-opab 5163 df-tr 5208 df-eprel 5532 df-po 5540 df-so 5541 df-fr 5585 df-we 5587 df-ord 6328 df-on 6329 df-suc 6331

This theorem is referenced by: sucneqoni 37615