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

Theorem usgredg2ALT 29603
Description: Alternate proof of usgredg2 29602, not using umgredg2 29507. (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 2765 . . . . 5 (Vtx‘𝐺) = (Vtx‘𝐺)
2 usgredg2.e . . . . 5 𝐸 = (iEdg‘𝐺)
31, 2usgrf 29565 . . . 4 (𝐺 ∈ USGraph → 𝐸:dom 𝐸1-1→{𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) = 2})
4 f1f 6778 . . . 4 (𝐸:dom 𝐸1-1→{𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) = 2} → 𝐸:dom 𝐸⟶{𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) = 2})
53, 4syl 18 . . 3 (𝐺 ∈ USGraph → 𝐸:dom 𝐸⟶{𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) = 2})
65ffvelcdmda 7083 . 2 ((𝐺 ∈ USGraph ∧ 𝑋 ∈ dom 𝐸) → (𝐸𝑋) ∈ {𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) = 2})
7 fveq2 6885 . . . . 5 (𝑥 = (𝐸𝑋) → (♯‘𝑥) = (♯‘(𝐸𝑋)))
87eqeq1d 2767 . . . 4 (𝑥 = (𝐸𝑋) → ((♯‘𝑥) = 2 ↔ (♯‘(𝐸𝑋)) = 2))
98elrab 3652 . . 3 ((𝐸𝑋) ∈ {𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) = 2} ↔ ((𝐸𝑋) ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∧ (♯‘(𝐸𝑋)) = 2))
109simprbi 503 . 2 ((𝐸𝑋) ∈ {𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) = 2} → (♯‘(𝐸𝑋)) = 2)
116, 10syl 18 1 ((𝐺 ∈ USGraph ∧ 𝑋 ∈ dom 𝐸) → (♯‘(𝐸𝑋)) = 2)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4  wa 401   = wceq 1570  wcel 2146  {crab 3418  cdif 3903  c0 4286  𝒫 cpw 4564  {csn 4591  dom cdm 5663  wf 6536  1-1wf1 6537  cfv 6540  2c2 12312  chash 14386  Vtxcvtx 29403  iEdgciedg 29404  USGraphcusgr 29559
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-10 2179  ax-12 2216  ax-ext 2737  ax-sep 5259  ax-nul 5271  ax-pr 5406
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-ne 2961  df-ral 3082  df-rex 3092  df-rab 3419  df-v 3459  df-sbc 3747  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4287  df-if 4490  df-pw 4566  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4875  df-br 5112  df-opab 5176  df-id 5558  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-rn 5674  df-iota 6496  df-fun 6542  df-fn 6543  df-f 6544  df-f1 6545  df-fv 6548  df-usgr 29561
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator