MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  isumgr Structured version   Visualization version   GIF version

Theorem isumgr 26035
Description: The property of being an undirected multigraph. (Contributed by AV, 24-Nov-2020.)
Hypotheses
Ref Expression
isumgr.v 𝑉 = (Vtx‘𝐺)
isumgr.e 𝐸 = (iEdg‘𝐺)
Assertion
Ref Expression
isumgr (𝐺𝑈 → (𝐺 ∈ UMGraph ↔ 𝐸:dom 𝐸⟶{𝑥 ∈ (𝒫 𝑉 ∖ {∅}) ∣ (#‘𝑥) = 2}))
Distinct variable groups:   𝑥,𝐺   𝑥,𝑉
Allowed substitution hints:   𝑈(𝑥)   𝐸(𝑥)

Proof of Theorem isumgr
Dummy variables 𝑒 𝑔 𝑣 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 df-umgr 26023 . . 3 UMGraph = {𝑔[(Vtx‘𝑔) / 𝑣][(iEdg‘𝑔) / 𝑒]𝑒:dom 𝑒⟶{𝑥 ∈ (𝒫 𝑣 ∖ {∅}) ∣ (#‘𝑥) = 2}}
21eleq2i 2722 . 2 (𝐺 ∈ UMGraph ↔ 𝐺 ∈ {𝑔[(Vtx‘𝑔) / 𝑣][(iEdg‘𝑔) / 𝑒]𝑒:dom 𝑒⟶{𝑥 ∈ (𝒫 𝑣 ∖ {∅}) ∣ (#‘𝑥) = 2}})
3 fveq2 6229 . . . . 5 ( = 𝐺 → (iEdg‘) = (iEdg‘𝐺))
4 isumgr.e . . . . 5 𝐸 = (iEdg‘𝐺)
53, 4syl6eqr 2703 . . . 4 ( = 𝐺 → (iEdg‘) = 𝐸)
63dmeqd 5358 . . . . 5 ( = 𝐺 → dom (iEdg‘) = dom (iEdg‘𝐺))
74eqcomi 2660 . . . . . 6 (iEdg‘𝐺) = 𝐸
87dmeqi 5357 . . . . 5 dom (iEdg‘𝐺) = dom 𝐸
96, 8syl6eq 2701 . . . 4 ( = 𝐺 → dom (iEdg‘) = dom 𝐸)
10 fveq2 6229 . . . . . . . 8 ( = 𝐺 → (Vtx‘) = (Vtx‘𝐺))
11 isumgr.v . . . . . . . 8 𝑉 = (Vtx‘𝐺)
1210, 11syl6eqr 2703 . . . . . . 7 ( = 𝐺 → (Vtx‘) = 𝑉)
1312pweqd 4196 . . . . . 6 ( = 𝐺 → 𝒫 (Vtx‘) = 𝒫 𝑉)
1413difeq1d 3760 . . . . 5 ( = 𝐺 → (𝒫 (Vtx‘) ∖ {∅}) = (𝒫 𝑉 ∖ {∅}))
1514rabeqdv 3225 . . . 4 ( = 𝐺 → {𝑥 ∈ (𝒫 (Vtx‘) ∖ {∅}) ∣ (#‘𝑥) = 2} = {𝑥 ∈ (𝒫 𝑉 ∖ {∅}) ∣ (#‘𝑥) = 2})
165, 9, 15feq123d 6072 . . 3 ( = 𝐺 → ((iEdg‘):dom (iEdg‘)⟶{𝑥 ∈ (𝒫 (Vtx‘) ∖ {∅}) ∣ (#‘𝑥) = 2} ↔ 𝐸:dom 𝐸⟶{𝑥 ∈ (𝒫 𝑉 ∖ {∅}) ∣ (#‘𝑥) = 2}))
17 fvexd 6241 . . . . 5 (𝑔 = → (Vtx‘𝑔) ∈ V)
18 fveq2 6229 . . . . 5 (𝑔 = → (Vtx‘𝑔) = (Vtx‘))
19 fvexd 6241 . . . . . 6 ((𝑔 = 𝑣 = (Vtx‘)) → (iEdg‘𝑔) ∈ V)
20 fveq2 6229 . . . . . . 7 (𝑔 = → (iEdg‘𝑔) = (iEdg‘))
2120adantr 480 . . . . . 6 ((𝑔 = 𝑣 = (Vtx‘)) → (iEdg‘𝑔) = (iEdg‘))
22 simpr 476 . . . . . . 7 (((𝑔 = 𝑣 = (Vtx‘)) ∧ 𝑒 = (iEdg‘)) → 𝑒 = (iEdg‘))
2322dmeqd 5358 . . . . . . 7 (((𝑔 = 𝑣 = (Vtx‘)) ∧ 𝑒 = (iEdg‘)) → dom 𝑒 = dom (iEdg‘))
24 pweq 4194 . . . . . . . . . 10 (𝑣 = (Vtx‘) → 𝒫 𝑣 = 𝒫 (Vtx‘))
2524ad2antlr 763 . . . . . . . . 9 (((𝑔 = 𝑣 = (Vtx‘)) ∧ 𝑒 = (iEdg‘)) → 𝒫 𝑣 = 𝒫 (Vtx‘))
2625difeq1d 3760 . . . . . . . 8 (((𝑔 = 𝑣 = (Vtx‘)) ∧ 𝑒 = (iEdg‘)) → (𝒫 𝑣 ∖ {∅}) = (𝒫 (Vtx‘) ∖ {∅}))
2726rabeqdv 3225 . . . . . . 7 (((𝑔 = 𝑣 = (Vtx‘)) ∧ 𝑒 = (iEdg‘)) → {𝑥 ∈ (𝒫 𝑣 ∖ {∅}) ∣ (#‘𝑥) = 2} = {𝑥 ∈ (𝒫 (Vtx‘) ∖ {∅}) ∣ (#‘𝑥) = 2})
2822, 23, 27feq123d 6072 . . . . . 6 (((𝑔 = 𝑣 = (Vtx‘)) ∧ 𝑒 = (iEdg‘)) → (𝑒:dom 𝑒⟶{𝑥 ∈ (𝒫 𝑣 ∖ {∅}) ∣ (#‘𝑥) = 2} ↔ (iEdg‘):dom (iEdg‘)⟶{𝑥 ∈ (𝒫 (Vtx‘) ∖ {∅}) ∣ (#‘𝑥) = 2}))
2919, 21, 28sbcied2 3506 . . . . 5 ((𝑔 = 𝑣 = (Vtx‘)) → ([(iEdg‘𝑔) / 𝑒]𝑒:dom 𝑒⟶{𝑥 ∈ (𝒫 𝑣 ∖ {∅}) ∣ (#‘𝑥) = 2} ↔ (iEdg‘):dom (iEdg‘)⟶{𝑥 ∈ (𝒫 (Vtx‘) ∖ {∅}) ∣ (#‘𝑥) = 2}))
3017, 18, 29sbcied2 3506 . . . 4 (𝑔 = → ([(Vtx‘𝑔) / 𝑣][(iEdg‘𝑔) / 𝑒]𝑒:dom 𝑒⟶{𝑥 ∈ (𝒫 𝑣 ∖ {∅}) ∣ (#‘𝑥) = 2} ↔ (iEdg‘):dom (iEdg‘)⟶{𝑥 ∈ (𝒫 (Vtx‘) ∖ {∅}) ∣ (#‘𝑥) = 2}))
3130cbvabv 2776 . . 3 {𝑔[(Vtx‘𝑔) / 𝑣][(iEdg‘𝑔) / 𝑒]𝑒:dom 𝑒⟶{𝑥 ∈ (𝒫 𝑣 ∖ {∅}) ∣ (#‘𝑥) = 2}} = { ∣ (iEdg‘):dom (iEdg‘)⟶{𝑥 ∈ (𝒫 (Vtx‘) ∖ {∅}) ∣ (#‘𝑥) = 2}}
3216, 31elab2g 3385 . 2 (𝐺𝑈 → (𝐺 ∈ {𝑔[(Vtx‘𝑔) / 𝑣][(iEdg‘𝑔) / 𝑒]𝑒:dom 𝑒⟶{𝑥 ∈ (𝒫 𝑣 ∖ {∅}) ∣ (#‘𝑥) = 2}} ↔ 𝐸:dom 𝐸⟶{𝑥 ∈ (𝒫 𝑉 ∖ {∅}) ∣ (#‘𝑥) = 2}))
332, 32syl5bb 272 1 (𝐺𝑈 → (𝐺 ∈ UMGraph ↔ 𝐸:dom 𝐸⟶{𝑥 ∈ (𝒫 𝑉 ∖ {∅}) ∣ (#‘𝑥) = 2}))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 196  wa 383   = wceq 1523  wcel 2030  {cab 2637  {crab 2945  Vcvv 3231  [wsbc 3468  cdif 3604  c0 3948  𝒫 cpw 4191  {csn 4210  dom cdm 5143  wf 5922  cfv 5926  2c2 11108  #chash 13157  Vtxcvtx 25919  iEdgciedg 25920  UMGraphcumgr 26021
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1762  ax-4 1777  ax-5 1879  ax-6 1945  ax-7 1981  ax-9 2039  ax-10 2059  ax-11 2074  ax-12 2087  ax-13 2282  ax-ext 2631  ax-nul 4822
This theorem depends on definitions:  df-bi 197  df-or 384  df-an 385  df-3an 1056  df-tru 1526  df-ex 1745  df-nf 1750  df-sb 1938  df-eu 2502  df-clab 2638  df-cleq 2644  df-clel 2647  df-nfc 2782  df-ral 2946  df-rex 2947  df-rab 2950  df-v 3233  df-sbc 3469  df-dif 3610  df-un 3612  df-in 3614  df-ss 3621  df-nul 3949  df-if 4120  df-pw 4193  df-sn 4211  df-pr 4213  df-op 4217  df-uni 4469  df-br 4686  df-opab 4746  df-rel 5150  df-cnv 5151  df-co 5152  df-dm 5153  df-rn 5154  df-iota 5889  df-fun 5928  df-fn 5929  df-f 5930  df-fv 5934  df-umgr 26023
This theorem is referenced by:  isumgrs  26036  umgrupgr  26043  umgr0e  26050  umgrislfupgr  26063
  Copyright terms: Public domain W3C validator