Metamath Proof Explorer < Previous   Next > Nearby theorems Mirrors  >  Home  >  MPE Home  >  Th. List  >  isuslgra Structured version   Unicode version

Theorem isuslgra 21364
 Description: The property of being an undirected simple graph with loops. (Contributed by Alexander van der Vekens, 10-Aug-2017.)
Assertion
Ref Expression
isuslgra USLGrph
Distinct variable groups:   ,   ,
Allowed substitution hints:   ()   ()

Proof of Theorem isuslgra
Dummy variables are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 f1eq1 5626 . . . 4
3 dmeq 5062 . . . . 5
43adantl 453 . . . 4
5 f1eq2 5627 . . . 4
64, 5syl 16 . . 3
7 simpl 444 . . . . . 6
87pweqd 3796 . . . . 5
98difeq1d 3456 . . . 4
10 rabeq 2942 . . . 4
11 f1eq3 5628 . . . 4
129, 10, 113syl 19 . . 3
132, 6, 123bitrd 271 . 2
14 df-uslgra 21358 . 2 USLGrph
1513, 14brabga 4461 1 USLGrph
 Colors of variables: wff set class Syntax hints:   wi 4   wb 177   wa 359   wceq 1652   wcel 1725  crab 2701   cdif 3309  c0 3620  cpw 3791  csn 3806   class class class wbr 4204   cdm 4870  wf1 5443  cfv 5446   cle 9113  c2 10041  chash 11610   USLGrph cuslg 21356 This theorem is referenced by:  uslgraf  21366  uslisumgra  21378  usisuslgra  21379  uslgra1  21384 This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1555  ax-5 1566  ax-17 1626  ax-9 1666  ax-8 1687  ax-14 1729  ax-6 1744  ax-7 1749  ax-11 1761  ax-12 1950  ax-ext 2416  ax-sep 4322  ax-nul 4330  ax-pr 4395 This theorem depends on definitions:  df-bi 178  df-or 360  df-an 361  df-3an 938  df-tru 1328  df-ex 1551  df-nf 1554  df-sb 1659  df-eu 2284  df-mo 2285  df-clab 2422  df-cleq 2428  df-clel 2431  df-nfc 2560  df-ne 2600  df-rab 2706  df-v 2950  df-dif 3315  df-un 3317  df-in 3319  df-ss 3326  df-nul 3621  df-if 3732  df-pw 3793  df-sn 3812  df-pr 3813  df-op 3815  df-br 4205  df-opab 4259  df-rel 4877  df-cnv 4878  df-co 4879  df-dm 4880  df-rn 4881  df-fun 5448  df-fn 5449  df-f 5450  df-f1 5451  df-uslgra 21358
 Copyright terms: Public domain W3C validator