Theorem vdegp1bid 16436

Description: The induction step for a vertex degree calculation, for example in the Königsberg graph. If the degree of U in the edge set E is P, then adding { U , X } to the edge set, where X =/= U, yields degree P + 1. (Contributed by Mario Carneiro, 12-Mar-2015.) (Revised by Mario Carneiro, 28-Feb-2016.) (Revised by AV, 3-Mar-2021.)

Hypotheses

Ref	Expression
vdegp1ai.vg	|- V = (Vtx ` G )
vdegp1aid.u	|- ( ph -> U e. V )
vdegp1ai.i	|- I = (iEdg ` G )
vdegp1aid.w	|- ( ph -> I e. Word { x e. ~P V | ( x ~~ 1o \/ x ~~ 2o ) } )
vdegp1aid.d	|- ( ph -> ( (VtxDeg ` G ) ` U ) = P )
vdegp1aid.vf	|- ( ph -> (Vtx ` F ) = V )
vdegp1aid.fi	|- ( ph -> V e. Fin )
vdegp1bid.x	|- ( ph -> X e. V )
vdegp1bid.xu	|- ( ph -> X =/= U )
vdegp1bid.f	|- ( ph -> (iEdg ` F ) = ( I ++ <" { U , X } "> ) )

Assertion

Ref	Expression
vdegp1bid	|- ( ph -> ( (VtxDeg ` F ) ` U ) = ( P + 1 ) )

Distinct variable groups:   x, U   x, V   x, X   x, G

Allowed substitution hints:   ph( x)   P( x)   F( x)   I( x)

Proof of Theorem vdegp1bid

Step	Hyp	Ref	Expression
1		vdegp1ai.vg	. . 3 |- V = (Vtx ` G )
2		vdegp1ai.i	. . 3 |- I = (iEdg ` G )
3		vdegp1aid.w	. . . . 5 |- ( ph -> I e. Word { x e. ~P V | ( x ~~ 1o \/ x ~~ 2o ) } )
4		wrdf 11255	. . . . 5 |- ( I e. Word { x e. ~P V | ( x ~~ 1o \/ x ~~ 2o ) } -> I : ( 0..^ (♯ ` I ) ) --> { x e. ~P V | ( x ~~ 1o \/ x ~~ 2o ) } )
5	3, 4	syl 14	. . . 4 |- ( ph -> I : ( 0..^ (♯ ` I ) ) --> { x e. ~P V | ( x ~~ 1o \/ x ~~ 2o ) } )
6	5	ffund 5517	. . 3 |- ( ph -> Fun I )
7		vdegp1aid.vf	. . 3 |- ( ph -> (Vtx ` F ) = V )
8		vdegp1bid.f	. . . 4 |- ( ph -> (iEdg ` F ) = ( I ++ <" { U , X } "> ) )
9		wrdv 11265	. . . . . 6 |- ( I e. Word { x e. ~P V | ( x ~~ 1o \/ x ~~ 2o ) } -> I e. Word _V )
10	3, 9	syl 14	. . . . 5 |- ( ph -> I e. Word _V )
11		vdegp1aid.u	. . . . . 6 |- ( ph -> U e. V )
12		vdegp1bid.x	. . . . . 6 |- ( ph -> X e. V )
13		prexg 4330	. . . . . 6 |- ( ( U e. V /\ X e. V ) -> { U , X } e. _V )
14	11, 12, 13	syl2anc 411	. . . . 5 |- ( ph -> { U , X } e. _V )
15		cats1un 11438	. . . . 5 |- ( ( I e. Word _V /\ { U , X } e. _V ) -> ( I ++ <" { U , X } "> ) = ( I u. { <. (♯ ` I ) , { U , X } >. } ) )
16	10, 14, 15	syl2anc 411	. . . 4 |- ( ph -> ( I ++ <" { U , X } "> ) = ( I u. { <. (♯ ` I ) , { U , X } >. } ) )
17	8, 16	eqtrd 2267	. . 3 |- ( ph -> (iEdg ` F ) = ( I u. { <. (♯ ` I ) , { U , X } >. } ) )
18		lencl 11253	. . . 4 |- ( I e. Word { x e. ~P V | ( x ~~ 1o \/ x ~~ 2o ) } -> (♯ ` I ) e. NN0 )
19	3, 18	syl 14	. . 3 |- ( ph -> (♯ ` I ) e. NN0 )
20		wrdlndm 11266	. . . 4 |- ( I e. Word { x e. ~P V | ( x ~~ 1o \/ x ~~ 2o ) } -> (♯ ` I ) e/ dom I )
21	3, 20	syl 14	. . 3 |- ( ph -> (♯ ` I ) e/ dom I )
22		vdegp1aid.fi	. . 3 |- ( ph -> V e. Fin )
23	1	1vgrex 16141	. . . . . 6 |- ( U e. V -> G e. _V )
24	11, 23	syl 14	. . . . 5 |- ( ph -> G e. _V )
25	1, 2	wrdupgren 16217	. . . . 5 |- ( ( G e. _V /\ I e. Word { x e. ~P V | ( x ~~ 1o \/ x ~~ 2o ) } ) -> ( G e. UPGraph <-> I e. Word { x e. ~P V | ( x ~~ 1o \/ x ~~ 2o ) } ) )
26	24, 3, 25	syl2anc 411	. . . 4 |- ( ph -> ( G e. UPGraph <-> I e. Word { x e. ~P V | ( x ~~ 1o \/ x ~~ 2o ) } ) )
27	3, 26	mpbird 167	. . 3 |- ( ph -> G e. UPGraph )
28		wrddm 11257	. . . . 5 |- ( I e. Word { x e. ~P V | ( x ~~ 1o \/ x ~~ 2o ) } -> dom I = ( 0..^ (♯ ` I ) ) )
29	3, 28	syl 14	. . . 4 |- ( ph -> dom I = ( 0..^ (♯ ` I ) ) )
30		0z 9605	. . . . 5 |- 0 e. ZZ
31	19	nn0zd 9716	. . . . 5 |- ( ph -> (♯ ` I ) e. ZZ )
32		fzofig 10818	. . . . 5 |- ( ( 0 e. ZZ /\ (♯ ` I ) e. ZZ ) -> ( 0..^ (♯ ` I ) ) e. Fin )
33	30, 31, 32	sylancr 414	. . . 4 |- ( ph -> ( 0..^ (♯ ` I ) ) e. Fin )
34	29, 33	eqeltrd 2311	. . 3 |- ( ph -> dom I e. Fin )
35		prelpwi 4335	. . . 4 |- ( ( U e. V /\ X e. V ) -> { U , X } e. ~P V )
36	11, 12, 35	syl2anc 411	. . 3 |- ( ph -> { U , X } e. ~P V )
37		vdegp1bid.xu	. . . . 5 |- ( ph -> X =/= U )
38	37	necomd 2500	. . . 4 |- ( ph -> U =/= X )
39		pr2ne 7502	. . . . 5 |- ( ( U e. V /\ X e. V ) -> ( { U , X } ~~ 2o <-> U =/= X ) )
40	11, 12, 39	syl2anc 411	. . . 4 |- ( ph -> ( { U , X } ~~ 2o <-> U =/= X ) )
41	38, 40	mpbird 167	. . 3 |- ( ph -> { U , X } ~~ 2o )
42		prid1g 3800	. . . 4 |- ( U e. V -> U e. { U , X } )
43	11, 42	syl 14	. . 3 |- ( ph -> U e. { U , X } )
44	1, 2, 6, 7, 17, 19, 21, 11, 22, 27, 34, 36, 41, 43	p1evtxdp1fi 16434	. 2 |- ( ph -> ( (VtxDeg ` F ) ` U ) = ( ( (VtxDeg ` G ) ` U ) + 1 ) )
45		vdegp1aid.d	. . 3 |- ( ph -> ( (VtxDeg ` G ) ` U ) = P )
46	45	oveq1d 6073	. 2 |- ( ph -> ( ( (VtxDeg ` G ) ` U ) + 1 ) = ( P + 1 ) )
47	44, 46	eqtrd 2267	1 |- ( ph -> ( (VtxDeg ` F ) ` U ) = ( P + 1 ) )

Syntax hints:   -> wi 4   <-> wb 105   \/ wo 716   = wceq 1398   e. wcel 2205   =/= wne 2414   e/ wnel 2509   {crab 2526   _Vcvv 2815   u. cun 3212   ~Pcpw 3674   {csn 3694   {cpr 3695   <.cop 3697   class class class wbr 4114   dom cdm 4754   -->wf 5353   ` cfv 5357  (class class class)co 6058   1oc1o 6653   2oc2o 6654   ~~ cen 6986   Fincfn 6988   0cc0 8143   1c1 8144   + caddc 8146   NN0cn0 9513   ZZcz 9594  ..^cfzo 10498  ♯chash 11163  Word cword 11249   ++ cconcat 11303   <"cs1 11328  Vtxcvtx 16133  iEdgciedg 16134  UPGraphcupgr 16212  VtxDegcvtxdg 16407

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2207  ax-14 2208  ax-ext 2216  ax-coll 4230  ax-sep 4233  ax-nul 4241  ax-pow 4292  ax-pr 4327  ax-un 4559  ax-setind 4664  ax-iinf 4715  ax-cnex 8234  ax-resscn 8235  ax-1cn 8236  ax-1re 8237  ax-icn 8238  ax-addcl 8239  ax-addrcl 8240  ax-mulcl 8241  ax-addcom 8243  ax-mulcom 8244  ax-addass 8245  ax-mulass 8246  ax-distr 8247  ax-i2m1 8248  ax-0lt1 8249  ax-1rid 8250  ax-0id 8251  ax-rnegex 8252  ax-cnre 8254  ax-pre-ltirr 8255  ax-pre-ltwlin 8256  ax-pre-lttrn 8257  ax-pre-apti 8258  ax-pre-ltadd 8259

This theorem depends on definitions:  df-bi 117  df-dc 843  df-3or 1006  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1812  df-eu 2085  df-mo 2086  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ne 2415  df-nel 2510  df-ral 2527  df-rex 2528  df-reu 2529  df-rab 2531  df-v 2817  df-sbc 3046  df-csb 3142  df-dif 3216  df-un 3218  df-in 3220  df-ss 3227  df-nul 3513  df-if 3625  df-pw 3676  df-sn 3700  df-pr 3701  df-op 3703  df-uni 3920  df-int 3955  df-iun 3998  df-br 4115  df-opab 4177  df-mpt 4178  df-tr 4214  df-id 4419  df-iord 4492  df-on 4494  df-ilim 4495  df-suc 4497  df-iom 4718  df-xp 4760  df-rel 4761  df-cnv 4762  df-co 4763  df-dm 4764  df-rn 4765  df-res 4766  df-ima 4767  df-iota 5317  df-fun 5359  df-fn 5360  df-f 5361  df-f1 5362  df-fo 5363  df-f1o 5364  df-fv 5365  df-riota 6011  df-ov 6061  df-oprab 6062  df-mpo 6063  df-1st 6347  df-2nd 6348  df-recs 6549  df-irdg 6614  df-frec 6635  df-1o 6660  df-2o 6661  df-oadd 6664  df-er 6780  df-en 6989  df-dom 6990  df-fin 6991  df-pnf 8326  df-mnf 8327  df-xr 8328  df-ltxr 8329  df-le 8330  df-sub 8462  df-neg 8463  df-inn 9255  df-2 9313  df-3 9314  df-4 9315  df-5 9316  df-6 9317  df-7 9318  df-8 9319  df-9 9320  df-n0 9514  df-z 9595  df-dec 9728  df-uz 9872  df-xadd 10125  df-fz 10362  df-fzo 10499  df-ihash 11164  df-word 11250  df-concat 11304  df-s1 11329  df-ndx 13299  df-slot 13300  df-base 13302  df-edgf 16126  df-vtx 16135  df-iedg 16136  df-upgren 16214  df-umgren 16215  df-vtxdg 16408

This theorem is referenced by:  vdegp1cid  16437  konigsberglem1  16609  konigsberglem2  16610