Theorem edgssv2en 16181

Description: An edge of a simple graph is a proper unordered pair of vertices, i.e. a subset of the set of vertices of size 2. (Contributed by AV, 10-Jan-2020.) (Revised by AV, 23-Oct-2020.)

Hypotheses

Ref	Expression
edgssv2.v	|- V = (Vtx ` G )
edgssv2.e	|- E = (Edg ` G )

Assertion

Ref	Expression
edgssv2en	|- ( ( G e. USGraph /\ C e. E ) -> ( C C_ V /\ C ~~ 2o ) )

Proof of Theorem edgssv2en

Step	Hyp	Ref	Expression
1		edgssv2.e	. . . . 5 |- E = (Edg ` G )
2	1	eleq2i 2299	. . . 4 |- ( C e. E <-> C e. (Edg ` G ) )
3		edgusgren 16145	. . . 4 |- ( ( G e. USGraph /\ C e. (Edg ` G ) ) -> ( C e. ~P (Vtx ` G ) /\ C ~~ 2o ) )
4	2, 3	sylan2b 287	. . 3 |- ( ( G e. USGraph /\ C e. E ) -> ( C e. ~P (Vtx ` G ) /\ C ~~ 2o ) )
5		elpwi 3677	. . . 4 |- ( C e. ~P (Vtx ` G ) -> C C_ (Vtx ` G ) )
6	5	anim1i 340	. . 3 |- ( ( C e. ~P (Vtx ` G ) /\ C ~~ 2o ) -> ( C C_ (Vtx ` G ) /\ C ~~ 2o ) )
7	4, 6	syl 14	. 2 |- ( ( G e. USGraph /\ C e. E ) -> ( C C_ (Vtx ` G ) /\ C ~~ 2o ) )
8		edgssv2.v	. . . . 5 |- V = (Vtx ` G )
9	8	a1i 9	. . . 4 |- ( ( G e. USGraph /\ C e. E ) -> V = (Vtx ` G ) )
10	9	sseq2d 3267	. . 3 |- ( ( G e. USGraph /\ C e. E ) -> ( C C_ V <-> C C_ (Vtx ` G ) ) )
11	10	anbi1d 465	. 2 |- ( ( G e. USGraph /\ C e. E ) -> ( ( C C_ V /\ C ~~ 2o ) <-> ( C C_ (Vtx ` G ) /\ C ~~ 2o ) ) )
12	7, 11	mpbird 167	1 |- ( ( G e. USGraph /\ C e. E ) -> ( C C_ V /\ C ~~ 2o ) )

Syntax hints:   -> wi 4   /\ wa 104   = wceq 1398   e. wcel 2203   C_ wss 3210   ~Pcpw 3668   class class class wbr 4108   ` cfv 5351   2oc2o 6640   ~~ cen 6972  Vtxcvtx 15994  Edgcedg 16039  USGraphcusgr 16136

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 2205  ax-14 2206  ax-ext 2214  ax-sep 4227  ax-pow 4286  ax-pr 4321  ax-un 4553  ax-setind 4658  ax-cnex 8214  ax-resscn 8215  ax-1cn 8216  ax-1re 8217  ax-icn 8218  ax-addcl 8219  ax-addrcl 8220  ax-mulcl 8221  ax-addcom 8223  ax-mulcom 8224  ax-addass 8225  ax-mulass 8226  ax-distr 8227  ax-i2m1 8228  ax-1rid 8230  ax-0id 8231  ax-rnegex 8232  ax-cnre 8234

This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1812  df-eu 2083  df-mo 2084  df-clab 2219  df-cleq 2225  df-clel 2228  df-nfc 2373  df-ne 2413  df-ral 2525  df-rex 2526  df-reu 2527  df-rab 2529  df-v 2814  df-sbc 3042  df-csb 3138  df-dif 3212  df-un 3214  df-in 3216  df-ss 3223  df-if 3620  df-pw 3670  df-sn 3694  df-pr 3695  df-op 3697  df-uni 3914  df-int 3949  df-br 4109  df-opab 4171  df-mpt 4172  df-id 4413  df-xp 4754  df-rel 4755  df-cnv 4756  df-co 4757  df-dm 4758  df-rn 4759  df-res 4760  df-iota 5311  df-fun 5353  df-fn 5354  df-f 5355  df-f1 5356  df-fo 5357  df-fv 5359  df-riota 6002  df-ov 6052  df-oprab 6053  df-mpo 6054  df-1st 6333  df-2nd 6334  df-sub 8442  df-inn 9234  df-2 9292  df-3 9293  df-4 9294  df-5 9295  df-6 9296  df-7 9297  df-8 9298  df-9 9299  df-n0 9493  df-dec 9706  df-ndx 13204  df-slot 13205  df-base 13207  df-edgf 15987  df-vtx 15996  df-iedg 15997  df-edg 16040  df-usgren 16138

This theorem is referenced by: (None)