ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  gropd Unicode version

Theorem gropd 16168
Description: If any representation of a graph with vertices  V and edges  E has a certain property  ps, then the ordered pair  <. V ,  E >. of the set of vertices and the set of edges (which is such a representation of a graph with vertices  V and edges  E) has this property. (Contributed by AV, 11-Oct-2020.)
Hypotheses
Ref Expression
gropd.g  |-  ( ph  ->  A. g ( ( (Vtx `  g )  =  V  /\  (iEdg `  g )  =  E )  ->  ps )
)
gropd.v  |-  ( ph  ->  V  e.  U )
gropd.e  |-  ( ph  ->  E  e.  W )
Assertion
Ref Expression
gropd  |-  ( ph  ->  [. <. V ,  E >.  /  g ]. ps )
Distinct variable groups:    g, E    g, V    ph, g
Allowed substitution hints:    ps( g)    U( g)    W( g)

Proof of Theorem gropd
StepHypRef Expression
1 gropd.v . . 3  |-  ( ph  ->  V  e.  U )
2 gropd.e . . 3  |-  ( ph  ->  E  e.  W )
3 opexg 4349 . . 3  |-  ( ( V  e.  U  /\  E  e.  W )  -> 
<. V ,  E >.  e. 
_V )
41, 2, 3syl2anc 411 . 2  |-  ( ph  -> 
<. V ,  E >.  e. 
_V )
5 gropd.g . 2  |-  ( ph  ->  A. g ( ( (Vtx `  g )  =  V  /\  (iEdg `  g )  =  E )  ->  ps )
)
6 opvtxfv 16143 . . . 4  |-  ( ( V  e.  U  /\  E  e.  W )  ->  (Vtx `  <. V ,  E >. )  =  V )
7 opiedgfv 16146 . . . 4  |-  ( ( V  e.  U  /\  E  e.  W )  ->  (iEdg `  <. V ,  E >. )  =  E )
86, 7jca 306 . . 3  |-  ( ( V  e.  U  /\  E  e.  W )  ->  ( (Vtx `  <. V ,  E >. )  =  V  /\  (iEdg ` 
<. V ,  E >. )  =  E ) )
91, 2, 8syl2anc 411 . 2  |-  ( ph  ->  ( (Vtx `  <. V ,  E >. )  =  V  /\  (iEdg ` 
<. V ,  E >. )  =  E ) )
10 nfcv 2386 . . 3  |-  F/_ g <. V ,  E >.
11 nfv 1577 . . . 4  |-  F/ g ( (Vtx `  <. V ,  E >. )  =  V  /\  (iEdg ` 
<. V ,  E >. )  =  E )
12 nfsbc1v 3064 . . . 4  |-  F/ g
[. <. V ,  E >.  /  g ]. ps
1311, 12nfim 1621 . . 3  |-  F/ g ( ( (Vtx `  <. V ,  E >. )  =  V  /\  (iEdg ` 
<. V ,  E >. )  =  E )  ->  [. <. V ,  E >.  /  g ]. ps )
14 fveqeq2 5684 . . . . 5  |-  ( g  =  <. V ,  E >.  ->  ( (Vtx `  g )  =  V  <-> 
(Vtx `  <. V ,  E >. )  =  V ) )
15 fveqeq2 5684 . . . . 5  |-  ( g  =  <. V ,  E >.  ->  ( (iEdg `  g )  =  E  <-> 
(iEdg `  <. V ,  E >. )  =  E ) )
1614, 15anbi12d 473 . . . 4  |-  ( g  =  <. V ,  E >.  ->  ( ( (Vtx
`  g )  =  V  /\  (iEdg `  g )  =  E )  <->  ( (Vtx `  <. V ,  E >. )  =  V  /\  (iEdg ` 
<. V ,  E >. )  =  E ) ) )
17 sbceq1a 3055 . . . 4  |-  ( g  =  <. V ,  E >.  ->  ( ps  <->  [. <. V ,  E >.  /  g ]. ps ) )
1816, 17imbi12d 234 . . 3  |-  ( g  =  <. V ,  E >.  ->  ( ( ( (Vtx `  g )  =  V  /\  (iEdg `  g )  =  E )  ->  ps )  <->  ( ( (Vtx `  <. V ,  E >. )  =  V  /\  (iEdg ` 
<. V ,  E >. )  =  E )  ->  [. <. V ,  E >.  /  g ]. ps ) ) )
1910, 13, 18spcgf 2901 . 2  |-  ( <. V ,  E >.  e. 
_V  ->  ( A. g
( ( (Vtx `  g )  =  V  /\  (iEdg `  g
)  =  E )  ->  ps )  -> 
( ( (Vtx `  <. V ,  E >. )  =  V  /\  (iEdg ` 
<. V ,  E >. )  =  E )  ->  [. <. V ,  E >.  /  g ]. ps ) ) )
204, 5, 9, 19syl3c 63 1  |-  ( ph  ->  [. <. V ,  E >.  /  g ]. ps )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104   A.wal 1396    = wceq 1398    e. wcel 2205   _Vcvv 2815   [.wsbc 3045   <.cop 3697   ` cfv 5357  Vtxcvtx 16133  iEdgciedg 16134
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-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-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-id 4419  df-xp 4760  df-rel 4761  df-cnv 4762  df-co 4763  df-dm 4764  df-rn 4765  df-res 4766  df-iota 5317  df-fun 5359  df-fn 5360  df-f 5361  df-fo 5363  df-fv 5365  df-riota 6011  df-ov 6061  df-oprab 6062  df-mpo 6063  df-1st 6347  df-2nd 6348  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
This theorem is referenced by:  gropeld  16170
  Copyright terms: Public domain W3C validator