Theorem usgr1vr 16372

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 16312	. . . . . . . 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 2234	. . . . . . . 8 |- (Vtx ` G ) = (Vtx ` G )
4		eqid 2234	. . . . . . . 8 |- (Edg ` G ) = (Edg ` G )
5	3, 4	upgredg 16268	. . . . . . 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 537	. . . . . . . . . . . 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 546	. . . . . . . . . . . 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 2313	. . . . . . . . . . 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 3712	. . . . . . . . . . 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 538	. . . . . . . . . . . 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 2313	. . . . . . . . . . 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 3712	. . . . . . . . . . 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 2270	. . . . . . . . 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 544	. . . . . . . . . 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 536	. . . . . . . . . . 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 2312	. . . . . . . . . 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 16328	. . . . . . . . . . 11 |- ( ( G e. USGraph /\ { p , q } e. (Edg ` G ) ) -> p =/= q )
22	21	neneqd 2435	. . . . . . . . . 10 |- ( ( G e. USGraph /\ { p , q } e. (Edg ` G ) ) -> -. p = q )
23	17, 20, 22	syl2anc 411	. . . . . . . . 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 1418	. . . . . . . 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 2670	. . . . . 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 1417	. . . 4 |- ( ( ( A e. X /\ (Vtx ` G ) = { A } ) /\ G e. USGraph ) -> -. e e. (Edg ` G ) )
29	28	eq0rdv 3557	. . 3 |- ( ( ( A e. X /\ (Vtx ` G ) = { A } ) /\ G e. USGraph ) -> (Edg ` G ) = (/) )
30		usgruhgr 16313	. . . . 5 |- ( G e. USGraph -> G e. UHGraph )
31		uhgriedg0edg0 16259	. . . . 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 ) = (/) ) )

Syntax hints:   -. wn 3   -> wi 4   /\ wa 104   <-> wb 105   = wceq 1398   F. wfal 1403   e. wcel 2205   E.wrex 2523   (/)c0 3512   {csn 3694   {cpr 3695   ` cfv 5357  Vtxcvtx 16136  iEdgciedg 16137  Edgcedg 16181  UHGraphcuhgr 16191  UPGraphcupgr 16215  USGraphcusgr 16278

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-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-1rid 8250  ax-0id 8251  ax-rnegex 8252  ax-cnre 8254

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-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-br 4115  df-opab 4177  df-mpt 4178  df-tr 4214  df-id 4419  df-iord 4492  df-on 4494  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-1o 6660  df-2o 6661  df-er 6780  df-en 6989  df-sub 8463  df-inn 9258  df-2 9316  df-3 9317  df-4 9318  df-5 9319  df-6 9320  df-7 9321  df-8 9322  df-9 9323  df-n0 9517  df-dec 9731  df-ndx 13302  df-slot 13303  df-base 13305  df-edgf 16129  df-vtx 16138  df-iedg 16139  df-edg 16182  df-uhgrm 16193  df-upgren 16217  df-umgren 16218  df-uspgren 16279  df-usgren 16280

This theorem is referenced by: (None)