Theorem oneo 8573

Description: If an ordinal number is even, its successor is odd. (Contributed by NM, 26-Jan-2006.)

Assertion

Ref	Expression
oneo	⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 = (2o ·o 𝐴)) → ¬ suc 𝐶 = (2o ·o 𝐵))

Proof of Theorem oneo

Step	Hyp	Ref	Expression
1		onnbtwn 6452	. . 3 ⊢ (𝐴 ∈ On → ¬ (𝐴 ∈ 𝐵 ∧ 𝐵 ∈ suc 𝐴))
2	1	3ad2ant1 1151	. 2 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 = (2o ·o 𝐴)) → ¬ (𝐴 ∈ 𝐵 ∧ 𝐵 ∈ suc 𝐴))
3		suceq 6424	. . . . 5 ⊢ (𝐶 = (2o ·o 𝐴) → suc 𝐶 = suc (2o ·o 𝐴))
4	3	eqeq1d 2763	. . . 4 ⊢ (𝐶 = (2o ·o 𝐴) → (suc 𝐶 = (2o ·o 𝐵) ↔ suc (2o ·o 𝐴) = (2o ·o 𝐵)))
5	4	3ad2ant3 1153	. . 3 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 = (2o ·o 𝐴)) → (suc 𝐶 = (2o ·o 𝐵) ↔ suc (2o ·o 𝐴) = (2o ·o 𝐵)))
6		ovex 7445	. . . . . . . 8 ⊢ (2o ·o 𝐴) ∈ V
7	6	sucid 6440	. . . . . . 7 ⊢ (2o ·o 𝐴) ∈ suc (2o ·o 𝐴)
8		eleq2 2850	. . . . . . 7 ⊢ (suc (2o ·o 𝐴) = (2o ·o 𝐵) → ((2o ·o 𝐴) ∈ suc (2o ·o 𝐴) ↔ (2o ·o 𝐴) ∈ (2o ·o 𝐵)))
9	7, 8	mpbii 236	. . . . . 6 ⊢ (suc (2o ·o 𝐴) = (2o ·o 𝐵) → (2o ·o 𝐴) ∈ (2o ·o 𝐵))
10		2on 8474	. . . . . . . 8 ⊢ 2o ∈ On
11		omord 8560	. . . . . . . 8 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 2o ∈ On) → ((𝐴 ∈ 𝐵 ∧ ∅ ∈ 2o) ↔ (2o ·o 𝐴) ∈ (2o ·o 𝐵)))
12	10, 11	mp3an3 1479	. . . . . . 7 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → ((𝐴 ∈ 𝐵 ∧ ∅ ∈ 2o) ↔ (2o ·o 𝐴) ∈ (2o ·o 𝐵)))
13		simpl 488	. . . . . . 7 ⊢ ((𝐴 ∈ 𝐵 ∧ ∅ ∈ 2o) → 𝐴 ∈ 𝐵)
14	12, 13	biimtrrdi 257	. . . . . 6 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → ((2o ·o 𝐴) ∈ (2o ·o 𝐵) → 𝐴 ∈ 𝐵))
15	9, 14	syl5 35	. . . . 5 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (suc (2o ·o 𝐴) = (2o ·o 𝐵) → 𝐴 ∈ 𝐵))
16		simpr 490	. . . . . . . . 9 ⊢ (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ suc (2o ·o 𝐴) = (2o ·o 𝐵)) → suc (2o ·o 𝐴) = (2o ·o 𝐵))
17		omcl 8528	. . . . . . . . . . . . 13 ⊢ ((2o ∈ On ∧ 𝐴 ∈ On) → (2o ·o 𝐴) ∈ On)
18	10, 17	mpan 703	. . . . . . . . . . . 12 ⊢ (𝐴 ∈ On → (2o ·o 𝐴) ∈ On)
19		oa1suc 8523	. . . . . . . . . . . 12 ⊢ ((2o ·o 𝐴) ∈ On → ((2o ·o 𝐴) +o 1o) = suc (2o ·o 𝐴))
20	18, 19	syl 18	. . . . . . . . . . 11 ⊢ (𝐴 ∈ On → ((2o ·o 𝐴) +o 1o) = suc (2o ·o 𝐴))
21		1oex 8470	. . . . . . . . . . . . . . 15 ⊢ 1o ∈ V
22	21	sucid 6440	. . . . . . . . . . . . . 14 ⊢ 1o ∈ suc 1o
23		df-2o 8461	. . . . . . . . . . . . . 14 ⊢ 2o = suc 1o
24	22, 23	eleqtrri 2860	. . . . . . . . . . . . 13 ⊢ 1o ∈ 2o
25		1on 8473	. . . . . . . . . . . . . 14 ⊢ 1o ∈ On
26		oaord 8539	. . . . . . . . . . . . . 14 ⊢ ((1o ∈ On ∧ 2o ∈ On ∧ (2o ·o 𝐴) ∈ On) → (1o ∈ 2o ↔ ((2o ·o 𝐴) +o 1o) ∈ ((2o ·o 𝐴) +o 2o)))
27	25, 10, 18, 26	mp3an12i 1494	. . . . . . . . . . . . 13 ⊢ (𝐴 ∈ On → (1o ∈ 2o ↔ ((2o ·o 𝐴) +o 1o) ∈ ((2o ·o 𝐴) +o 2o)))
28	24, 27	mpbii 236	. . . . . . . . . . . 12 ⊢ (𝐴 ∈ On → ((2o ·o 𝐴) +o 1o) ∈ ((2o ·o 𝐴) +o 2o))
29		omsuc 8518	. . . . . . . . . . . . 13 ⊢ ((2o ∈ On ∧ 𝐴 ∈ On) → (2o ·o suc 𝐴) = ((2o ·o 𝐴) +o 2o))
30	10, 29	mpan 703	. . . . . . . . . . . 12 ⊢ (𝐴 ∈ On → (2o ·o suc 𝐴) = ((2o ·o 𝐴) +o 2o))
31	28, 30	eleqtrrd 2864	. . . . . . . . . . 11 ⊢ (𝐴 ∈ On → ((2o ·o 𝐴) +o 1o) ∈ (2o ·o suc 𝐴))
32	20, 31	eqeltrrd 2862	. . . . . . . . . 10 ⊢ (𝐴 ∈ On → suc (2o ·o 𝐴) ∈ (2o ·o suc 𝐴))
33	32	ad2antrr 739	. . . . . . . . 9 ⊢ (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ suc (2o ·o 𝐴) = (2o ·o 𝐵)) → suc (2o ·o 𝐴) ∈ (2o ·o suc 𝐴))
34	16, 33	eqeltrrd 2862	. . . . . . . 8 ⊢ (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ suc (2o ·o 𝐴) = (2o ·o 𝐵)) → (2o ·o 𝐵) ∈ (2o ·o suc 𝐴))
35		onsuc 7813	. . . . . . . . . . 11 ⊢ (𝐴 ∈ On → suc 𝐴 ∈ On)
36		omord 8560	. . . . . . . . . . . 12 ⊢ ((𝐵 ∈ On ∧ suc 𝐴 ∈ On ∧ 2o ∈ On) → ((𝐵 ∈ suc 𝐴 ∧ ∅ ∈ 2o) ↔ (2o ·o 𝐵) ∈ (2o ·o suc 𝐴)))
37	10, 36	mp3an3 1479	. . . . . . . . . . 11 ⊢ ((𝐵 ∈ On ∧ suc 𝐴 ∈ On) → ((𝐵 ∈ suc 𝐴 ∧ ∅ ∈ 2o) ↔ (2o ·o 𝐵) ∈ (2o ·o suc 𝐴)))
38	35, 37	sylan2 605	. . . . . . . . . 10 ⊢ ((𝐵 ∈ On ∧ 𝐴 ∈ On) → ((𝐵 ∈ suc 𝐴 ∧ ∅ ∈ 2o) ↔ (2o ·o 𝐵) ∈ (2o ·o suc 𝐴)))
39	38	ancoms 464	. . . . . . . . 9 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → ((𝐵 ∈ suc 𝐴 ∧ ∅ ∈ 2o) ↔ (2o ·o 𝐵) ∈ (2o ·o suc 𝐴)))
40	39	adantr 486	. . . . . . . 8 ⊢ (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ suc (2o ·o 𝐴) = (2o ·o 𝐵)) → ((𝐵 ∈ suc 𝐴 ∧ ∅ ∈ 2o) ↔ (2o ·o 𝐵) ∈ (2o ·o suc 𝐴)))
41	34, 40	mpbird 260	. . . . . . 7 ⊢ (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ suc (2o ·o 𝐴) = (2o ·o 𝐵)) → (𝐵 ∈ suc 𝐴 ∧ ∅ ∈ 2o))
42	41	simpld 500	. . . . . 6 ⊢ (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ suc (2o ·o 𝐴) = (2o ·o 𝐵)) → 𝐵 ∈ suc 𝐴)
43	42	ex 418	. . . . 5 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (suc (2o ·o 𝐴) = (2o ·o 𝐵) → 𝐵 ∈ suc 𝐴))
44	15, 43	jcad 522	. . . 4 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (suc (2o ·o 𝐴) = (2o ·o 𝐵) → (𝐴 ∈ 𝐵 ∧ 𝐵 ∈ suc 𝐴)))
45	44	3adant3 1150	. . 3 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 = (2o ·o 𝐴)) → (suc (2o ·o 𝐴) = (2o ·o 𝐵) → (𝐴 ∈ 𝐵 ∧ 𝐵 ∈ suc 𝐴)))
46	5, 45	sylbid 243	. 2 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 = (2o ·o 𝐴)) → (suc 𝐶 = (2o ·o 𝐵) → (𝐴 ∈ 𝐵 ∧ 𝐵 ∈ suc 𝐴)))
47	2, 46	mtod 201	1 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 = (2o ·o 𝐴)) → ¬ suc 𝐶 = (2o ·o 𝐵))

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2145  ∅c0 4279  Oncon0 6355  suc csuc 6357  (class class class)co 7412  1_oc1o 8453  2_oc2o 8454   +_o coa 8457   ·_o comu 8458

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-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-rep 5232  ax-sep 5249  ax-nul 5260  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-nf 1817  df-sb 2100  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-reu 3367  df-rab 3414  df-v 3453  df-sbc 3740  df-csb 3848  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-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-tr 5213  df-id 5546  df-eprel 5551  df-po 5559  df-so 5560  df-fr 5604  df-we 5606  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-pred 6297  df-ord 6358  df-on 6359  df-lim 6360  df-suc 6361  df-iota 6487  df-fun 6533  df-fn 6534  df-f 6535  df-f1 6536  df-fo 6537  df-f1o 6538  df-fv 6539  df-ov 7415  df-oprab 7416  df-mpo 7417  df-om 7867  df-2nd 7991  df-frecs 8283  df-wrecs 8314  df-recs 8363  df-rdg 8402  df-1o 8460  df-2o 8461  df-oadd 8464  df-omul 8465

This theorem is used by: (None)