ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  usgredgreu GIF version

Theorem usgredgreu 16198
Description: For a vertex incident to an edge there is exactly one other vertex incident to the edge. (Contributed by Alexander van der Vekens, 4-Jan-2018.) (Revised by AV, 18-Oct-2020.)
Hypotheses
Ref Expression
usgredg3.v 𝑉 = (Vtx‘𝐺)
usgredg3.e 𝐸 = (iEdg‘𝐺)
Assertion
Ref Expression
usgredgreu ((𝐺 ∈ USGraph ∧ 𝑋 ∈ dom 𝐸𝑌 ∈ (𝐸𝑋)) → ∃!𝑦𝑉 (𝐸𝑋) = {𝑌, 𝑦})
Distinct variable groups:   𝑦,𝐸   𝑦,𝐺   𝑦,𝑉   𝑦,𝑋   𝑦,𝑌

Proof of Theorem usgredgreu
Dummy variable 𝑥 is distinct from all other variables.
StepHypRef Expression
1 usgredg3.v . . 3 𝑉 = (Vtx‘𝐺)
2 usgredg3.e . . 3 𝐸 = (iEdg‘𝐺)
31, 2usgredg4 16197 . 2 ((𝐺 ∈ USGraph ∧ 𝑋 ∈ dom 𝐸𝑌 ∈ (𝐸𝑋)) → ∃𝑦𝑉 (𝐸𝑋) = {𝑌, 𝑦})
4 eqtr2 2251 . . . . 5 (((𝐸𝑋) = {𝑌, 𝑦} ∧ (𝐸𝑋) = {𝑌, 𝑥}) → {𝑌, 𝑦} = {𝑌, 𝑥})
5 vex 2815 . . . . . 6 𝑦 ∈ V
6 vex 2815 . . . . . 6 𝑥 ∈ V
75, 6preqr2 3872 . . . . 5 ({𝑌, 𝑦} = {𝑌, 𝑥} → 𝑦 = 𝑥)
84, 7syl 14 . . . 4 (((𝐸𝑋) = {𝑌, 𝑦} ∧ (𝐸𝑋) = {𝑌, 𝑥}) → 𝑦 = 𝑥)
98a1i 9 . . 3 (((𝐺 ∈ USGraph ∧ 𝑋 ∈ dom 𝐸𝑌 ∈ (𝐸𝑋)) ∧ (𝑦𝑉𝑥𝑉)) → (((𝐸𝑋) = {𝑌, 𝑦} ∧ (𝐸𝑋) = {𝑌, 𝑥}) → 𝑦 = 𝑥))
109ralrimivva 2624 . 2 ((𝐺 ∈ USGraph ∧ 𝑋 ∈ dom 𝐸𝑌 ∈ (𝐸𝑋)) → ∀𝑦𝑉𝑥𝑉 (((𝐸𝑋) = {𝑌, 𝑦} ∧ (𝐸𝑋) = {𝑌, 𝑥}) → 𝑦 = 𝑥))
11 preq2 3768 . . . 4 (𝑦 = 𝑥 → {𝑌, 𝑦} = {𝑌, 𝑥})
1211eqeq2d 2244 . . 3 (𝑦 = 𝑥 → ((𝐸𝑋) = {𝑌, 𝑦} ↔ (𝐸𝑋) = {𝑌, 𝑥}))
1312reu4 3010 . 2 (∃!𝑦𝑉 (𝐸𝑋) = {𝑌, 𝑦} ↔ (∃𝑦𝑉 (𝐸𝑋) = {𝑌, 𝑦} ∧ ∀𝑦𝑉𝑥𝑉 (((𝐸𝑋) = {𝑌, 𝑦} ∧ (𝐸𝑋) = {𝑌, 𝑥}) → 𝑦 = 𝑥)))
143, 10, 13sylanbrc 417 1 ((𝐺 ∈ USGraph ∧ 𝑋 ∈ dom 𝐸𝑌 ∈ (𝐸𝑋)) → ∃!𝑦𝑉 (𝐸𝑋) = {𝑌, 𝑦})
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  w3a 1005   = wceq 1398  wcel 2203  wral 2520  wrex 2521  ∃!wreu 2522  {cpr 3689  dom cdm 4748  cfv 5351  Vtxcvtx 15994  iEdgciedg 15995  USGraphcusgr 16136
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2205  ax-14 2206  ax-ext 2214  ax-sep 4227  ax-nul 4235  ax-pow 4286  ax-pr 4321  ax-un 4553  ax-setind 4658  ax-iinf 4709  ax-cnex 8214  ax-resscn 8215  ax-1cn 8216  ax-1re 8217  ax-icn 8218  ax-addcl 8219  ax-addrcl 8220  ax-mulcl 8221  ax-addcom 8223  ax-mulcom 8224  ax-addass 8225  ax-mulass 8226  ax-distr 8227  ax-i2m1 8228  ax-1rid 8230  ax-0id 8231  ax-rnegex 8232  ax-cnre 8234
This theorem depends on definitions:  df-bi 117  df-dc 843  df-3or 1006  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1812  df-eu 2083  df-mo 2084  df-clab 2219  df-cleq 2225  df-clel 2228  df-nfc 2373  df-ne 2413  df-ral 2525  df-rex 2526  df-reu 2527  df-rmo 2528  df-rab 2529  df-v 2814  df-sbc 3042  df-csb 3138  df-dif 3212  df-un 3214  df-in 3216  df-ss 3223  df-nul 3508  df-if 3620  df-pw 3670  df-sn 3694  df-pr 3695  df-op 3697  df-uni 3914  df-int 3949  df-br 4109  df-opab 4171  df-mpt 4172  df-tr 4208  df-id 4413  df-iord 4486  df-on 4488  df-suc 4491  df-iom 4712  df-xp 4754  df-rel 4755  df-cnv 4756  df-co 4757  df-dm 4758  df-rn 4759  df-res 4760  df-ima 4761  df-iota 5311  df-fun 5353  df-fn 5354  df-f 5355  df-f1 5356  df-fo 5357  df-f1o 5358  df-fv 5359  df-riota 6002  df-ov 6052  df-oprab 6053  df-mpo 6054  df-1st 6333  df-2nd 6334  df-1o 6646  df-2o 6647  df-er 6766  df-en 6975  df-sub 8442  df-inn 9234  df-2 9292  df-3 9293  df-4 9294  df-5 9295  df-6 9296  df-7 9297  df-8 9298  df-9 9299  df-n0 9493  df-dec 9706  df-ndx 13204  df-slot 13205  df-base 13207  df-edgf 15987  df-vtx 15996  df-iedg 15997  df-edg 16040  df-umgren 16076  df-usgren 16138
This theorem is referenced by:  usgredg2vlem1  16204  usgredg2vlem2  16205
  Copyright terms: Public domain W3C validator