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

Theorem usgredg2vtxeuALT 28468
Description: Alternate proof of usgredg2vtxeu 28467, using edgiedgb 28303, the general translation from (iEdg‘𝐺) to (Edg‘𝐺). (Contributed by AV, 18-Oct-2020.) (Proof modification is discouraged.) (New usage is discouraged.)
Assertion
Ref Expression
usgredg2vtxeuALT ((𝐺 ∈ USGraph ∧ 𝐸 ∈ (Edg‘𝐺) ∧ 𝑌𝐸) → ∃!𝑦 ∈ (Vtx‘𝐺)𝐸 = {𝑌, 𝑦})
Distinct variable groups:   𝑦,𝐸   𝑦,𝐺   𝑦,𝑌

Proof of Theorem usgredg2vtxeuALT
Dummy variable 𝑥 is distinct from all other variables.
StepHypRef Expression
1 usgruhgr 28432 . . . 4 (𝐺 ∈ USGraph → 𝐺 ∈ UHGraph)
2 eqid 2732 . . . . 5 (iEdg‘𝐺) = (iEdg‘𝐺)
32uhgredgiedgb 28375 . . . 4 (𝐺 ∈ UHGraph → (𝐸 ∈ (Edg‘𝐺) ↔ ∃𝑥 ∈ dom (iEdg‘𝐺)𝐸 = ((iEdg‘𝐺)‘𝑥)))
41, 3syl 17 . . 3 (𝐺 ∈ USGraph → (𝐸 ∈ (Edg‘𝐺) ↔ ∃𝑥 ∈ dom (iEdg‘𝐺)𝐸 = ((iEdg‘𝐺)‘𝑥)))
5 eqid 2732 . . . . . . . . 9 (Vtx‘𝐺) = (Vtx‘𝐺)
65, 2usgredgreu 28464 . . . . . . . 8 ((𝐺 ∈ USGraph ∧ 𝑥 ∈ dom (iEdg‘𝐺) ∧ 𝑌 ∈ ((iEdg‘𝐺)‘𝑥)) → ∃!𝑦 ∈ (Vtx‘𝐺)((iEdg‘𝐺)‘𝑥) = {𝑌, 𝑦})
763expia 1121 . . . . . . 7 ((𝐺 ∈ USGraph ∧ 𝑥 ∈ dom (iEdg‘𝐺)) → (𝑌 ∈ ((iEdg‘𝐺)‘𝑥) → ∃!𝑦 ∈ (Vtx‘𝐺)((iEdg‘𝐺)‘𝑥) = {𝑌, 𝑦}))
873adant3 1132 . . . . . 6 ((𝐺 ∈ USGraph ∧ 𝑥 ∈ dom (iEdg‘𝐺) ∧ 𝐸 = ((iEdg‘𝐺)‘𝑥)) → (𝑌 ∈ ((iEdg‘𝐺)‘𝑥) → ∃!𝑦 ∈ (Vtx‘𝐺)((iEdg‘𝐺)‘𝑥) = {𝑌, 𝑦}))
9 eleq2 2822 . . . . . . . 8 (𝐸 = ((iEdg‘𝐺)‘𝑥) → (𝑌𝐸𝑌 ∈ ((iEdg‘𝐺)‘𝑥)))
10 eqeq1 2736 . . . . . . . . 9 (𝐸 = ((iEdg‘𝐺)‘𝑥) → (𝐸 = {𝑌, 𝑦} ↔ ((iEdg‘𝐺)‘𝑥) = {𝑌, 𝑦}))
1110reubidv 3394 . . . . . . . 8 (𝐸 = ((iEdg‘𝐺)‘𝑥) → (∃!𝑦 ∈ (Vtx‘𝐺)𝐸 = {𝑌, 𝑦} ↔ ∃!𝑦 ∈ (Vtx‘𝐺)((iEdg‘𝐺)‘𝑥) = {𝑌, 𝑦}))
129, 11imbi12d 344 . . . . . . 7 (𝐸 = ((iEdg‘𝐺)‘𝑥) → ((𝑌𝐸 → ∃!𝑦 ∈ (Vtx‘𝐺)𝐸 = {𝑌, 𝑦}) ↔ (𝑌 ∈ ((iEdg‘𝐺)‘𝑥) → ∃!𝑦 ∈ (Vtx‘𝐺)((iEdg‘𝐺)‘𝑥) = {𝑌, 𝑦})))
13123ad2ant3 1135 . . . . . 6 ((𝐺 ∈ USGraph ∧ 𝑥 ∈ dom (iEdg‘𝐺) ∧ 𝐸 = ((iEdg‘𝐺)‘𝑥)) → ((𝑌𝐸 → ∃!𝑦 ∈ (Vtx‘𝐺)𝐸 = {𝑌, 𝑦}) ↔ (𝑌 ∈ ((iEdg‘𝐺)‘𝑥) → ∃!𝑦 ∈ (Vtx‘𝐺)((iEdg‘𝐺)‘𝑥) = {𝑌, 𝑦})))
148, 13mpbird 256 . . . . 5 ((𝐺 ∈ USGraph ∧ 𝑥 ∈ dom (iEdg‘𝐺) ∧ 𝐸 = ((iEdg‘𝐺)‘𝑥)) → (𝑌𝐸 → ∃!𝑦 ∈ (Vtx‘𝐺)𝐸 = {𝑌, 𝑦}))
15143exp 1119 . . . 4 (𝐺 ∈ USGraph → (𝑥 ∈ dom (iEdg‘𝐺) → (𝐸 = ((iEdg‘𝐺)‘𝑥) → (𝑌𝐸 → ∃!𝑦 ∈ (Vtx‘𝐺)𝐸 = {𝑌, 𝑦}))))
1615rexlimdv 3153 . . 3 (𝐺 ∈ USGraph → (∃𝑥 ∈ dom (iEdg‘𝐺)𝐸 = ((iEdg‘𝐺)‘𝑥) → (𝑌𝐸 → ∃!𝑦 ∈ (Vtx‘𝐺)𝐸 = {𝑌, 𝑦})))
174, 16sylbid 239 . 2 (𝐺 ∈ USGraph → (𝐸 ∈ (Edg‘𝐺) → (𝑌𝐸 → ∃!𝑦 ∈ (Vtx‘𝐺)𝐸 = {𝑌, 𝑦})))
18173imp 1111 1 ((𝐺 ∈ USGraph ∧ 𝐸 ∈ (Edg‘𝐺) ∧ 𝑌𝐸) → ∃!𝑦 ∈ (Vtx‘𝐺)𝐸 = {𝑌, 𝑦})
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 205  w3a 1087   = wceq 1541  wcel 2106  wrex 3070  ∃!wreu 3374  {cpr 4629  dom cdm 5675  cfv 6540  Vtxcvtx 28245  iEdgciedg 28246  Edgcedg 28296  UHGraphcuhgr 28305  USGraphcusgr 28398
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2703  ax-sep 5298  ax-nul 5305  ax-pow 5362  ax-pr 5426  ax-un 7721  ax-cnex 11162  ax-resscn 11163  ax-1cn 11164  ax-icn 11165  ax-addcl 11166  ax-addrcl 11167  ax-mulcl 11168  ax-mulrcl 11169  ax-mulcom 11170  ax-addass 11171  ax-mulass 11172  ax-distr 11173  ax-i2m1 11174  ax-1ne0 11175  ax-1rid 11176  ax-rnegex 11177  ax-rrecex 11178  ax-cnre 11179  ax-pre-lttri 11180  ax-pre-lttrn 11181  ax-pre-ltadd 11182  ax-pre-mulgt0 11183
This theorem depends on definitions:  df-bi 206  df-an 397  df-or 846  df-3or 1088  df-3an 1089  df-tru 1544  df-fal 1554  df-ex 1782  df-nf 1786  df-sb 2068  df-mo 2534  df-eu 2563  df-clab 2710  df-cleq 2724  df-clel 2810  df-nfc 2885  df-ne 2941  df-nel 3047  df-ral 3062  df-rex 3071  df-rmo 3376  df-reu 3377  df-rab 3433  df-v 3476  df-sbc 3777  df-csb 3893  df-dif 3950  df-un 3952  df-in 3954  df-ss 3964  df-pss 3966  df-nul 4322  df-if 4528  df-pw 4603  df-sn 4628  df-pr 4630  df-op 4634  df-uni 4908  df-int 4950  df-iun 4998  df-br 5148  df-opab 5210  df-mpt 5231  df-tr 5265  df-id 5573  df-eprel 5579  df-po 5587  df-so 5588  df-fr 5630  df-we 5632  df-xp 5681  df-rel 5682  df-cnv 5683  df-co 5684  df-dm 5685  df-rn 5686  df-res 5687  df-ima 5688  df-pred 6297  df-ord 6364  df-on 6365  df-lim 6366  df-suc 6367  df-iota 6492  df-fun 6542  df-fn 6543  df-f 6544  df-f1 6545  df-fo 6546  df-f1o 6547  df-fv 6548  df-riota 7361  df-ov 7408  df-oprab 7409  df-mpo 7410  df-om 7852  df-1st 7971  df-2nd 7972  df-frecs 8262  df-wrecs 8293  df-recs 8367  df-rdg 8406  df-1o 8462  df-2o 8463  df-oadd 8466  df-er 8699  df-en 8936  df-dom 8937  df-sdom 8938  df-fin 8939  df-dju 9892  df-card 9930  df-pnf 11246  df-mnf 11247  df-xr 11248  df-ltxr 11249  df-le 11250  df-sub 11442  df-neg 11443  df-nn 12209  df-2 12271  df-n0 12469  df-z 12555  df-uz 12819  df-fz 13481  df-hash 14287  df-edg 28297  df-uhgr 28307  df-upgr 28331  df-umgr 28332  df-uspgr 28399  df-usgr 28400
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator