MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  oneo Structured version   Visualization version   GIF version

Theorem oneo 8592
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
StepHypRef Expression
1 onnbtwn 6459 . . 3 (𝐴 ∈ On → ¬ (𝐴 ∈ 𝐵 ∧ 𝐵 ∈ suc 𝐴))
213ad2ant1 1151 . 2 ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 = (2o ·o 𝐴)) → ¬ (𝐴 ∈ 𝐵 ∧ 𝐵 ∈ suc 𝐴))
3 suceq 6431 . . . . 5 (𝐶 = (2o ·o 𝐴) → suc 𝐶 = suc (2o ·o 𝐴))
43eqeq1d 2762 . . . 4 (𝐶 = (2o ·o 𝐴) → (suc 𝐶 = (2o ·o 𝐵) ↔ suc (2o ·o 𝐴) = (2o ·o 𝐵)))
543ad2ant3 1153 . . 3 ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 = (2o ·o 𝐴)) → (suc 𝐶 = (2o ·o 𝐵) ↔ suc (2o ·o 𝐴) = (2o ·o 𝐵)))
6 ovex 7453 . . . . . . . 8 (2o ·o 𝐴) ∈ V
76sucid 6447 . . . . . . 7 (2o ·o 𝐴) ∈ suc (2o ·o 𝐴)
8 eleq2 2849 . . . . . . 7 (suc (2o ·o 𝐴) = (2o ·o 𝐵) → ((2o ·o 𝐴) ∈ suc (2o ·o 𝐴) ↔ (2o ·o 𝐴) ∈ (2o ·o 𝐵)))
97, 8mpbii 236 . . . . . 6 (suc (2o ·o 𝐴) = (2o ·o 𝐵) → (2o ·o 𝐴) ∈ (2o ·o 𝐵))
10 2on 8493 . . . . . . . 8 2o ∈ On
11 omord 8579 . . . . . . . 8 ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 2o ∈ On) → ((𝐴 ∈ 𝐵 ∧ ∅ ∈ 2o) ↔ (2o ·o 𝐴) ∈ (2o ·o 𝐵)))
1210, 11mp3an3 1479 . . . . . . 7 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → ((𝐴 ∈ 𝐵 ∧ ∅ ∈ 2o) ↔ (2o ·o 𝐴) ∈ (2o ·o 𝐵)))
13 simpl 488 . . . . . . 7 ((𝐴 ∈ 𝐵 ∧ ∅ ∈ 2o) → 𝐴 ∈ 𝐵)
1412, 13biimtrrdi 257 . . . . . 6 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → ((2o ·o 𝐴) ∈ (2o ·o 𝐵) → 𝐴 ∈ 𝐵))
159, 14syl5 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 8547 . . . . . . . . . . . . 13 ((2o ∈ On ∧ 𝐴 ∈ On) → (2o ·o 𝐴) ∈ On)
1810, 17mpan 703 . . . . . . . . . . . 12 (𝐴 ∈ On → (2o ·o 𝐴) ∈ On)
19 oa1suc 8542 . . . . . . . . . . . 12 ((2o ·o 𝐴) ∈ On → ((2o ·o 𝐴) +o 1o) = suc (2o ·o 𝐴))
2018, 19syl 18 . . . . . . . . . . 11 (𝐴 ∈ On → ((2o ·o 𝐴) +o 1o) = suc (2o ·o 𝐴))
21 1oex 8489 . . . . . . . . . . . . . . 15 1o ∈ V
2221sucid 6447 . . . . . . . . . . . . . 14 1o ∈ suc 1o
23 df-2o 8480 . . . . . . . . . . . . . 14 2o = suc 1o
2422, 23eleqtrri 2859 . . . . . . . . . . . . 13 1o ∈ 2o
25 1on 8492 . . . . . . . . . . . . . 14 1o ∈ On
26 oaord 8558 . . . . . . . . . . . . . 14 ((1o ∈ On ∧ 2o ∈ On ∧ (2o ·o 𝐴) ∈ On) → (1o ∈ 2o ↔ ((2o ·o 𝐴) +o 1o) ∈ ((2o ·o 𝐴) +o 2o)))
2725, 10, 18, 26mp3an12i 1494 . . . . . . . . . . . . 13 (𝐴 ∈ On → (1o ∈ 2o ↔ ((2o ·o 𝐴) +o 1o) ∈ ((2o ·o 𝐴) +o 2o)))
2824, 27mpbii 236 . . . . . . . . . . . 12 (𝐴 ∈ On → ((2o ·o 𝐴) +o 1o) ∈ ((2o ·o 𝐴) +o 2o))
29 omsuc 8537 . . . . . . . . . . . . 13 ((2o ∈ On ∧ 𝐴 ∈ On) → (2o ·o suc 𝐴) = ((2o ·o 𝐴) +o 2o))
3010, 29mpan 703 . . . . . . . . . . . 12 (𝐴 ∈ On → (2o ·o suc 𝐴) = ((2o ·o 𝐴) +o 2o))
3128, 30eleqtrrd 2863 . . . . . . . . . . 11 (𝐴 ∈ On → ((2o ·o 𝐴) +o 1o) ∈ (2o ·o suc 𝐴))
3220, 31eqeltrrd 2861 . . . . . . . . . 10 (𝐴 ∈ On → suc (2o ·o 𝐴) ∈ (2o ·o suc 𝐴))
3332ad2antrr 739 . . . . . . . . 9 (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ suc (2o ·o 𝐴) = (2o ·o 𝐵)) → suc (2o ·o 𝐴) ∈ (2o ·o suc 𝐴))
3416, 33eqeltrrd 2861 . . . . . . . 8 (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ suc (2o ·o 𝐴) = (2o ·o 𝐵)) → (2o ·o 𝐵) ∈ (2o ·o suc 𝐴))
35 onsuc 7824 . . . . . . . . . . 11 (𝐴 ∈ On → suc 𝐴 ∈ On)
36 omord 8579 . . . . . . . . . . . 12 ((𝐵 ∈ On ∧ suc 𝐴 ∈ On ∧ 2o ∈ On) → ((𝐵 ∈ suc 𝐴 ∧ ∅ ∈ 2o) ↔ (2o ·o 𝐵) ∈ (2o ·o suc 𝐴)))
3710, 36mp3an3 1479 . . . . . . . . . . 11 ((𝐵 ∈ On ∧ suc 𝐴 ∈ On) → ((𝐵 ∈ suc 𝐴 ∧ ∅ ∈ 2o) ↔ (2o ·o 𝐵) ∈ (2o ·o suc 𝐴)))
3835, 37sylan2 605 . . . . . . . . . 10 ((𝐵 ∈ On ∧ 𝐴 ∈ On) → ((𝐵 ∈ suc 𝐴 ∧ ∅ ∈ 2o) ↔ (2o ·o 𝐵) ∈ (2o ·o suc 𝐴)))
3938ancoms 464 . . . . . . . . 9 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → ((𝐵 ∈ suc 𝐴 ∧ ∅ ∈ 2o) ↔ (2o ·o 𝐵) ∈ (2o ·o suc 𝐴)))
4039adantr 486 . . . . . . . 8 (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ suc (2o ·o 𝐴) = (2o ·o 𝐵)) → ((𝐵 ∈ suc 𝐴 ∧ ∅ ∈ 2o) ↔ (2o ·o 𝐵) ∈ (2o ·o suc 𝐴)))
4134, 40mpbird 260 . . . . . . 7 (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ suc (2o ·o 𝐴) = (2o ·o 𝐵)) → (𝐵 ∈ suc 𝐴 ∧ ∅ ∈ 2o))
4241simpld 500 . . . . . 6 (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ suc (2o ·o 𝐴) = (2o ·o 𝐵)) → 𝐵 ∈ suc 𝐴)
4342ex 418 . . . . 5 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (suc (2o ·o 𝐴) = (2o ·o 𝐵) → 𝐵 ∈ suc 𝐴))
4415, 43jcad 522 . . . 4 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (suc (2o ·o 𝐴) = (2o ·o 𝐵) → (𝐴 ∈ 𝐵 ∧ 𝐵 ∈ suc 𝐴)))
45443adant3 1150 . . 3 ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 = (2o ·o 𝐴)) → (suc (2o ·o 𝐴) = (2o ·o 𝐵) → (𝐴 ∈ 𝐵 ∧ 𝐵 ∈ suc 𝐴)))
465, 45sylbid 243 . 2 ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 = (2o ·o 𝐴)) → (suc 𝐶 = (2o ·o 𝐵) → (𝐴 ∈ 𝐵 ∧ 𝐵 ∈ suc 𝐴)))
472, 46mtod 201 1 ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 = (2o ·o 𝐴)) → ¬ suc 𝐶 = (2o ·o 𝐵))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1569   ∈ wcel 2144  ∅c0 4278  Oncon0 6362  suc csuc 6364  (class class class)co 7420  1oc1o 8472  2oc2o 8473   +o coa 8476   ·o comu 8477
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-rep 5231  ax-sep 5248  ax-nul 5259  ax-pr 5390  ax-un 7751
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3739  df-csb 3847  df-ss 3896  df-pss 4014  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-pw 4558  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-iun 4952  df-br 5103  df-opab 5167  df-mpt 5186  df-tr 5212  df-id 5545  df-eprel 5550  df-po 5558  df-so 5559  df-fr 5603  df-we 5605  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-rn 5661  df-res 5662  df-ima 5663  df-pred 6304  df-ord 6365  df-on 6366  df-lim 6367  df-suc 6368  df-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-f1 6543  df-fo 6544  df-f1o 6545  df-fv 6546  df-ov 7423  df-oprab 7424  df-mpo 7425  df-om 7878  df-2nd 8002  df-frecs 8302  df-wrecs 8333  df-recs 8382  df-rdg 8421  df-1o 8479  df-2o 8480  df-oadd 8483  df-omul 8484
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator