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

Theorem isuspgren 16139
Description: The property of being a simple pseudograph. (Contributed by Alexander van der Vekens, 10-Aug-2017.) (Revised by AV, 13-Oct-2020.)
Hypotheses
Ref Expression
isuspgr.v 𝑉 = (Vtx‘𝐺)
isuspgr.e 𝐸 = (iEdg‘𝐺)
Assertion
Ref Expression
isuspgren (𝐺𝑈 → (𝐺 ∈ USPGraph ↔ 𝐸:dom 𝐸1-1→{𝑥 ∈ 𝒫 𝑉 ∣ (𝑥 ≈ 1o𝑥 ≈ 2o)}))
Distinct variable groups:   𝑥,𝐺   𝑥,𝑉
Allowed substitution hints:   𝑈(𝑥)   𝐸(𝑥)

Proof of Theorem isuspgren
Dummy variables 𝑒 𝑔 𝑣 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 df-uspgren 16137 . . 3 USPGraph = {𝑔[(Vtx‘𝑔) / 𝑣][(iEdg‘𝑔) / 𝑒]𝑒:dom 𝑒1-1→{𝑥 ∈ 𝒫 𝑣 ∣ (𝑥 ≈ 1o𝑥 ≈ 2o)}}
21eleq2i 2299 . 2 (𝐺 ∈ USPGraph ↔ 𝐺 ∈ {𝑔[(Vtx‘𝑔) / 𝑣][(iEdg‘𝑔) / 𝑒]𝑒:dom 𝑒1-1→{𝑥 ∈ 𝒫 𝑣 ∣ (𝑥 ≈ 1o𝑥 ≈ 2o)}})
3 fveq2 5669 . . . . 5 ( = 𝐺 → (iEdg‘) = (iEdg‘𝐺))
4 isuspgr.e . . . . 5 𝐸 = (iEdg‘𝐺)
53, 4eqtr4di 2283 . . . 4 ( = 𝐺 → (iEdg‘) = 𝐸)
63dmeqd 4957 . . . . 5 ( = 𝐺 → dom (iEdg‘) = dom (iEdg‘𝐺))
74eqcomi 2236 . . . . . 6 (iEdg‘𝐺) = 𝐸
87dmeqi 4956 . . . . 5 dom (iEdg‘𝐺) = dom 𝐸
96, 8eqtrdi 2281 . . . 4 ( = 𝐺 → dom (iEdg‘) = dom 𝐸)
10 fveq2 5669 . . . . . . 7 ( = 𝐺 → (Vtx‘) = (Vtx‘𝐺))
11 isuspgr.v . . . . . . 7 𝑉 = (Vtx‘𝐺)
1210, 11eqtr4di 2283 . . . . . 6 ( = 𝐺 → (Vtx‘) = 𝑉)
1312pweqd 3673 . . . . 5 ( = 𝐺 → 𝒫 (Vtx‘) = 𝒫 𝑉)
1413rabeqdv 2806 . . . 4 ( = 𝐺 → {𝑥 ∈ 𝒫 (Vtx‘) ∣ (𝑥 ≈ 1o𝑥 ≈ 2o)} = {𝑥 ∈ 𝒫 𝑉 ∣ (𝑥 ≈ 1o𝑥 ≈ 2o)})
155, 9, 14f1eq123d 5605 . . 3 ( = 𝐺 → ((iEdg‘):dom (iEdg‘)–1-1→{𝑥 ∈ 𝒫 (Vtx‘) ∣ (𝑥 ≈ 1o𝑥 ≈ 2o)} ↔ 𝐸:dom 𝐸1-1→{𝑥 ∈ 𝒫 𝑉 ∣ (𝑥 ≈ 1o𝑥 ≈ 2o)}))
16 vtxex 16000 . . . . . . 7 (𝑔 ∈ V → (Vtx‘𝑔) ∈ V)
1716elv 2816 . . . . . 6 (Vtx‘𝑔) ∈ V
1817a1i 9 . . . . 5 (𝑔 = → (Vtx‘𝑔) ∈ V)
19 fveq2 5669 . . . . 5 (𝑔 = → (Vtx‘𝑔) = (Vtx‘))
20 iedgex 16001 . . . . . . . 8 (𝑔 ∈ V → (iEdg‘𝑔) ∈ V)
2120elv 2816 . . . . . . 7 (iEdg‘𝑔) ∈ V
2221a1i 9 . . . . . 6 ((𝑔 = 𝑣 = (Vtx‘)) → (iEdg‘𝑔) ∈ V)
23 fveq2 5669 . . . . . . 7 (𝑔 = → (iEdg‘𝑔) = (iEdg‘))
2423adantr 276 . . . . . 6 ((𝑔 = 𝑣 = (Vtx‘)) → (iEdg‘𝑔) = (iEdg‘))
25 simpr 110 . . . . . . 7 (((𝑔 = 𝑣 = (Vtx‘)) ∧ 𝑒 = (iEdg‘)) → 𝑒 = (iEdg‘))
2625dmeqd 4957 . . . . . . 7 (((𝑔 = 𝑣 = (Vtx‘)) ∧ 𝑒 = (iEdg‘)) → dom 𝑒 = dom (iEdg‘))
27 pweq 3671 . . . . . . . . 9 (𝑣 = (Vtx‘) → 𝒫 𝑣 = 𝒫 (Vtx‘))
2827ad2antlr 489 . . . . . . . 8 (((𝑔 = 𝑣 = (Vtx‘)) ∧ 𝑒 = (iEdg‘)) → 𝒫 𝑣 = 𝒫 (Vtx‘))
2928rabeqdv 2806 . . . . . . 7 (((𝑔 = 𝑣 = (Vtx‘)) ∧ 𝑒 = (iEdg‘)) → {𝑥 ∈ 𝒫 𝑣 ∣ (𝑥 ≈ 1o𝑥 ≈ 2o)} = {𝑥 ∈ 𝒫 (Vtx‘) ∣ (𝑥 ≈ 1o𝑥 ≈ 2o)})
3025, 26, 29f1eq123d 5605 . . . . . 6 (((𝑔 = 𝑣 = (Vtx‘)) ∧ 𝑒 = (iEdg‘)) → (𝑒:dom 𝑒1-1→{𝑥 ∈ 𝒫 𝑣 ∣ (𝑥 ≈ 1o𝑥 ≈ 2o)} ↔ (iEdg‘):dom (iEdg‘)–1-1→{𝑥 ∈ 𝒫 (Vtx‘) ∣ (𝑥 ≈ 1o𝑥 ≈ 2o)}))
3122, 24, 30sbcied2 3079 . . . . 5 ((𝑔 = 𝑣 = (Vtx‘)) → ([(iEdg‘𝑔) / 𝑒]𝑒:dom 𝑒1-1→{𝑥 ∈ 𝒫 𝑣 ∣ (𝑥 ≈ 1o𝑥 ≈ 2o)} ↔ (iEdg‘):dom (iEdg‘)–1-1→{𝑥 ∈ 𝒫 (Vtx‘) ∣ (𝑥 ≈ 1o𝑥 ≈ 2o)}))
3218, 19, 31sbcied2 3079 . . . 4 (𝑔 = → ([(Vtx‘𝑔) / 𝑣][(iEdg‘𝑔) / 𝑒]𝑒:dom 𝑒1-1→{𝑥 ∈ 𝒫 𝑣 ∣ (𝑥 ≈ 1o𝑥 ≈ 2o)} ↔ (iEdg‘):dom (iEdg‘)–1-1→{𝑥 ∈ 𝒫 (Vtx‘) ∣ (𝑥 ≈ 1o𝑥 ≈ 2o)}))
3332cbvabv 2359 . . 3 {𝑔[(Vtx‘𝑔) / 𝑣][(iEdg‘𝑔) / 𝑒]𝑒:dom 𝑒1-1→{𝑥 ∈ 𝒫 𝑣 ∣ (𝑥 ≈ 1o𝑥 ≈ 2o)}} = { ∣ (iEdg‘):dom (iEdg‘)–1-1→{𝑥 ∈ 𝒫 (Vtx‘) ∣ (𝑥 ≈ 1o𝑥 ≈ 2o)}}
3415, 33elab2g 2963 . 2 (𝐺𝑈 → (𝐺 ∈ {𝑔[(Vtx‘𝑔) / 𝑣][(iEdg‘𝑔) / 𝑒]𝑒:dom 𝑒1-1→{𝑥 ∈ 𝒫 𝑣 ∣ (𝑥 ≈ 1o𝑥 ≈ 2o)}} ↔ 𝐸:dom 𝐸1-1→{𝑥 ∈ 𝒫 𝑉 ∣ (𝑥 ≈ 1o𝑥 ≈ 2o)}))
352, 34bitrid 192 1 (𝐺𝑈 → (𝐺 ∈ USPGraph ↔ 𝐸:dom 𝐸1-1→{𝑥 ∈ 𝒫 𝑉 ∣ (𝑥 ≈ 1o𝑥 ≈ 2o)}))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  wb 105  wo 716   = wceq 1398  wcel 2203  {cab 2218  {crab 2524  Vcvv 2812  [wsbc 3041  𝒫 cpw 3668   class class class wbr 4108  dom cdm 4748  1-1wf1 5348  cfv 5351  1oc1o 6639  2oc2o 6640  cen 6972  Vtxcvtx 15994  iEdgciedg 15995  USPGraphcuspgr 16135
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 4227  ax-pow 4286  ax-pr 4321  ax-un 4553  ax-setind 4658  ax-cnex 8214  ax-resscn 8215  ax-1cn 8216  ax-1re 8217  ax-icn 8218  ax-addcl 8219  ax-addrcl 8220  ax-mulcl 8221  ax-addcom 8223  ax-mulcom 8224  ax-addass 8225  ax-mulass 8226  ax-distr 8227  ax-i2m1 8228  ax-1rid 8230  ax-0id 8231  ax-rnegex 8232  ax-cnre 8234
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 2814  df-sbc 3042  df-csb 3138  df-dif 3212  df-un 3214  df-in 3216  df-ss 3223  df-if 3620  df-pw 3670  df-sn 3694  df-pr 3695  df-op 3697  df-uni 3914  df-int 3949  df-br 4109  df-opab 4171  df-mpt 4172  df-id 4413  df-xp 4754  df-rel 4755  df-cnv 4756  df-co 4757  df-dm 4758  df-rn 4759  df-res 4760  df-iota 5311  df-fun 5353  df-fn 5354  df-f 5355  df-f1 5356  df-fo 5357  df-fv 5359  df-riota 6002  df-ov 6052  df-oprab 6053  df-mpo 6054  df-1st 6333  df-2nd 6334  df-sub 8442  df-inn 9234  df-2 9292  df-3 9293  df-4 9294  df-5 9295  df-6 9296  df-7 9297  df-8 9298  df-9 9299  df-n0 9493  df-dec 9706  df-ndx 13204  df-slot 13205  df-base 13207  df-edgf 15987  df-vtx 15996  df-iedg 15997  df-uspgren 16137
This theorem is referenced by:  uspgrfen  16141  isuspgropen  16146  uspgrushgr  16162  uspgrupgr  16163  uspgrupgrushgr  16164  usgruspgr  16165  uspgr1edc  16222
  Copyright terms: Public domain W3C validator