Theorem sucevenodd 4510

Description: The successor of an even natural is odd. (Contributed by SF, 20-Jan-2015.)

Assertion

Ref	Expression
sucevenodd	|- ((A e. Evenfin /\ (A +o 1c) =/= (/)) -> (A +o 1c) e. Oddfin )

Proof of Theorem sucevenodd

Dummy variables m x are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		eqeq1 2359	. . . . . . . 8 |- (x = A -> (x = (m +o m) <-> A = (m +o m)))
2	1	rexbidv 2635	. . . . . . 7 |- (x = A -> (E.m e. Nn x = (m +o m) <-> E.m e. Nn A = (m +o m)))
3		neeq1 2524	. . . . . . 7 |- (x = A -> (x =/= (/) <-> A =/= (/)))
4	2, 3	anbi12d 691	. . . . . 6 |- (x = A -> ((E.m e. Nn x = (m +o m) /\ x =/= (/)) <-> (E.m e. Nn A = (m +o m) /\ A =/= (/))))
5		df-evenfin 4444	. . . . . 6 |- Evenfin = {x | (E.m e. Nn x = (m +o m) /\ x =/= (/))}
6	4, 5	elab2g 2987	. . . . 5 |- (A e. Evenfin -> (A e. Evenfin <-> (E.m e. Nn A = (m +o m) /\ A =/= (/))))
7	6	ibi 232	. . . 4 |- (A e. Evenfin -> (E.m e. Nn A = (m +o m) /\ A =/= (/)))
8		addceq1 4383	. . . . . 6 |- (A = (m +o m) -> (A +o 1c) = ((m +o m) +o 1c))
9	8	reximi 2721	. . . . 5 |- (E.m e. Nn A = (m +o m) -> E.m e. Nn (A +o 1c) = ((m +o m) +o 1c))
10	9	adantr 451	. . . 4 |- ((E.m e. Nn A = (m +o m) /\ A =/= (/)) -> E.m e. Nn (A +o 1c) = ((m +o m) +o 1c))
11	7, 10	syl 15	. . 3 |- (A e. Evenfin -> E.m e. Nn (A +o 1c) = ((m +o m) +o 1c))
12	11	anim1i 551	. 2 |- ((A e. Evenfin /\ (A +o 1c) =/= (/)) -> (E.m e. Nn (A +o 1c) = ((m +o m) +o 1c) /\ (A +o 1c) =/= (/)))
13		1cex 4142	. . . . 5 |- 1c e. _V
14		addcexg 4393	. . . . 5 |- ((A e. Evenfin /\ 1c e. _V) -> (A +o 1c) e. _V)
15	13, 14	mpan2 652	. . . 4 |- (A e. Evenfin -> (A +o 1c) e. _V)
16		eqeq1 2359	. . . . . . 7 |- (x = (A +o 1c) -> (x = ((m +o m) +o 1c) <-> (A +o 1c) = ((m +o m) +o 1c)))
17	16	rexbidv 2635	. . . . . 6 |- (x = (A +o 1c) -> (E.m e. Nn x = ((m +o m) +o 1c) <-> E.m e. Nn (A +o 1c) = ((m +o m) +o 1c)))
18		neeq1 2524	. . . . . 6 |- (x = (A +o 1c) -> (x =/= (/) <-> (A +o 1c) =/= (/)))
19	17, 18	anbi12d 691	. . . . 5 |- (x = (A +o 1c) -> ((E.m e. Nn x = ((m +o m) +o 1c) /\ x =/= (/)) <-> (E.m e. Nn (A +o 1c) = ((m +o m) +o 1c) /\ (A +o 1c) =/= (/))))
20		df-oddfin 4445	. . . . 5 |- Oddfin = {x | (E.m e. Nn x = ((m +o m) +o 1c) /\ x =/= (/))}
21	19, 20	elab2g 2987	. . . 4 |- ((A +o 1c) e. _V -> ((A +o 1c) e. Oddfin <-> (E.m e. Nn (A +o 1c) = ((m +o m) +o 1c) /\ (A +o 1c) =/= (/))))
22	15, 21	syl 15	. . 3 |- (A e. Evenfin -> ((A +o 1c) e. Oddfin <-> (E.m e. Nn (A +o 1c) = ((m +o m) +o 1c) /\ (A +o 1c) =/= (/))))
23	22	adantr 451	. 2 |- ((A e. Evenfin /\ (A +o 1c) =/= (/)) -> ((A +o 1c) e. Oddfin <-> (E.m e. Nn (A +o 1c) = ((m +o m) +o 1c) /\ (A +o 1c) =/= (/))))
24	12, 23	mpbird 223	1 |- ((A e. Evenfin /\ (A +o 1c) =/= (/)) -> (A +o 1c) e. Oddfin )

Syntax hints:   -> wi 4   <-> wb 176   /\ wa 358   = wceq 1642   e. wcel 1710   =/= wne 2516  E.wrex 2615  _Vcvv 2859  (/)c0 3550  1_cc1c 4134   Nn cnnc 4373   +o cplc 4375   Even_fin cevenfin 4436   Odd_fin coddfin 4437

This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1546  ax-5 1557  ax-17 1616  ax-9 1654  ax-8 1675  ax-6 1729  ax-7 1734  ax-11 1746  ax-12 1925  ax-ext 2334  ax-nin 4078  ax-xp 4079  ax-cnv 4080  ax-1c 4081  ax-sset 4082  ax-si 4083  ax-ins2 4084  ax-ins3 4085  ax-typlower 4086  ax-sn 4087

This theorem depends on definitions:  df-bi 177  df-or 359  df-an 360  df-3an 936  df-nan 1288  df-tru 1319  df-ex 1542  df-nf 1545  df-sb 1649  df-clab 2340  df-cleq 2346  df-clel 2349  df-nfc 2478  df-ne 2518  df-ral 2619  df-rex 2620  df-v 2861  df-nin 3211  df-compl 3212  df-in 3213  df-un 3214  df-dif 3215  df-symdif 3216  df-ss 3259  df-nul 3551  df-pw 3724  df-sn 3741  df-pr 3742  df-opk 4058  df-1c 4136  df-pw1 4137  df-xpk 4185  df-cnvk 4186  df-ins2k 4187  df-ins3k 4188  df-imak 4189  df-p6 4191  df-sik 4192  df-ssetk 4193  df-addc 4378  df-evenfin 4444  df-oddfin 4445

This theorem is referenced by:  evenoddnnnul  4514  vinf  4555