Theorem upgrm 16021

Description: An edge is an inhabited subset of vertices. (Contributed by Mario Carneiro, 11-Mar-2015.) (Revised by AV, 10-Oct-2020.)

Hypotheses

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

Assertion

Ref	Expression
upgrm	|- ( ( G e. UPGraph /\ E Fn A /\ F e. A ) -> E. j j e. ( E ` F ) )

Distinct variable groups:   j, E   j, F

Allowed substitution hints:   A( j)   G( j)   V( j)

Proof of Theorem upgrm

Dummy variable x is distinct from all other variables.

Step	Hyp	Ref	Expression
1		isupgr.v	. . . . . 6 |- V = (Vtx ` G )
2		isupgr.e	. . . . . 6 |- E = (iEdg ` G )
3	1, 2	upgrfnen 16019	. . . . 5 |- ( ( G e. UPGraph /\ E Fn A ) -> E : A --> { x e. ~P V | ( x ~~ 1o \/ x ~~ 2o ) } )
4	3	ffvelcdmda 5790	. . . 4 |- ( ( ( G e. UPGraph /\ E Fn A ) /\ F e. A ) -> ( E ` F ) e. { x e. ~P V | ( x ~~ 1o \/ x ~~ 2o ) } )
5	4	3impa 1221	. . 3 |- ( ( G e. UPGraph /\ E Fn A /\ F e. A ) -> ( E ` F ) e. { x e. ~P V | ( x ~~ 1o \/ x ~~ 2o ) } )
6		breq1 4096	. . . . 5 |- ( x = ( E ` F ) -> ( x ~~ 1o <-> ( E ` F ) ~~ 1o ) )
7		breq1 4096	. . . . 5 |- ( x = ( E ` F ) -> ( x ~~ 2o <-> ( E ` F ) ~~ 2o ) )
8	6, 7	orbi12d 801	. . . 4 |- ( x = ( E ` F ) -> ( ( x ~~ 1o \/ x ~~ 2o ) <-> ( ( E ` F ) ~~ 1o \/ ( E ` F ) ~~ 2o ) ) )
9	8	elrab 2963	. . 3 |- ( ( E ` F ) e. { x e. ~P V | ( x ~~ 1o \/ x ~~ 2o ) } <-> ( ( E ` F ) e. ~P V /\ ( ( E ` F ) ~~ 1o \/ ( E ` F ) ~~ 2o ) ) )
10	5, 9	sylib 122	. 2 |- ( ( G e. UPGraph /\ E Fn A /\ F e. A ) -> ( ( E ` F ) e. ~P V /\ ( ( E ` F ) ~~ 1o \/ ( E ` F ) ~~ 2o ) ) )
11		en1m 7022	. . 3 |- ( ( E ` F ) ~~ 1o -> E. j j e. ( E ` F ) )
12		en2m 7042	. . 3 |- ( ( E ` F ) ~~ 2o -> E. j j e. ( E ` F ) )
13	11, 12	jaoi 724	. 2 |- ( ( ( E ` F ) ~~ 1o \/ ( E ` F ) ~~ 2o ) -> E. j j e. ( E ` F ) )
14	10, 13	simpl2im 386	1 |- ( ( G e. UPGraph /\ E Fn A /\ F e. A ) -> E. j j e. ( E ` F ) )

Syntax hints:   -> wi 4   /\ wa 104   \/ wo 716   /\ w3a 1005   = wceq 1398   E.wex 1541   e. wcel 2202   {crab 2515   ~Pcpw 3656   class class class wbr 4093   Fn wfn 5328   ` cfv 5333   1oc1o 6618   2oc2o 6619   ~~ cen 6950  Vtxcvtx 15933  iEdgciedg 15934  UPGraphcupgr 16012

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 2204  ax-14 2205  ax-ext 2213  ax-sep 4212  ax-nul 4220  ax-pow 4270  ax-pr 4305  ax-un 4536  ax-setind 4641  ax-cnex 8166  ax-resscn 8167  ax-1cn 8168  ax-1re 8169  ax-icn 8170  ax-addcl 8171  ax-addrcl 8172  ax-mulcl 8173  ax-addcom 8175  ax-mulcom 8176  ax-addass 8177  ax-mulass 8178  ax-distr 8179  ax-i2m1 8180  ax-1rid 8182  ax-0id 8183  ax-rnegex 8184  ax-cnre 8186

This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-ne 2404  df-ral 2516  df-rex 2517  df-reu 2518  df-rab 2520  df-v 2805  df-sbc 3033  df-csb 3129  df-dif 3203  df-un 3205  df-in 3207  df-ss 3214  df-nul 3497  df-if 3608  df-pw 3658  df-sn 3679  df-pr 3680  df-op 3682  df-uni 3899  df-int 3934  df-br 4094  df-opab 4156  df-mpt 4157  df-tr 4193  df-id 4396  df-iord 4469  df-on 4471  df-suc 4474  df-xp 4737  df-rel 4738  df-cnv 4739  df-co 4740  df-dm 4741  df-rn 4742  df-res 4743  df-ima 4744  df-iota 5293  df-fun 5335  df-fn 5336  df-f 5337  df-f1 5338  df-fo 5339  df-f1o 5340  df-fv 5341  df-riota 5981  df-ov 6031  df-oprab 6032  df-mpo 6033  df-1st 6312  df-2nd 6313  df-1o 6625  df-2o 6626  df-en 6953  df-sub 8395  df-inn 9187  df-2 9245  df-3 9246  df-4 9247  df-5 9248  df-6 9249  df-7 9250  df-8 9251  df-9 9252  df-n0 9446  df-dec 9655  df-ndx 13146  df-slot 13147  df-base 13149  df-edgf 15926  df-vtx 15935  df-iedg 15936  df-upgren 16014

This theorem is referenced by: (None)