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

Theorem uspgrupgrushgr 29211
Description: A graph is a simple pseudograph iff it is a pseudograph and a simple hypergraph. (Contributed by AV, 30-Nov-2020.)
Assertion
Ref Expression
uspgrupgrushgr (𝐺 ∈ USPGraph ↔ (𝐺 ∈ UPGraph ∧ 𝐺 ∈ USHGraph))

Proof of Theorem uspgrupgrushgr
Dummy variable 𝑥 is distinct from all other variables.
StepHypRef Expression
1 uspgrupgr 29210 . . 3 (𝐺 ∈ USPGraph → 𝐺 ∈ UPGraph)
2 uspgrushgr 29209 . . 3 (𝐺 ∈ USPGraph → 𝐺 ∈ USHGraph)
31, 2jca 511 . 2 (𝐺 ∈ USPGraph → (𝐺 ∈ UPGraph ∧ 𝐺 ∈ USHGraph))
4 eqid 2735 . . . . 5 (Vtx‘𝐺) = (Vtx‘𝐺)
5 eqid 2735 . . . . 5 (iEdg‘𝐺) = (iEdg‘𝐺)
64, 5ushgrf 29095 . . . 4 (𝐺 ∈ USHGraph → (iEdg‘𝐺):dom (iEdg‘𝐺)–1-1→(𝒫 (Vtx‘𝐺) ∖ {∅}))
7 edgval 29081 . . . . 5 (Edg‘𝐺) = ran (iEdg‘𝐺)
8 upgredgss 29164 . . . . 5 (𝐺 ∈ UPGraph → (Edg‘𝐺) ⊆ {𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) ≤ 2})
97, 8eqsstrrid 4045 . . . 4 (𝐺 ∈ UPGraph → ran (iEdg‘𝐺) ⊆ {𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) ≤ 2})
10 f1ssr 6811 . . . 4 (((iEdg‘𝐺):dom (iEdg‘𝐺)–1-1→(𝒫 (Vtx‘𝐺) ∖ {∅}) ∧ ran (iEdg‘𝐺) ⊆ {𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) ≤ 2}) → (iEdg‘𝐺):dom (iEdg‘𝐺)–1-1→{𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) ≤ 2})
116, 9, 10syl2anr 597 . . 3 ((𝐺 ∈ UPGraph ∧ 𝐺 ∈ USHGraph) → (iEdg‘𝐺):dom (iEdg‘𝐺)–1-1→{𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) ≤ 2})
124, 5isuspgr 29184 . . . 4 (𝐺 ∈ UPGraph → (𝐺 ∈ USPGraph ↔ (iEdg‘𝐺):dom (iEdg‘𝐺)–1-1→{𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) ≤ 2}))
1312adantr 480 . . 3 ((𝐺 ∈ UPGraph ∧ 𝐺 ∈ USHGraph) → (𝐺 ∈ USPGraph ↔ (iEdg‘𝐺):dom (iEdg‘𝐺)–1-1→{𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) ≤ 2}))
1411, 13mpbird 257 . 2 ((𝐺 ∈ UPGraph ∧ 𝐺 ∈ USHGraph) → 𝐺 ∈ USPGraph)
153, 14impbii 209 1 (𝐺 ∈ USPGraph ↔ (𝐺 ∈ UPGraph ∧ 𝐺 ∈ USHGraph))
Colors of variables: wff setvar class
Syntax hints:  wb 206  wa 395  wcel 2106  {crab 3433  cdif 3960  wss 3963  c0 4339  𝒫 cpw 4605  {csn 4631   class class class wbr 5148  dom cdm 5689  ran crn 5690  1-1wf1 6560  cfv 6563  cle 11294  2c2 12319  chash 14366  Vtxcvtx 29028  iEdgciedg 29029  Edgcedg 29079  USHGraphcushgr 29089  UPGraphcupgr 29112  USPGraphcuspgr 29180
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1908  ax-6 1965  ax-7 2005  ax-8 2108  ax-9 2116  ax-10 2139  ax-11 2155  ax-12 2175  ax-ext 2706  ax-sep 5302  ax-nul 5312  ax-pr 5438  ax-un 7754
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1540  df-fal 1550  df-ex 1777  df-nf 1781  df-sb 2063  df-mo 2538  df-eu 2567  df-clab 2713  df-cleq 2727  df-clel 2814  df-nfc 2890  df-ne 2939  df-ral 3060  df-rex 3069  df-rab 3434  df-v 3480  df-sbc 3792  df-dif 3966  df-un 3968  df-in 3970  df-ss 3980  df-nul 4340  df-if 4532  df-pw 4607  df-sn 4632  df-pr 4634  df-op 4638  df-uni 4913  df-br 5149  df-opab 5211  df-mpt 5232  df-id 5583  df-xp 5695  df-rel 5696  df-cnv 5697  df-co 5698  df-dm 5699  df-rn 5700  df-iota 6516  df-fun 6565  df-fn 6566  df-f 6567  df-f1 6568  df-fv 6571  df-edg 29080  df-ushgr 29091  df-upgr 29114  df-uspgr 29182
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator