Theorem oneo 8209

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 6284	. . 3 ⊢ (𝐴 ∈ On → ¬ (𝐴 ∈ 𝐵 ∧ 𝐵 ∈ suc 𝐴))
2	1	3ad2ant1 1129	. 2 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 = (2o ·o 𝐴)) → ¬ (𝐴 ∈ 𝐵 ∧ 𝐵 ∈ suc 𝐴))
3		suceq 6258	. . . . 5 ⊢ (𝐶 = (2o ·o 𝐴) → suc 𝐶 = suc (2o ·o 𝐴))
4	3	eqeq1d 2825	. . . 4 ⊢ (𝐶 = (2o ·o 𝐴) → (suc 𝐶 = (2o ·o 𝐵) ↔ suc (2o ·o 𝐴) = (2o ·o 𝐵)))
5	4	3ad2ant3 1131	. . 3 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 = (2o ·o 𝐴)) → (suc 𝐶 = (2o ·o 𝐵) ↔ suc (2o ·o 𝐴) = (2o ·o 𝐵)))
6		ovex 7191	. . . . . . . 8 ⊢ (2o ·o 𝐴) ∈ V
7	6	sucid 6272	. . . . . . 7 ⊢ (2o ·o 𝐴) ∈ suc (2o ·o 𝐴)
8		eleq2 2903	. . . . . . 7 ⊢ (suc (2o ·o 𝐴) = (2o ·o 𝐵) → ((2o ·o 𝐴) ∈ suc (2o ·o 𝐴) ↔ (2o ·o 𝐴) ∈ (2o ·o 𝐵)))
9	7, 8	mpbii 235	. . . . . 6 ⊢ (suc (2o ·o 𝐴) = (2o ·o 𝐵) → (2o ·o 𝐴) ∈ (2o ·o 𝐵))
10		2on 8113	. . . . . . . 8 ⊢ 2o ∈ On
11		omord 8196	. . . . . . . 8 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 2o ∈ On) → ((𝐴 ∈ 𝐵 ∧ ∅ ∈ 2o) ↔ (2o ·o 𝐴) ∈ (2o ·o 𝐵)))
12	10, 11	mp3an3 1446	. . . . . . 7 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → ((𝐴 ∈ 𝐵 ∧ ∅ ∈ 2o) ↔ (2o ·o 𝐴) ∈ (2o ·o 𝐵)))
13		simpl 485	. . . . . . 7 ⊢ ((𝐴 ∈ 𝐵 ∧ ∅ ∈ 2o) → 𝐴 ∈ 𝐵)
14	12, 13	syl6bir 256	. . . . . 6 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → ((2o ·o 𝐴) ∈ (2o ·o 𝐵) → 𝐴 ∈ 𝐵))
15	9, 14	syl5 34	. . . . 5 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (suc (2o ·o 𝐴) = (2o ·o 𝐵) → 𝐴 ∈ 𝐵))
16		simpr 487	. . . . . . . . 9 ⊢ (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ suc (2o ·o 𝐴) = (2o ·o 𝐵)) → suc (2o ·o 𝐴) = (2o ·o 𝐵))
17		omcl 8163	. . . . . . . . . . . . 13 ⊢ ((2o ∈ On ∧ 𝐴 ∈ On) → (2o ·o 𝐴) ∈ On)
18	10, 17	mpan 688	. . . . . . . . . . . 12 ⊢ (𝐴 ∈ On → (2o ·o 𝐴) ∈ On)
19		oa1suc 8158	. . . . . . . . . . . 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 8112	. . . . . . . . . . . . . . 15 ⊢ 1o ∈ V
22	21	sucid 6272	. . . . . . . . . . . . . 14 ⊢ 1o ∈ suc 1o
23		df-2o 8105	. . . . . . . . . . . . . 14 ⊢ 2o = suc 1o
24	22, 23	eleqtrri 2914	. . . . . . . . . . . . 13 ⊢ 1o ∈ 2o
25		1on 8111	. . . . . . . . . . . . . 14 ⊢ 1o ∈ On
26		oaord 8175	. . . . . . . . . . . . . 14 ⊢ ((1o ∈ On ∧ 2o ∈ On ∧ (2o ·o 𝐴) ∈ On) → (1o ∈ 2o ↔ ((2o ·o 𝐴) +o 1o) ∈ ((2o ·o 𝐴) +o 2o)))
27	25, 10, 18, 26	mp3an12i 1461	. . . . . . . . . . . . 13 ⊢ (𝐴 ∈ On → (1o ∈ 2o ↔ ((2o ·o 𝐴) +o 1o) ∈ ((2o ·o 𝐴) +o 2o)))
28	24, 27	mpbii 235	. . . . . . . . . . . 12 ⊢ (𝐴 ∈ On → ((2o ·o 𝐴) +o 1o) ∈ ((2o ·o 𝐴) +o 2o))
29		omsuc 8153	. . . . . . . . . . . . 13 ⊢ ((2o ∈ On ∧ 𝐴 ∈ On) → (2o ·o suc 𝐴) = ((2o ·o 𝐴) +o 2o))
30	10, 29	mpan 688	. . . . . . . . . . . 12 ⊢ (𝐴 ∈ On → (2o ·o suc 𝐴) = ((2o ·o 𝐴) +o 2o))
31	28, 30	eleqtrrd 2918	. . . . . . . . . . 11 ⊢ (𝐴 ∈ On → ((2o ·o 𝐴) +o 1o) ∈ (2o ·o suc 𝐴))
32	20, 31	eqeltrrd 2916	. . . . . . . . . 10 ⊢ (𝐴 ∈ On → suc (2o ·o 𝐴) ∈ (2o ·o suc 𝐴))
33	32	ad2antrr 724	. . . . . . . . 9 ⊢ (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ suc (2o ·o 𝐴) = (2o ·o 𝐵)) → suc (2o ·o 𝐴) ∈ (2o ·o suc 𝐴))
34	16, 33	eqeltrrd 2916	. . . . . . . 8 ⊢ (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ suc (2o ·o 𝐴) = (2o ·o 𝐵)) → (2o ·o 𝐵) ∈ (2o ·o suc 𝐴))
35		suceloni 7530	. . . . . . . . . . 11 ⊢ (𝐴 ∈ On → suc 𝐴 ∈ On)
36		omord 8196	. . . . . . . . . . . 12 ⊢ ((𝐵 ∈ On ∧ suc 𝐴 ∈ On ∧ 2o ∈ On) → ((𝐵 ∈ suc 𝐴 ∧ ∅ ∈ 2o) ↔ (2o ·o 𝐵) ∈ (2o ·o suc 𝐴)))
37	10, 36	mp3an3 1446	. . . . . . . . . . 11 ⊢ ((𝐵 ∈ On ∧ suc 𝐴 ∈ On) → ((𝐵 ∈ suc 𝐴 ∧ ∅ ∈ 2o) ↔ (2o ·o 𝐵) ∈ (2o ·o suc 𝐴)))
38	35, 37	sylan2 594	. . . . . . . . . 10 ⊢ ((𝐵 ∈ On ∧ 𝐴 ∈ On) → ((𝐵 ∈ suc 𝐴 ∧ ∅ ∈ 2o) ↔ (2o ·o 𝐵) ∈ (2o ·o suc 𝐴)))
39	38	ancoms 461	. . . . . . . . 9 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → ((𝐵 ∈ suc 𝐴 ∧ ∅ ∈ 2o) ↔ (2o ·o 𝐵) ∈ (2o ·o suc 𝐴)))
40	39	adantr 483	. . . . . . . 8 ⊢ (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ suc (2o ·o 𝐴) = (2o ·o 𝐵)) → ((𝐵 ∈ suc 𝐴 ∧ ∅ ∈ 2o) ↔ (2o ·o 𝐵) ∈ (2o ·o suc 𝐴)))
41	34, 40	mpbird 259	. . . . . . 7 ⊢ (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ suc (2o ·o 𝐴) = (2o ·o 𝐵)) → (𝐵 ∈ suc 𝐴 ∧ ∅ ∈ 2o))
42	41	simpld 497	. . . . . 6 ⊢ (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ suc (2o ·o 𝐴) = (2o ·o 𝐵)) → 𝐵 ∈ suc 𝐴)
43	42	ex 415	. . . . 5 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (suc (2o ·o 𝐴) = (2o ·o 𝐵) → 𝐵 ∈ suc 𝐴))
44	15, 43	jcad 515	. . . 4 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (suc (2o ·o 𝐴) = (2o ·o 𝐵) → (𝐴 ∈ 𝐵 ∧ 𝐵 ∈ suc 𝐴)))
45	44	3adant3 1128	. . 3 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 = (2o ·o 𝐴)) → (suc (2o ·o 𝐴) = (2o ·o 𝐵) → (𝐴 ∈ 𝐵 ∧ 𝐵 ∈ suc 𝐴)))
46	5, 45	sylbid 242	. 2 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 = (2o ·o 𝐴)) → (suc 𝐶 = (2o ·o 𝐵) → (𝐴 ∈ 𝐵 ∧ 𝐵 ∈ suc 𝐴)))
47	2, 46	mtod 200	1 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 = (2o ·o 𝐴)) → ¬ suc 𝐶 = (2o ·o 𝐵))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 208   ∧ wa 398   ∧ w3a 1083   = wceq 1537   ∈ wcel 2114  ∅c0 4293  Oncon0 6193  suc csuc 6195  (class class class)co 7158  1_oc1o 8097  2_oc2o 8098   +_o coa 8101   ·_o comu 8102

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2161  ax-12 2177  ax-ext 2795  ax-rep 5192  ax-sep 5205  ax-nul 5212  ax-pow 5268  ax-pr 5332  ax-un 7463

This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3or 1084  df-3an 1085  df-tru 1540  df-ex 1781  df-nf 1785  df-sb 2070  df-mo 2622  df-eu 2654  df-clab 2802  df-cleq 2816  df-clel 2895  df-nfc 2965  df-ne 3019  df-ral 3145  df-rex 3146  df-reu 3147  df-rab 3149  df-v 3498  df-sbc 3775  df-csb 3886  df-dif 3941  df-un 3943  df-in 3945  df-ss 3954  df-pss 3956  df-nul 4294  df-if 4470  df-pw 4543  df-sn 4570  df-pr 4572  df-tp 4574  df-op 4576  df-uni 4841  df-iun 4923  df-br 5069  df-opab 5131  df-mpt 5149  df-tr 5175  df-id 5462  df-eprel 5467  df-po 5476  df-so 5477  df-fr 5516  df-we 5518  df-xp 5563  df-rel 5564  df-cnv 5565  df-co 5566  df-dm 5567  df-rn 5568  df-res 5569  df-ima 5570  df-pred 6150  df-ord 6196  df-on 6197  df-lim 6198  df-suc 6199  df-iota 6316  df-fun 6359  df-fn 6360  df-f 6361  df-f1 6362  df-fo 6363  df-f1o 6364  df-fv 6365  df-ov 7161  df-oprab 7162  df-mpo 7163  df-om 7583  df-wrecs 7949  df-recs 8010  df-rdg 8048  df-1o 8104  df-2o 8105  df-oadd 8108  df-omul 8109

This theorem is referenced by: (None)