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

Theorem usgredg2ALT 26974
Description: Alternate proof of usgredg2 26973, not using umgredg2 26884. (Contributed by Alexander van der Vekens, 11-Aug-2017.) (Revised by AV, 16-Oct-2020.) (New usage is discouraged.) (Proof modification is discouraged.)
Hypothesis
Ref Expression
usgredg2.e 𝐸 = (iEdg‘𝐺)
Assertion
Ref Expression
usgredg2ALT ((𝐺 ∈ USGraph ∧ 𝑋 ∈ dom 𝐸) → (♯‘(𝐸𝑋)) = 2)

Proof of Theorem usgredg2ALT
Dummy variable 𝑥 is distinct from all other variables.
StepHypRef Expression
1 eqid 2821 . . . . 5 (Vtx‘𝐺) = (Vtx‘𝐺)
2 usgredg2.e . . . . 5 𝐸 = (iEdg‘𝐺)
31, 2usgrf 26939 . . . 4 (𝐺 ∈ USGraph → 𝐸:dom 𝐸1-1→{𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) = 2})
4 f1f 6574 . . . 4 (𝐸:dom 𝐸1-1→{𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) = 2} → 𝐸:dom 𝐸⟶{𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) = 2})
53, 4syl 17 . . 3 (𝐺 ∈ USGraph → 𝐸:dom 𝐸⟶{𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) = 2})
65ffvelrnda 6850 . 2 ((𝐺 ∈ USGraph ∧ 𝑋 ∈ dom 𝐸) → (𝐸𝑋) ∈ {𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) = 2})
7 fveq2 6669 . . . . 5 (𝑥 = (𝐸𝑋) → (♯‘𝑥) = (♯‘(𝐸𝑋)))
87eqeq1d 2823 . . . 4 (𝑥 = (𝐸𝑋) → ((♯‘𝑥) = 2 ↔ (♯‘(𝐸𝑋)) = 2))
98elrab 3679 . . 3 ((𝐸𝑋) ∈ {𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) = 2} ↔ ((𝐸𝑋) ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∧ (♯‘(𝐸𝑋)) = 2))
109simprbi 499 . 2 ((𝐸𝑋) ∈ {𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) = 2} → (♯‘(𝐸𝑋)) = 2)
116, 10syl 17 1 ((𝐺 ∈ USGraph ∧ 𝑋 ∈ dom 𝐸) → (♯‘(𝐸𝑋)) = 2)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 398   = wceq 1533  wcel 2110  {crab 3142  cdif 3932  c0 4290  𝒫 cpw 4538  {csn 4566  dom cdm 5554  wf 6350  1-1wf1 6351  cfv 6354  2c2 11691  chash 13689  Vtxcvtx 26780  iEdgciedg 26781  USGraphcusgr 26933
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 1907  ax-6 1966  ax-7 2011  ax-8 2112  ax-9 2120  ax-10 2141  ax-11 2157  ax-12 2173  ax-ext 2793  ax-sep 5202  ax-nul 5209  ax-pr 5329
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1085  df-tru 1536  df-ex 1777  df-nf 1781  df-sb 2066  df-mo 2618  df-eu 2650  df-clab 2800  df-cleq 2814  df-clel 2893  df-nfc 2963  df-ral 3143  df-rex 3144  df-rab 3147  df-v 3496  df-sbc 3772  df-dif 3938  df-un 3940  df-in 3942  df-ss 3951  df-nul 4291  df-if 4467  df-pw 4540  df-sn 4567  df-pr 4569  df-op 4573  df-uni 4838  df-br 5066  df-opab 5128  df-id 5459  df-xp 5560  df-rel 5561  df-cnv 5562  df-co 5563  df-dm 5564  df-rn 5565  df-iota 6313  df-fun 6356  df-fn 6357  df-f 6358  df-f1 6359  df-fv 6362  df-usgr 26935
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator