Theorem umgredgprv 16236

Description: In a multigraph, an edge is an unordered pair of vertices. This theorem would not hold for arbitrary hyper-/pseudographs since either M or N could be proper classes ( ( E ` X ) would be a loop in this case), which are no vertices of course. (Contributed by Alexander van der Vekens, 19-Aug-2017.) (Revised by AV, 11-Dec-2020.)

Hypotheses

Ref	Expression
umgrnloopv.e	|- E = (iEdg ` G )
umgredgprv.v	|- V = (Vtx ` G )

Assertion

Ref	Expression
umgredgprv	|- ( ( G e. UMGraph /\ X e. dom E ) -> ( ( E ` X ) = { M , N } -> ( M e. V /\ N e. V ) ) )

Proof of Theorem umgredgprv

Step	Hyp	Ref	Expression
1		simpr 110	. . . 4 |- ( ( ( G e. UMGraph /\ X e. dom E ) /\ ( E ` X ) = { M , N } ) -> ( E ` X ) = { M , N } )
2		umgruhgr 16234	. . . . . 6 |- ( G e. UMGraph -> G e. UHGraph )
3		umgredgprv.v	. . . . . . 7 |- V = (Vtx ` G )
4		umgrnloopv.e	. . . . . . 7 |- E = (iEdg ` G )
5	3, 4	uhgrss 16196	. . . . . 6 |- ( ( G e. UHGraph /\ X e. dom E ) -> ( E ` X ) C_ V )
6	2, 5	sylan 283	. . . . 5 |- ( ( G e. UMGraph /\ X e. dom E ) -> ( E ` X ) C_ V )
7	6	adantr 276	. . . 4 |- ( ( ( G e. UMGraph /\ X e. dom E ) /\ ( E ` X ) = { M , N } ) -> ( E ` X ) C_ V )
8	1, 7	eqsstrrd 3279	. . 3 |- ( ( ( G e. UMGraph /\ X e. dom E ) /\ ( E ` X ) = { M , N } ) -> { M , N } C_ V )
9	3, 4	umgredg2en 16230	. . . . . . 7 |- ( ( G e. UMGraph /\ X e. dom E ) -> ( E ` X ) ~~ 2o )
10	9	adantr 276	. . . . . 6 |- ( ( ( G e. UMGraph /\ X e. dom E ) /\ ( E ` X ) = { M , N } ) -> ( E ` X ) ~~ 2o )
11	1, 10	eqbrtrrd 4138	. . . . 5 |- ( ( ( G e. UMGraph /\ X e. dom E ) /\ ( E ` X ) = { M , N } ) -> { M , N } ~~ 2o )
12		pr2cv 7507	. . . . 5 |- ( { M , N } ~~ 2o -> ( M e. _V /\ N e. _V ) )
13	11, 12	syl 14	. . . 4 |- ( ( ( G e. UMGraph /\ X e. dom E ) /\ ( E ` X ) = { M , N } ) -> ( M e. _V /\ N e. _V ) )
14		prid1g 3800	. . . . 5 |- ( M e. _V -> M e. { M , N } )
15		prid2g 3801	. . . . 5 |- ( N e. _V -> N e. { M , N } )
16	14, 15	anim12i 338	. . . 4 |- ( ( M e. _V /\ N e. _V ) -> ( M e. { M , N } /\ N e. { M , N } ) )
17		prssg 3856	. . . 4 |- ( ( M e. { M , N } /\ N e. { M , N } ) -> ( ( M e. V /\ N e. V ) <-> { M , N } C_ V ) )
18	13, 16, 17	3syl 17	. . 3 |- ( ( ( G e. UMGraph /\ X e. dom E ) /\ ( E ` X ) = { M , N } ) -> ( ( M e. V /\ N e. V ) <-> { M , N } C_ V ) )
19	8, 18	mpbird 167	. 2 |- ( ( ( G e. UMGraph /\ X e. dom E ) /\ ( E ` X ) = { M , N } ) -> ( M e. V /\ N e. V ) )
20	19	ex 115	1 |- ( ( G e. UMGraph /\ X e. dom E ) -> ( ( E ` X ) = { M , N } -> ( M e. V /\ N e. V ) ) )

Syntax hints:   -> wi 4   /\ wa 104   <-> wb 105   = wceq 1398   e. wcel 2205   _Vcvv 2815   C_ wss 3214   {cpr 3695   class class class wbr 4114   dom cdm 4754   ` cfv 5357   2oc2o 6654   ~~ cen 6986  Vtxcvtx 16133  iEdgciedg 16134  UHGraphcuhgr 16188  UMGraphcumgr 16213

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-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-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-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 8462  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-dec 9728  df-ndx 13299  df-slot 13300  df-base 13302  df-edgf 16126  df-vtx 16135  df-iedg 16136  df-uhgrm 16190  df-upgren 16214  df-umgren 16215

This theorem is referenced by:  umgrnloop  16237  usgredgprv  16317