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

Theorem grstructd2dom 16043
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 16024 . . . . 5 ((𝑆𝑋 ∧ Fun (𝑆 ∖ {∅}) ∧ 2o ≼ dom 𝑆) → (Vtx‘𝑆) = (Base‘𝑆))
61, 3, 4, 5syl3anc 1274 . . . 4 (𝜑 → (Vtx‘𝑆) = (Base‘𝑆))
7 grstructd.b . . . 4 (𝜑 → (Base‘𝑆) = 𝑉)
86, 7eqtrd 2265 . . 3 (𝜑 → (Vtx‘𝑆) = 𝑉)
9 funiedgdm2domval 16025 . . . . 5 ((𝑆𝑋 ∧ Fun (𝑆 ∖ {∅}) ∧ 2o ≼ dom 𝑆) → (iEdg‘𝑆) = (.ef‘𝑆))
101, 3, 4, 9syl3anc 1274 . . . 4 (𝜑 → (iEdg‘𝑆) = (.ef‘𝑆))
11 grstructd.e . . . 4 (𝜑 → (.ef‘𝑆) = 𝐸)
1210, 11eqtrd 2265 . . 3 (𝜑 → (iEdg‘𝑆) = 𝐸)
138, 12jca 306 . 2 (𝜑 → ((Vtx‘𝑆) = 𝑉 ∧ (iEdg‘𝑆) = 𝐸))
14 nfcv 2384 . . 3 𝑔𝑆
15 nfv 1577 . . . 4 𝑔((Vtx‘𝑆) = 𝑉 ∧ (iEdg‘𝑆) = 𝐸)
16 nfsbc1v 3061 . . . 4 𝑔[𝑆 / 𝑔]𝜓
1715, 16nfim 1621 . . 3 𝑔(((Vtx‘𝑆) = 𝑉 ∧ (iEdg‘𝑆) = 𝐸) → [𝑆 / 𝑔]𝜓)
18 fveqeq2 5679 . . . . 5 (𝑔 = 𝑆 → ((Vtx‘𝑔) = 𝑉 ↔ (Vtx‘𝑆) = 𝑉))
19 fveqeq2 5679 . . . . 5 (𝑔 = 𝑆 → ((iEdg‘𝑔) = 𝐸 ↔ (iEdg‘𝑆) = 𝐸))
2018, 19anbi12d 473 . . . 4 (𝑔 = 𝑆 → (((Vtx‘𝑔) = 𝑉 ∧ (iEdg‘𝑔) = 𝐸) ↔ ((Vtx‘𝑆) = 𝑉 ∧ (iEdg‘𝑆) = 𝐸)))
21 sbceq1a 3052 . . . 4 (𝑔 = 𝑆 → (𝜓[𝑆 / 𝑔]𝜓))
2220, 21imbi12d 234 . . 3 (𝑔 = 𝑆 → ((((Vtx‘𝑔) = 𝑉 ∧ (iEdg‘𝑔) = 𝐸) → 𝜓) ↔ (((Vtx‘𝑆) = 𝑉 ∧ (iEdg‘𝑆) = 𝐸) → [𝑆 / 𝑔]𝜓)))
2314, 17, 22spcgf 2899 . 2 (𝑆𝑋 → (∀𝑔(((Vtx‘𝑔) = 𝑉 ∧ (iEdg‘𝑔) = 𝐸) → 𝜓) → (((Vtx‘𝑆) = 𝑉 ∧ (iEdg‘𝑆) = 𝐸) → [𝑆 / 𝑔]𝜓)))
241, 2, 13, 23syl3c 63 1 (𝜑[𝑆 / 𝑔]𝜓)
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  wal 1396   = wceq 1398  wcel 2203  [wsbc 3042  cdif 3208  c0 3508  {csn 3689   class class class wbr 4109  dom cdm 4749  Fun wfun 5346  cfv 5352  2oc2o 6641  cdom 6974  Basecbs 13212  .efcedgf 15999  Vtxcvtx 16007  iEdgciedg 16008
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 4228  ax-nul 4236  ax-pow 4287  ax-pr 4322  ax-un 4554  ax-setind 4659  ax-cnex 8218  ax-resscn 8219  ax-1cn 8220  ax-1re 8221  ax-icn 8222  ax-addcl 8223  ax-addrcl 8224  ax-mulcl 8225  ax-addcom 8227  ax-mulcom 8228  ax-addass 8229  ax-mulass 8230  ax-distr 8231  ax-i2m1 8232  ax-1rid 8234  ax-0id 8235  ax-rnegex 8236  ax-cnre 8238
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 2815  df-sbc 3043  df-csb 3139  df-dif 3213  df-un 3215  df-in 3217  df-ss 3224  df-nul 3509  df-if 3621  df-pw 3671  df-sn 3695  df-pr 3696  df-op 3698  df-uni 3915  df-int 3950  df-br 4110  df-opab 4172  df-mpt 4173  df-id 4414  df-suc 4492  df-xp 4755  df-rel 4756  df-cnv 4757  df-co 4758  df-dm 4759  df-rn 4760  df-res 4761  df-iota 5312  df-fun 5354  df-fn 5355  df-f 5356  df-f1 5357  df-fo 5358  df-fv 5360  df-riota 6003  df-ov 6053  df-oprab 6054  df-mpo 6055  df-1st 6334  df-2nd 6335  df-1o 6647  df-2o 6648  df-dom 6977  df-sub 8446  df-inn 9238  df-2 9296  df-3 9297  df-4 9298  df-5 9299  df-6 9300  df-7 9301  df-8 9302  df-9 9303  df-n0 9497  df-dec 9710  df-ndx 13215  df-slot 13216  df-base 13218  df-edgf 16000  df-vtx 16009  df-iedg 16010
This theorem is referenced by:  grstructeld2dom  16045
  Copyright terms: Public domain W3C validator