Theorem usgr1vr 16706

Description: A simple graph with one vertex has no edges. (Contributed by AV, 18-Oct-2020.) (Revised by AV, 21-Mar-2021.) (Proof shortened by AV, 2-Apr-2021.)

Assertion

Ref	Expression
usgr1vr	|- ( ( A e. X /\ (Vtx ` G ) = { A } ) -> ( G e. USGraph -> (iEdg ` G ) = (/) ) )

Proof of Theorem usgr1vr

Dummy variables e p q are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		usgrupgr 16646	. . . . . . . 8 |- ( G e. USGraph -> G e. UPGraph )
2	1	adantl 277	. . . . . . 7 |- ( ( ( A e. X /\ (Vtx ` G ) = { A } ) /\ G e. USGraph ) -> G e. UPGraph )
3		eqid 2238	. . . . . . . 8 |- (Vtx ` G ) = (Vtx ` G )
4		eqid 2238	. . . . . . . 8 |- (Edg ` G ) = (Edg ` G )
5	3, 4	upgredg 16602	. . . . . . 7 |- ( ( G e. UPGraph /\ e e. (Edg ` G ) ) -> E. p e. (Vtx ` G ) E. q e. (Vtx ` G ) e = { p , q } )
6	2, 5	sylan 283	. . . . . 6 |- ( ( ( ( A e. X /\ (Vtx ` G ) = { A } ) /\ G e. USGraph ) /\ e e. (Edg ` G ) ) -> E. p e. (Vtx ` G ) E. q e. (Vtx ` G ) e = { p , q } )
7		simplrl 541	. . . . . . . . . . . 12 |- ( ( ( ( ( ( A e. X /\ (Vtx ` G ) = { A } ) /\ G e. USGraph ) /\ e e. (Edg ` G ) ) /\ ( p e. (Vtx ` G ) /\ q e. (Vtx ` G ) ) ) /\ e = { p , q } ) -> p e. (Vtx ` G ) )
8		simp-5r 550	. . . . . . . . . . . 12 |- ( ( ( ( ( ( A e. X /\ (Vtx ` G ) = { A } ) /\ G e. USGraph ) /\ e e. (Edg ` G ) ) /\ ( p e. (Vtx ` G ) /\ q e. (Vtx ` G ) ) ) /\ e = { p , q } ) -> (Vtx ` G ) = { A } )
9	7, 8	eleqtrd 2317	. . . . . . . . . . 11 |- ( ( ( ( ( ( A e. X /\ (Vtx ` G ) = { A } ) /\ G e. USGraph ) /\ e e. (Edg ` G ) ) /\ ( p e. (Vtx ` G ) /\ q e. (Vtx ` G ) ) ) /\ e = { p , q } ) -> p e. { A } )
10		elsni 3727	. . . . . . . . . . 11 |- ( p e. { A } -> p = A )
11	9, 10	syl 14	. . . . . . . . . 10 |- ( ( ( ( ( ( A e. X /\ (Vtx ` G ) = { A } ) /\ G e. USGraph ) /\ e e. (Edg ` G ) ) /\ ( p e. (Vtx ` G ) /\ q e. (Vtx ` G ) ) ) /\ e = { p , q } ) -> p = A )
12		simplrr 542	. . . . . . . . . . . 12 |- ( ( ( ( ( ( A e. X /\ (Vtx ` G ) = { A } ) /\ G e. USGraph ) /\ e e. (Edg ` G ) ) /\ ( p e. (Vtx ` G ) /\ q e. (Vtx ` G ) ) ) /\ e = { p , q } ) -> q e. (Vtx ` G ) )
13	12, 8	eleqtrd 2317	. . . . . . . . . . 11 |- ( ( ( ( ( ( A e. X /\ (Vtx ` G ) = { A } ) /\ G e. USGraph ) /\ e e. (Edg ` G ) ) /\ ( p e. (Vtx ` G ) /\ q e. (Vtx ` G ) ) ) /\ e = { p , q } ) -> q e. { A } )
14		elsni 3727	. . . . . . . . . . 11 |- ( q e. { A } -> q = A )
15	13, 14	syl 14	. . . . . . . . . 10 |- ( ( ( ( ( ( A e. X /\ (Vtx ` G ) = { A } ) /\ G e. USGraph ) /\ e e. (Edg ` G ) ) /\ ( p e. (Vtx ` G ) /\ q e. (Vtx ` G ) ) ) /\ e = { p , q } ) -> q = A )
16	11, 15	eqtr4d 2274	. . . . . . . . 9 |- ( ( ( ( ( ( A e. X /\ (Vtx ` G ) = { A } ) /\ G e. USGraph ) /\ e e. (Edg ` G ) ) /\ ( p e. (Vtx ` G ) /\ q e. (Vtx ` G ) ) ) /\ e = { p , q } ) -> p = q )
17		simp-4r 548	. . . . . . . . . 10 |- ( ( ( ( ( ( A e. X /\ (Vtx ` G ) = { A } ) /\ G e. USGraph ) /\ e e. (Edg ` G ) ) /\ ( p e. (Vtx ` G ) /\ q e. (Vtx ` G ) ) ) /\ e = { p , q } ) -> G e. USGraph )
18		simpr 110	. . . . . . . . . . 11 |- ( ( ( ( ( ( A e. X /\ (Vtx ` G ) = { A } ) /\ G e. USGraph ) /\ e e. (Edg ` G ) ) /\ ( p e. (Vtx ` G ) /\ q e. (Vtx ` G ) ) ) /\ e = { p , q } ) -> e = { p , q } )
19		simpllr 540	. . . . . . . . . . 11 |- ( ( ( ( ( ( A e. X /\ (Vtx ` G ) = { A } ) /\ G e. USGraph ) /\ e e. (Edg ` G ) ) /\ ( p e. (Vtx ` G ) /\ q e. (Vtx ` G ) ) ) /\ e = { p , q } ) -> e e. (Edg ` G ) )
20	18, 19	eqeltrrd 2316	. . . . . . . . . 10 |- ( ( ( ( ( ( A e. X /\ (Vtx ` G ) = { A } ) /\ G e. USGraph ) /\ e e. (Edg ` G ) ) /\ ( p e. (Vtx ` G ) /\ q e. (Vtx ` G ) ) ) /\ e = { p , q } ) -> { p , q } e. (Edg ` G ) )
21	4	usgredgne 16662	. . . . . . . . . . 11 |- ( ( G e. USGraph /\ { p , q } e. (Edg ` G ) ) -> p =/= q )
22	21	neneqd 2441	. . . . . . . . . 10 |- ( ( G e. USGraph /\ { p , q } e. (Edg ` G ) ) -> -. p = q )
23	17, 20, 22	syl2anc 415	. . . . . . . . 9 |- ( ( ( ( ( ( A e. X /\ (Vtx ` G ) = { A } ) /\ G e. USGraph ) /\ e e. (Edg ` G ) ) /\ ( p e. (Vtx ` G ) /\ q e. (Vtx ` G ) ) ) /\ e = { p , q } ) -> -. p = q )
24	16, 23	pm2.21fal 1422	. . . . . . . 8 |- ( ( ( ( ( ( A e. X /\ (Vtx ` G ) = { A } ) /\ G e. USGraph ) /\ e e. (Edg ` G ) ) /\ ( p e. (Vtx ` G ) /\ q e. (Vtx ` G ) ) ) /\ e = { p , q } ) -> F. )
25	24	ex 115	. . . . . . 7 |- ( ( ( ( ( A e. X /\ (Vtx ` G ) = { A } ) /\ G e. USGraph ) /\ e e. (Edg ` G ) ) /\ ( p e. (Vtx ` G ) /\ q e. (Vtx ` G ) ) ) -> ( e = { p , q } -> F. ) )
26	25	rexlimdvva 2676	. . . . . 6 |- ( ( ( ( A e. X /\ (Vtx ` G ) = { A } ) /\ G e. USGraph ) /\ e e. (Edg ` G ) ) -> ( E. p e. (Vtx ` G ) E. q e. (Vtx ` G ) e = { p , q } -> F. ) )
27	6, 26	mpd 13	. . . . 5 |- ( ( ( ( A e. X /\ (Vtx ` G ) = { A } ) /\ G e. USGraph ) /\ e e. (Edg ` G ) ) -> F. )
28	27	inegd 1421	. . . 4 |- ( ( ( A e. X /\ (Vtx ` G ) = { A } ) /\ G e. USGraph ) -> -. e e. (Edg ` G ) )
29	28	eq0rdv 3571	. . 3 |- ( ( ( A e. X /\ (Vtx ` G ) = { A } ) /\ G e. USGraph ) -> (Edg ` G ) = (/) )
30		usgruhgr 16647	. . . . 5 |- ( G e. USGraph -> G e. UHGraph )
31		uhgriedg0edg0 16593	. . . . 5 |- ( G e. UHGraph -> ( (Edg ` G ) = (/) <-> (iEdg ` G ) = (/) ) )
32	30, 31	syl 14	. . . 4 |- ( G e. USGraph -> ( (Edg ` G ) = (/) <-> (iEdg ` G ) = (/) ) )
33	32	adantl 277	. . 3 |- ( ( ( A e. X /\ (Vtx ` G ) = { A } ) /\ G e. USGraph ) -> ( (Edg ` G ) = (/) <-> (iEdg ` G ) = (/) ) )
34	29, 33	mpbid 147	. 2 |- ( ( ( A e. X /\ (Vtx ` G ) = { A } ) /\ G e. USGraph ) -> (iEdg ` G ) = (/) )
35	34	ex 115	1 |- ( ( A e. X /\ (Vtx ` G ) = { A } ) -> ( G e. USGraph -> (iEdg ` G ) = (/) ) )

This proof depends on syntax axioms:   -. wn 3   -> wi 4   /\ wa 104   <-> wb 105   = wceq 1402   F. wfal 1407   e. wcel 2209   E.wrex 2529   (/)c0 3520   {csn 3709   {cpr 3710   ` cfv 5380  Vtxcvtx 16470  iEdgciedg 16471  Edgcedg 16515  UHGraphcuhgr 16525  UPGraphcupgr 16549  USGraphcusgr 16612

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4251  ax-nul 4261  ax-pow 4313  ax-pr 4348  ax-un 4580  ax-setind 4686  ax-iinf 4737  ax-cnex 8277  ax-resscn 8278  ax-1cn 8279  ax-1re 8280  ax-icn 8281  ax-addcl 8282  ax-addrcl 8283  ax-mulcl 8284  ax-addcom 8286  ax-mulcom 8287  ax-addass 8288  ax-mulass 8289  ax-distr 8290  ax-i2m1 8291  ax-1rid 8293  ax-0id 8294  ax-rnegex 8295  ax-cnre 8297

This proof depends on definitions:  df-bi 117  df-dc 847  df-3or 1010  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-ral 2533  df-rex 2534  df-reu 2535  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-if 3639  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-br 4132  df-opab 4194  df-mpt 4195  df-tr 4232  df-id 4440  df-iord 4513  df-on 4515  df-suc 4518  df-iom 4740  df-xp 4782  df-rel 4783  df-cnv 4784  df-co 4785  df-dm 4786  df-rn 4787  df-res 4788  df-ima 4789  df-iota 5340  df-fun 5382  df-fn 5383  df-f 5384  df-f1 5385  df-fo 5386  df-f1o 5387  df-fv 5388  df-riota 6041  df-ov 6091  df-oprab 6092  df-mpo 6093  df-1st 6378  df-2nd 6379  df-1o 6691  df-2o 6692  df-er 6811  df-en 7028  df-sub 8507  df-inn 9315  df-2 9373  df-3 9374  df-4 9375  df-5 9376  df-6 9377  df-7 9378  df-8 9379  df-9 9380  df-n0 9576  df-dec 9790  df-ndx 13414  df-slot 13415  df-base 13417  df-edgf 16463  df-vtx 16472  df-iedg 16473  df-edg 16516  df-uhgrm 16527  df-upgren 16551  df-umgren 16552  df-uspgren 16613  df-usgren 16614

This theorem is used by: (None)