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

Theorem grstructd2dom 15870
Description: If any representation of a graph with vertices 𝑉 and edges 𝐸 has a certain property 𝜓, then any structure with base set 𝑉 and value 𝐸 in the slot for edge functions (which is such a representation of a graph with vertices 𝑉 and edges 𝐸) has this property. (Contributed by AV, 12-Oct-2020.) (Revised by AV, 9-Jun-2021.)
Hypotheses
Ref Expression
gropd.g (𝜑 → ∀𝑔(((Vtx‘𝑔) = 𝑉 ∧ (iEdg‘𝑔) = 𝐸) → 𝜓))
gropd.v (𝜑𝑉𝑈)
gropd.e (𝜑𝐸𝑊)
grstructd.s (𝜑𝑆𝑋)
grstructd.f (𝜑 → Fun (𝑆 ∖ {∅}))
grstructd2dom.d (𝜑 → 2o ≼ dom 𝑆)
grstructd.b (𝜑 → (Base‘𝑆) = 𝑉)
grstructd.e (𝜑 → (.ef‘𝑆) = 𝐸)
Assertion
Ref Expression
grstructd2dom (𝜑[𝑆 / 𝑔]𝜓)
Distinct variable groups:   𝑔,𝐸   𝑔,𝑉   𝜑,𝑔   𝑆,𝑔
Allowed substitution hints:   𝜓(𝑔)   𝑈(𝑔)   𝑊(𝑔)   𝑋(𝑔)

Proof of Theorem grstructd2dom
StepHypRef Expression
1 grstructd.s . 2 (𝜑𝑆𝑋)
2 gropd.g . 2 (𝜑 → ∀𝑔(((Vtx‘𝑔) = 𝑉 ∧ (iEdg‘𝑔) = 𝐸) → 𝜓))
3 grstructd.f . . . . 5 (𝜑 → Fun (𝑆 ∖ {∅}))
4 grstructd2dom.d . . . . 5 (𝜑 → 2o ≼ dom 𝑆)
5 funvtxdm2domval 15851 . . . . 5 ((𝑆𝑋 ∧ Fun (𝑆 ∖ {∅}) ∧ 2o ≼ dom 𝑆) → (Vtx‘𝑆) = (Base‘𝑆))
61, 3, 4, 5syl3anc 1271 . . . 4 (𝜑 → (Vtx‘𝑆) = (Base‘𝑆))
7 grstructd.b . . . 4 (𝜑 → (Base‘𝑆) = 𝑉)
86, 7eqtrd 2262 . . 3 (𝜑 → (Vtx‘𝑆) = 𝑉)
9 funiedgdm2domval 15852 . . . . 5 ((𝑆𝑋 ∧ Fun (𝑆 ∖ {∅}) ∧ 2o ≼ dom 𝑆) → (iEdg‘𝑆) = (.ef‘𝑆))
101, 3, 4, 9syl3anc 1271 . . . 4 (𝜑 → (iEdg‘𝑆) = (.ef‘𝑆))
11 grstructd.e . . . 4 (𝜑 → (.ef‘𝑆) = 𝐸)
1210, 11eqtrd 2262 . . 3 (𝜑 → (iEdg‘𝑆) = 𝐸)
138, 12jca 306 . 2 (𝜑 → ((Vtx‘𝑆) = 𝑉 ∧ (iEdg‘𝑆) = 𝐸))
14 nfcv 2372 . . 3 𝑔𝑆
15 nfv 1574 . . . 4 𝑔((Vtx‘𝑆) = 𝑉 ∧ (iEdg‘𝑆) = 𝐸)
16 nfsbc1v 3047 . . . 4 𝑔[𝑆 / 𝑔]𝜓
1715, 16nfim 1618 . . 3 𝑔(((Vtx‘𝑆) = 𝑉 ∧ (iEdg‘𝑆) = 𝐸) → [𝑆 / 𝑔]𝜓)
18 fveqeq2 5641 . . . . 5 (𝑔 = 𝑆 → ((Vtx‘𝑔) = 𝑉 ↔ (Vtx‘𝑆) = 𝑉))
19 fveqeq2 5641 . . . . 5 (𝑔 = 𝑆 → ((iEdg‘𝑔) = 𝐸 ↔ (iEdg‘𝑆) = 𝐸))
2018, 19anbi12d 473 . . . 4 (𝑔 = 𝑆 → (((Vtx‘𝑔) = 𝑉 ∧ (iEdg‘𝑔) = 𝐸) ↔ ((Vtx‘𝑆) = 𝑉 ∧ (iEdg‘𝑆) = 𝐸)))
21 sbceq1a 3038 . . . 4 (𝑔 = 𝑆 → (𝜓[𝑆 / 𝑔]𝜓))
2220, 21imbi12d 234 . . 3 (𝑔 = 𝑆 → ((((Vtx‘𝑔) = 𝑉 ∧ (iEdg‘𝑔) = 𝐸) → 𝜓) ↔ (((Vtx‘𝑆) = 𝑉 ∧ (iEdg‘𝑆) = 𝐸) → [𝑆 / 𝑔]𝜓)))
2314, 17, 22spcgf 2885 . 2 (𝑆𝑋 → (∀𝑔(((Vtx‘𝑔) = 𝑉 ∧ (iEdg‘𝑔) = 𝐸) → 𝜓) → (((Vtx‘𝑆) = 𝑉 ∧ (iEdg‘𝑆) = 𝐸) → [𝑆 / 𝑔]𝜓)))
241, 2, 13, 23syl3c 63 1 (𝜑[𝑆 / 𝑔]𝜓)
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  wal 1393   = wceq 1395  wcel 2200  [wsbc 3028  cdif 3194  c0 3491  {csn 3666   class class class wbr 4083  dom cdm 4720  Fun wfun 5315  cfv 5321  2oc2o 6567  cdom 6899  Basecbs 13053  .efcedgf 15826  Vtxcvtx 15834  iEdgciedg 15835
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 617  ax-in2 618  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-13 2202  ax-14 2203  ax-ext 2211  ax-sep 4202  ax-nul 4210  ax-pow 4259  ax-pr 4294  ax-un 4525  ax-setind 4630  ax-cnex 8106  ax-resscn 8107  ax-1cn 8108  ax-1re 8109  ax-icn 8110  ax-addcl 8111  ax-addrcl 8112  ax-mulcl 8113  ax-addcom 8115  ax-mulcom 8116  ax-addass 8117  ax-mulass 8118  ax-distr 8119  ax-i2m1 8120  ax-1rid 8122  ax-0id 8123  ax-rnegex 8124  ax-cnre 8126
This theorem depends on definitions:  df-bi 117  df-3an 1004  df-tru 1398  df-fal 1401  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ne 2401  df-ral 2513  df-rex 2514  df-reu 2515  df-rab 2517  df-v 2801  df-sbc 3029  df-csb 3125  df-dif 3199  df-un 3201  df-in 3203  df-ss 3210  df-nul 3492  df-if 3603  df-pw 3651  df-sn 3672  df-pr 3673  df-op 3675  df-uni 3889  df-int 3924  df-br 4084  df-opab 4146  df-mpt 4147  df-id 4385  df-suc 4463  df-xp 4726  df-rel 4727  df-cnv 4728  df-co 4729  df-dm 4730  df-rn 4731  df-res 4732  df-iota 5281  df-fun 5323  df-fn 5324  df-f 5325  df-f1 5326  df-fo 5327  df-fv 5329  df-riota 5963  df-ov 6013  df-oprab 6014  df-mpo 6015  df-1st 6295  df-2nd 6296  df-1o 6573  df-2o 6574  df-dom 6902  df-sub 8335  df-inn 9127  df-2 9185  df-3 9186  df-4 9187  df-5 9188  df-6 9189  df-7 9190  df-8 9191  df-9 9192  df-n0 9386  df-dec 9595  df-ndx 13056  df-slot 13057  df-base 13059  df-edgf 15827  df-vtx 15836  df-iedg 15837
This theorem is referenced by:  grstructeld2dom  15872
  Copyright terms: Public domain W3C validator