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

Theorem ausgrusgrb 26105
 Description: The equivalence of the definitions of a simple graph. (Contributed by Alexander van der Vekens, 28-Aug-2017.) (Revised by AV, 14-Oct-2020.)
Hypothesis
Ref Expression
ausgr.1 𝐺 = {⟨𝑣, 𝑒⟩ ∣ 𝑒 ⊆ {𝑥 ∈ 𝒫 𝑣 ∣ (#‘𝑥) = 2}}
Assertion
Ref Expression
ausgrusgrb ((𝑉𝑋𝐸𝑌) → (𝑉𝐺𝐸 ↔ ⟨𝑉, ( I ↾ 𝐸)⟩ ∈ USGraph))
Distinct variable groups:   𝑣,𝑒,𝑥,𝐸   𝑒,𝑉,𝑣,𝑥   𝑥,𝑋   𝑥,𝑌
Allowed substitution hints:   𝐺(𝑥,𝑣,𝑒)   𝑋(𝑣,𝑒)   𝑌(𝑣,𝑒)

Proof of Theorem ausgrusgrb
StepHypRef Expression
1 ausgr.1 . . 3 𝐺 = {⟨𝑣, 𝑒⟩ ∣ 𝑒 ⊆ {𝑥 ∈ 𝒫 𝑣 ∣ (#‘𝑥) = 2}}
21isausgr 26104 . 2 ((𝑉𝑋𝐸𝑌) → (𝑉𝐺𝐸𝐸 ⊆ {𝑥 ∈ 𝒫 𝑉 ∣ (#‘𝑥) = 2}))
3 f1oi 6212 . . . . 5 ( I ↾ 𝐸):𝐸1-1-onto𝐸
4 dff1o5 6184 . . . . . 6 (( I ↾ 𝐸):𝐸1-1-onto𝐸 ↔ (( I ↾ 𝐸):𝐸1-1𝐸 ∧ ran ( I ↾ 𝐸) = 𝐸))
5 f1ss 6144 . . . . . . . . . 10 ((( I ↾ 𝐸):𝐸1-1𝐸𝐸 ⊆ {𝑥 ∈ 𝒫 𝑉 ∣ (#‘𝑥) = 2}) → ( I ↾ 𝐸):𝐸1-1→{𝑥 ∈ 𝒫 𝑉 ∣ (#‘𝑥) = 2})
6 dmresi 5492 . . . . . . . . . . . 12 dom ( I ↾ 𝐸) = 𝐸
76eqcomi 2660 . . . . . . . . . . 11 𝐸 = dom ( I ↾ 𝐸)
8 f1eq2 6135 . . . . . . . . . . 11 (𝐸 = dom ( I ↾ 𝐸) → (( I ↾ 𝐸):𝐸1-1→{𝑥 ∈ 𝒫 𝑉 ∣ (#‘𝑥) = 2} ↔ ( I ↾ 𝐸):dom ( I ↾ 𝐸)–1-1→{𝑥 ∈ 𝒫 𝑉 ∣ (#‘𝑥) = 2}))
97, 8ax-mp 5 . . . . . . . . . 10 (( I ↾ 𝐸):𝐸1-1→{𝑥 ∈ 𝒫 𝑉 ∣ (#‘𝑥) = 2} ↔ ( I ↾ 𝐸):dom ( I ↾ 𝐸)–1-1→{𝑥 ∈ 𝒫 𝑉 ∣ (#‘𝑥) = 2})
105, 9sylib 208 . . . . . . . . 9 ((( I ↾ 𝐸):𝐸1-1𝐸𝐸 ⊆ {𝑥 ∈ 𝒫 𝑉 ∣ (#‘𝑥) = 2}) → ( I ↾ 𝐸):dom ( I ↾ 𝐸)–1-1→{𝑥 ∈ 𝒫 𝑉 ∣ (#‘𝑥) = 2})
1110ex 449 . . . . . . . 8 (( I ↾ 𝐸):𝐸1-1𝐸 → (𝐸 ⊆ {𝑥 ∈ 𝒫 𝑉 ∣ (#‘𝑥) = 2} → ( I ↾ 𝐸):dom ( I ↾ 𝐸)–1-1→{𝑥 ∈ 𝒫 𝑉 ∣ (#‘𝑥) = 2}))
1211a1d 25 . . . . . . 7 (( I ↾ 𝐸):𝐸1-1𝐸 → ((𝑉𝑋𝐸𝑌) → (𝐸 ⊆ {𝑥 ∈ 𝒫 𝑉 ∣ (#‘𝑥) = 2} → ( I ↾ 𝐸):dom ( I ↾ 𝐸)–1-1→{𝑥 ∈ 𝒫 𝑉 ∣ (#‘𝑥) = 2})))
1312adantr 480 . . . . . 6 ((( I ↾ 𝐸):𝐸1-1𝐸 ∧ ran ( I ↾ 𝐸) = 𝐸) → ((𝑉𝑋𝐸𝑌) → (𝐸 ⊆ {𝑥 ∈ 𝒫 𝑉 ∣ (#‘𝑥) = 2} → ( I ↾ 𝐸):dom ( I ↾ 𝐸)–1-1→{𝑥 ∈ 𝒫 𝑉 ∣ (#‘𝑥) = 2})))
144, 13sylbi 207 . . . . 5 (( I ↾ 𝐸):𝐸1-1-onto𝐸 → ((𝑉𝑋𝐸𝑌) → (𝐸 ⊆ {𝑥 ∈ 𝒫 𝑉 ∣ (#‘𝑥) = 2} → ( I ↾ 𝐸):dom ( I ↾ 𝐸)–1-1→{𝑥 ∈ 𝒫 𝑉 ∣ (#‘𝑥) = 2})))
153, 14ax-mp 5 . . . 4 ((𝑉𝑋𝐸𝑌) → (𝐸 ⊆ {𝑥 ∈ 𝒫 𝑉 ∣ (#‘𝑥) = 2} → ( I ↾ 𝐸):dom ( I ↾ 𝐸)–1-1→{𝑥 ∈ 𝒫 𝑉 ∣ (#‘𝑥) = 2}))
16 df-f 5930 . . . . . 6 (( I ↾ 𝐸):dom ( I ↾ 𝐸)⟶{𝑥 ∈ 𝒫 𝑉 ∣ (#‘𝑥) = 2} ↔ (( I ↾ 𝐸) Fn dom ( I ↾ 𝐸) ∧ ran ( I ↾ 𝐸) ⊆ {𝑥 ∈ 𝒫 𝑉 ∣ (#‘𝑥) = 2}))
17 rnresi 5514 . . . . . . . . . 10 ran ( I ↾ 𝐸) = 𝐸
1817sseq1i 3662 . . . . . . . . 9 (ran ( I ↾ 𝐸) ⊆ {𝑥 ∈ 𝒫 𝑉 ∣ (#‘𝑥) = 2} ↔ 𝐸 ⊆ {𝑥 ∈ 𝒫 𝑉 ∣ (#‘𝑥) = 2})
1918biimpi 206 . . . . . . . 8 (ran ( I ↾ 𝐸) ⊆ {𝑥 ∈ 𝒫 𝑉 ∣ (#‘𝑥) = 2} → 𝐸 ⊆ {𝑥 ∈ 𝒫 𝑉 ∣ (#‘𝑥) = 2})
2019a1d 25 . . . . . . 7 (ran ( I ↾ 𝐸) ⊆ {𝑥 ∈ 𝒫 𝑉 ∣ (#‘𝑥) = 2} → ((𝑉𝑋𝐸𝑌) → 𝐸 ⊆ {𝑥 ∈ 𝒫 𝑉 ∣ (#‘𝑥) = 2}))
2120adantl 481 . . . . . 6 ((( I ↾ 𝐸) Fn dom ( I ↾ 𝐸) ∧ ran ( I ↾ 𝐸) ⊆ {𝑥 ∈ 𝒫 𝑉 ∣ (#‘𝑥) = 2}) → ((𝑉𝑋𝐸𝑌) → 𝐸 ⊆ {𝑥 ∈ 𝒫 𝑉 ∣ (#‘𝑥) = 2}))
2216, 21sylbi 207 . . . . 5 (( I ↾ 𝐸):dom ( I ↾ 𝐸)⟶{𝑥 ∈ 𝒫 𝑉 ∣ (#‘𝑥) = 2} → ((𝑉𝑋𝐸𝑌) → 𝐸 ⊆ {𝑥 ∈ 𝒫 𝑉 ∣ (#‘𝑥) = 2}))
23 f1f 6139 . . . . 5 (( I ↾ 𝐸):dom ( I ↾ 𝐸)–1-1→{𝑥 ∈ 𝒫 𝑉 ∣ (#‘𝑥) = 2} → ( I ↾ 𝐸):dom ( I ↾ 𝐸)⟶{𝑥 ∈ 𝒫 𝑉 ∣ (#‘𝑥) = 2})
2422, 23syl11 33 . . . 4 ((𝑉𝑋𝐸𝑌) → (( I ↾ 𝐸):dom ( I ↾ 𝐸)–1-1→{𝑥 ∈ 𝒫 𝑉 ∣ (#‘𝑥) = 2} → 𝐸 ⊆ {𝑥 ∈ 𝒫 𝑉 ∣ (#‘𝑥) = 2}))
2515, 24impbid 202 . . 3 ((𝑉𝑋𝐸𝑌) → (𝐸 ⊆ {𝑥 ∈ 𝒫 𝑉 ∣ (#‘𝑥) = 2} ↔ ( I ↾ 𝐸):dom ( I ↾ 𝐸)–1-1→{𝑥 ∈ 𝒫 𝑉 ∣ (#‘𝑥) = 2}))
26 resiexg 7144 . . . . 5 (𝐸𝑌 → ( I ↾ 𝐸) ∈ V)
27 opiedgfv 25932 . . . . 5 ((𝑉𝑋 ∧ ( I ↾ 𝐸) ∈ V) → (iEdg‘⟨𝑉, ( I ↾ 𝐸)⟩) = ( I ↾ 𝐸))
2826, 27sylan2 490 . . . 4 ((𝑉𝑋𝐸𝑌) → (iEdg‘⟨𝑉, ( I ↾ 𝐸)⟩) = ( I ↾ 𝐸))
2928dmeqd 5358 . . . 4 ((𝑉𝑋𝐸𝑌) → dom (iEdg‘⟨𝑉, ( I ↾ 𝐸)⟩) = dom ( I ↾ 𝐸))
30 opvtxfv 25929 . . . . . . 7 ((𝑉𝑋 ∧ ( I ↾ 𝐸) ∈ V) → (Vtx‘⟨𝑉, ( I ↾ 𝐸)⟩) = 𝑉)
3126, 30sylan2 490 . . . . . 6 ((𝑉𝑋𝐸𝑌) → (Vtx‘⟨𝑉, ( I ↾ 𝐸)⟩) = 𝑉)
3231pweqd 4196 . . . . 5 ((𝑉𝑋𝐸𝑌) → 𝒫 (Vtx‘⟨𝑉, ( I ↾ 𝐸)⟩) = 𝒫 𝑉)
3332rabeqdv 3225 . . . 4 ((𝑉𝑋𝐸𝑌) → {𝑥 ∈ 𝒫 (Vtx‘⟨𝑉, ( I ↾ 𝐸)⟩) ∣ (#‘𝑥) = 2} = {𝑥 ∈ 𝒫 𝑉 ∣ (#‘𝑥) = 2})
3428, 29, 33f1eq123d 6169 . . 3 ((𝑉𝑋𝐸𝑌) → ((iEdg‘⟨𝑉, ( I ↾ 𝐸)⟩):dom (iEdg‘⟨𝑉, ( I ↾ 𝐸)⟩)–1-1→{𝑥 ∈ 𝒫 (Vtx‘⟨𝑉, ( I ↾ 𝐸)⟩) ∣ (#‘𝑥) = 2} ↔ ( I ↾ 𝐸):dom ( I ↾ 𝐸)–1-1→{𝑥 ∈ 𝒫 𝑉 ∣ (#‘𝑥) = 2}))
3525, 34bitr4d 271 . 2 ((𝑉𝑋𝐸𝑌) → (𝐸 ⊆ {𝑥 ∈ 𝒫 𝑉 ∣ (#‘𝑥) = 2} ↔ (iEdg‘⟨𝑉, ( I ↾ 𝐸)⟩):dom (iEdg‘⟨𝑉, ( I ↾ 𝐸)⟩)–1-1→{𝑥 ∈ 𝒫 (Vtx‘⟨𝑉, ( I ↾ 𝐸)⟩) ∣ (#‘𝑥) = 2}))
36 opex 4962 . . . . 5 𝑉, ( I ↾ 𝐸)⟩ ∈ V
37 eqid 2651 . . . . . 6 (Vtx‘⟨𝑉, ( I ↾ 𝐸)⟩) = (Vtx‘⟨𝑉, ( I ↾ 𝐸)⟩)
38 eqid 2651 . . . . . 6 (iEdg‘⟨𝑉, ( I ↾ 𝐸)⟩) = (iEdg‘⟨𝑉, ( I ↾ 𝐸)⟩)
3937, 38isusgrs 26096 . . . . 5 (⟨𝑉, ( I ↾ 𝐸)⟩ ∈ V → (⟨𝑉, ( I ↾ 𝐸)⟩ ∈ USGraph ↔ (iEdg‘⟨𝑉, ( I ↾ 𝐸)⟩):dom (iEdg‘⟨𝑉, ( I ↾ 𝐸)⟩)–1-1→{𝑥 ∈ 𝒫 (Vtx‘⟨𝑉, ( I ↾ 𝐸)⟩) ∣ (#‘𝑥) = 2}))
4036, 39ax-mp 5 . . . 4 (⟨𝑉, ( I ↾ 𝐸)⟩ ∈ USGraph ↔ (iEdg‘⟨𝑉, ( I ↾ 𝐸)⟩):dom (iEdg‘⟨𝑉, ( I ↾ 𝐸)⟩)–1-1→{𝑥 ∈ 𝒫 (Vtx‘⟨𝑉, ( I ↾ 𝐸)⟩) ∣ (#‘𝑥) = 2})
4140bicomi 214 . . 3 ((iEdg‘⟨𝑉, ( I ↾ 𝐸)⟩):dom (iEdg‘⟨𝑉, ( I ↾ 𝐸)⟩)–1-1→{𝑥 ∈ 𝒫 (Vtx‘⟨𝑉, ( I ↾ 𝐸)⟩) ∣ (#‘𝑥) = 2} ↔ ⟨𝑉, ( I ↾ 𝐸)⟩ ∈ USGraph)
4241a1i 11 . 2 ((𝑉𝑋𝐸𝑌) → ((iEdg‘⟨𝑉, ( I ↾ 𝐸)⟩):dom (iEdg‘⟨𝑉, ( I ↾ 𝐸)⟩)–1-1→{𝑥 ∈ 𝒫 (Vtx‘⟨𝑉, ( I ↾ 𝐸)⟩) ∣ (#‘𝑥) = 2} ↔ ⟨𝑉, ( I ↾ 𝐸)⟩ ∈ USGraph))
432, 35, 423bitrd 294 1 ((𝑉𝑋𝐸𝑌) → (𝑉𝐺𝐸 ↔ ⟨𝑉, ( I ↾ 𝐸)⟩ ∈ USGraph))
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ↔ wb 196   ∧ wa 383   = wceq 1523   ∈ wcel 2030  {crab 2945  Vcvv 3231   ⊆ wss 3607  𝒫 cpw 4191  ⟨cop 4216   class class class wbr 4685  {copab 4745   I cid 5052  dom cdm 5143  ran crn 5144   ↾ cres 5145   Fn wfn 5921  ⟶wf 5922  –1-1→wf1 5923  –1-1-onto→wf1o 5925  ‘cfv 5926  2c2 11108  #chash 13157  Vtxcvtx 25919  iEdgciedg 25920  USGraphcusgr 26089 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-8 2032  ax-9 2039  ax-10 2059  ax-11 2074  ax-12 2087  ax-13 2282  ax-ext 2631  ax-sep 4814  ax-nul 4822  ax-pow 4873  ax-pr 4936  ax-un 6991  ax-cnex 10030  ax-resscn 10031  ax-1cn 10032  ax-icn 10033  ax-addcl 10034  ax-addrcl 10035  ax-mulcl 10036  ax-mulrcl 10037  ax-mulcom 10038  ax-addass 10039  ax-mulass 10040  ax-distr 10041  ax-i2m1 10042  ax-1ne0 10043  ax-1rid 10044  ax-rnegex 10045  ax-rrecex 10046  ax-cnre 10047  ax-pre-lttri 10048  ax-pre-lttrn 10049  ax-pre-ltadd 10050  ax-pre-mulgt0 10051 This theorem depends on definitions:  df-bi 197  df-or 384  df-an 385  df-3or 1055  df-3an 1056  df-tru 1526  df-ex 1745  df-nf 1750  df-sb 1938  df-eu 2502  df-mo 2503  df-clab 2638  df-cleq 2644  df-clel 2647  df-nfc 2782  df-ne 2824  df-nel 2927  df-ral 2946  df-rex 2947  df-reu 2948  df-rab 2950  df-v 3233  df-sbc 3469  df-csb 3567  df-dif 3610  df-un 3612  df-in 3614  df-ss 3621  df-pss 3623  df-nul 3949  df-if 4120  df-pw 4193  df-sn 4211  df-pr 4213  df-tp 4215  df-op 4217  df-uni 4469  df-int 4508  df-iun 4554  df-br 4686  df-opab 4746  df-mpt 4763  df-tr 4786  df-id 5053  df-eprel 5058  df-po 5064  df-so 5065  df-fr 5102  df-we 5104  df-xp 5149  df-rel 5150  df-cnv 5151  df-co 5152  df-dm 5153  df-rn 5154  df-res 5155  df-ima 5156  df-pred 5718  df-ord 5764  df-on 5765  df-lim 5766  df-suc 5767  df-iota 5889  df-fun 5928  df-fn 5929  df-f 5930  df-f1 5931  df-fo 5932  df-f1o 5933  df-fv 5934  df-riota 6651  df-ov 6693  df-oprab 6694  df-mpt2 6695  df-om 7108  df-1st 7210  df-2nd 7211  df-wrecs 7452  df-recs 7513  df-rdg 7551  df-1o 7605  df-er 7787  df-en 7998  df-dom 7999  df-sdom 8000  df-fin 8001  df-card 8803  df-pnf 10114  df-mnf 10115  df-xr 10116  df-ltxr 10117  df-le 10118  df-sub 10306  df-neg 10307  df-nn 11059  df-2 11117  df-n0 11331  df-z 11416  df-uz 11726  df-fz 12365  df-hash 13158  df-vtx 25921  df-iedg 25922  df-usgr 26091 This theorem is referenced by: (None)
 Copyright terms: Public domain W3C validator