Theorem oneo 8412

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 6357	. . 3 ⊢ (𝐴 ∈ On → ¬ (𝐴 ∈ 𝐵 ∧ 𝐵 ∈ suc 𝐴))
2	1	3ad2ant1 1132	. 2 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 = (2o ·o 𝐴)) → ¬ (𝐴 ∈ 𝐵 ∧ 𝐵 ∈ suc 𝐴))
3		suceq 6331	. . . . 5 ⊢ (𝐶 = (2o ·o 𝐴) → suc 𝐶 = suc (2o ·o 𝐴))
4	3	eqeq1d 2740	. . . 4 ⊢ (𝐶 = (2o ·o 𝐴) → (suc 𝐶 = (2o ·o 𝐵) ↔ suc (2o ·o 𝐴) = (2o ·o 𝐵)))
5	4	3ad2ant3 1134	. . 3 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 = (2o ·o 𝐴)) → (suc 𝐶 = (2o ·o 𝐵) ↔ suc (2o ·o 𝐴) = (2o ·o 𝐵)))
6		ovex 7308	. . . . . . . 8 ⊢ (2o ·o 𝐴) ∈ V
7	6	sucid 6345	. . . . . . 7 ⊢ (2o ·o 𝐴) ∈ suc (2o ·o 𝐴)
8		eleq2 2827	. . . . . . 7 ⊢ (suc (2o ·o 𝐴) = (2o ·o 𝐵) → ((2o ·o 𝐴) ∈ suc (2o ·o 𝐴) ↔ (2o ·o 𝐴) ∈ (2o ·o 𝐵)))
9	7, 8	mpbii 232	. . . . . 6 ⊢ (suc (2o ·o 𝐴) = (2o ·o 𝐵) → (2o ·o 𝐴) ∈ (2o ·o 𝐵))
10		2on 8311	. . . . . . . 8 ⊢ 2o ∈ On
11		omord 8399	. . . . . . . 8 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 2o ∈ On) → ((𝐴 ∈ 𝐵 ∧ ∅ ∈ 2o) ↔ (2o ·o 𝐴) ∈ (2o ·o 𝐵)))
12	10, 11	mp3an3 1449	. . . . . . 7 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → ((𝐴 ∈ 𝐵 ∧ ∅ ∈ 2o) ↔ (2o ·o 𝐴) ∈ (2o ·o 𝐵)))
13		simpl 483	. . . . . . 7 ⊢ ((𝐴 ∈ 𝐵 ∧ ∅ ∈ 2o) → 𝐴 ∈ 𝐵)
14	12, 13	syl6bir 253	. . . . . 6 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → ((2o ·o 𝐴) ∈ (2o ·o 𝐵) → 𝐴 ∈ 𝐵))
15	9, 14	syl5 34	. . . . 5 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (suc (2o ·o 𝐴) = (2o ·o 𝐵) → 𝐴 ∈ 𝐵))
16		simpr 485	. . . . . . . . 9 ⊢ (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ suc (2o ·o 𝐴) = (2o ·o 𝐵)) → suc (2o ·o 𝐴) = (2o ·o 𝐵))
17		omcl 8366	. . . . . . . . . . . . 13 ⊢ ((2o ∈ On ∧ 𝐴 ∈ On) → (2o ·o 𝐴) ∈ On)
18	10, 17	mpan 687	. . . . . . . . . . . 12 ⊢ (𝐴 ∈ On → (2o ·o 𝐴) ∈ On)
19		oa1suc 8361	. . . . . . . . . . . 12 ⊢ ((2o ·o 𝐴) ∈ On → ((2o ·o 𝐴) +o 1o) = suc (2o ·o 𝐴))
20	18, 19	syl 17	. . . . . . . . . . 11 ⊢ (𝐴 ∈ On → ((2o ·o 𝐴) +o 1o) = suc (2o ·o 𝐴))
21		1oex 8307	. . . . . . . . . . . . . . 15 ⊢ 1o ∈ V
22	21	sucid 6345	. . . . . . . . . . . . . 14 ⊢ 1o ∈ suc 1o
23		df-2o 8298	. . . . . . . . . . . . . 14 ⊢ 2o = suc 1o
24	22, 23	eleqtrri 2838	. . . . . . . . . . . . 13 ⊢ 1o ∈ 2o
25		1on 8309	. . . . . . . . . . . . . 14 ⊢ 1o ∈ On
26		oaord 8378	. . . . . . . . . . . . . 14 ⊢ ((1o ∈ On ∧ 2o ∈ On ∧ (2o ·o 𝐴) ∈ On) → (1o ∈ 2o ↔ ((2o ·o 𝐴) +o 1o) ∈ ((2o ·o 𝐴) +o 2o)))
27	25, 10, 18, 26	mp3an12i 1464	. . . . . . . . . . . . 13 ⊢ (𝐴 ∈ On → (1o ∈ 2o ↔ ((2o ·o 𝐴) +o 1o) ∈ ((2o ·o 𝐴) +o 2o)))
28	24, 27	mpbii 232	. . . . . . . . . . . 12 ⊢ (𝐴 ∈ On → ((2o ·o 𝐴) +o 1o) ∈ ((2o ·o 𝐴) +o 2o))
29		omsuc 8356	. . . . . . . . . . . . 13 ⊢ ((2o ∈ On ∧ 𝐴 ∈ On) → (2o ·o suc 𝐴) = ((2o ·o 𝐴) +o 2o))
30	10, 29	mpan 687	. . . . . . . . . . . 12 ⊢ (𝐴 ∈ On → (2o ·o suc 𝐴) = ((2o ·o 𝐴) +o 2o))
31	28, 30	eleqtrrd 2842	. . . . . . . . . . 11 ⊢ (𝐴 ∈ On → ((2o ·o 𝐴) +o 1o) ∈ (2o ·o suc 𝐴))
32	20, 31	eqeltrrd 2840	. . . . . . . . . 10 ⊢ (𝐴 ∈ On → suc (2o ·o 𝐴) ∈ (2o ·o suc 𝐴))
33	32	ad2antrr 723	. . . . . . . . 9 ⊢ (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ suc (2o ·o 𝐴) = (2o ·o 𝐵)) → suc (2o ·o 𝐴) ∈ (2o ·o suc 𝐴))
34	16, 33	eqeltrrd 2840	. . . . . . . 8 ⊢ (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ suc (2o ·o 𝐴) = (2o ·o 𝐵)) → (2o ·o 𝐵) ∈ (2o ·o suc 𝐴))
35		suceloni 7659	. . . . . . . . . . 11 ⊢ (𝐴 ∈ On → suc 𝐴 ∈ On)
36		omord 8399	. . . . . . . . . . . 12 ⊢ ((𝐵 ∈ On ∧ suc 𝐴 ∈ On ∧ 2o ∈ On) → ((𝐵 ∈ suc 𝐴 ∧ ∅ ∈ 2o) ↔ (2o ·o 𝐵) ∈ (2o ·o suc 𝐴)))
37	10, 36	mp3an3 1449	. . . . . . . . . . 11 ⊢ ((𝐵 ∈ On ∧ suc 𝐴 ∈ On) → ((𝐵 ∈ suc 𝐴 ∧ ∅ ∈ 2o) ↔ (2o ·o 𝐵) ∈ (2o ·o suc 𝐴)))
38	35, 37	sylan2 593	. . . . . . . . . 10 ⊢ ((𝐵 ∈ On ∧ 𝐴 ∈ On) → ((𝐵 ∈ suc 𝐴 ∧ ∅ ∈ 2o) ↔ (2o ·o 𝐵) ∈ (2o ·o suc 𝐴)))
39	38	ancoms 459	. . . . . . . . 9 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → ((𝐵 ∈ suc 𝐴 ∧ ∅ ∈ 2o) ↔ (2o ·o 𝐵) ∈ (2o ·o suc 𝐴)))
40	39	adantr 481	. . . . . . . 8 ⊢ (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ suc (2o ·o 𝐴) = (2o ·o 𝐵)) → ((𝐵 ∈ suc 𝐴 ∧ ∅ ∈ 2o) ↔ (2o ·o 𝐵) ∈ (2o ·o suc 𝐴)))
41	34, 40	mpbird 256	. . . . . . 7 ⊢ (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ suc (2o ·o 𝐴) = (2o ·o 𝐵)) → (𝐵 ∈ suc 𝐴 ∧ ∅ ∈ 2o))
42	41	simpld 495	. . . . . 6 ⊢ (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ suc (2o ·o 𝐴) = (2o ·o 𝐵)) → 𝐵 ∈ suc 𝐴)
43	42	ex 413	. . . . 5 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (suc (2o ·o 𝐴) = (2o ·o 𝐵) → 𝐵 ∈ suc 𝐴))
44	15, 43	jcad 513	. . . 4 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (suc (2o ·o 𝐴) = (2o ·o 𝐵) → (𝐴 ∈ 𝐵 ∧ 𝐵 ∈ suc 𝐴)))
45	44	3adant3 1131	. . 3 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 = (2o ·o 𝐴)) → (suc (2o ·o 𝐴) = (2o ·o 𝐵) → (𝐴 ∈ 𝐵 ∧ 𝐵 ∈ suc 𝐴)))
46	5, 45	sylbid 239	. 2 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 = (2o ·o 𝐴)) → (suc 𝐶 = (2o ·o 𝐵) → (𝐴 ∈ 𝐵 ∧ 𝐵 ∈ suc 𝐴)))
47	2, 46	mtod 197	1 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 = (2o ·o 𝐴)) → ¬ suc 𝐶 = (2o ·o 𝐵))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 205   ∧ wa 396   ∧ w3a 1086   = wceq 1539   ∈ wcel 2106  ∅c0 4256  Oncon0 6266  suc csuc 6268  (class class class)co 7275  1_oc1o 8290  2_oc2o 8291   +_o coa 8294   ·_o comu 8295

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2709  ax-rep 5209  ax-sep 5223  ax-nul 5230  ax-pr 5352  ax-un 7588

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-3or 1087  df-3an 1088  df-tru 1542  df-fal 1552  df-ex 1783  df-nf 1787  df-sb 2068  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2816  df-nfc 2889  df-ne 2944  df-ral 3069  df-rex 3070  df-reu 3072  df-rab 3073  df-v 3434  df-sbc 3717  df-csb 3833  df-dif 3890  df-un 3892  df-in 3894  df-ss 3904  df-pss 3906  df-nul 4257  df-if 4460  df-pw 4535  df-sn 4562  df-pr 4564  df-op 4568  df-uni 4840  df-iun 4926  df-br 5075  df-opab 5137  df-mpt 5158  df-tr 5192  df-id 5489  df-eprel 5495  df-po 5503  df-so 5504  df-fr 5544  df-we 5546  df-xp 5595  df-rel 5596  df-cnv 5597  df-co 5598  df-dm 5599  df-rn 5600  df-res 5601  df-ima 5602  df-pred 6202  df-ord 6269  df-on 6270  df-lim 6271  df-suc 6272  df-iota 6391  df-fun 6435  df-fn 6436  df-f 6437  df-f1 6438  df-fo 6439  df-f1o 6440  df-fv 6441  df-ov 7278  df-oprab 7279  df-mpo 7280  df-om 7713  df-2nd 7832  df-frecs 8097  df-wrecs 8128  df-recs 8202  df-rdg 8241  df-1o 8297  df-2o 8298  df-oadd 8301  df-omul 8302

This theorem is referenced by: (None)