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

Theorem usgredgreu 16340
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 16339 . 2 ((𝐺 ∈ USGraph ∧ 𝑋 ∈ dom 𝐸𝑌 ∈ (𝐸𝑋)) → ∃𝑦𝑉 (𝐸𝑋) = {𝑌, 𝑦})
4 eqtr2 2253 . . . . 5 (((𝐸𝑋) = {𝑌, 𝑦} ∧ (𝐸𝑋) = {𝑌, 𝑥}) → {𝑌, 𝑦} = {𝑌, 𝑥})
5 vex 2818 . . . . . 6 𝑦 ∈ V
6 vex 2818 . . . . . 6 𝑥 ∈ V
75, 6preqr2 3878 . . . . 5 ({𝑌, 𝑦} = {𝑌, 𝑥} → 𝑦 = 𝑥)
84, 7syl 14 . . . 4 (((𝐸𝑋) = {𝑌, 𝑦} ∧ (𝐸𝑋) = {𝑌, 𝑥}) → 𝑦 = 𝑥)
98a1i 9 . . 3 (((𝐺 ∈ USGraph ∧ 𝑋 ∈ dom 𝐸𝑌 ∈ (𝐸𝑋)) ∧ (𝑦𝑉𝑥𝑉)) → (((𝐸𝑋) = {𝑌, 𝑦} ∧ (𝐸𝑋) = {𝑌, 𝑥}) → 𝑦 = 𝑥))
109ralrimivva 2626 . 2 ((𝐺 ∈ USGraph ∧ 𝑋 ∈ dom 𝐸𝑌 ∈ (𝐸𝑋)) → ∀𝑦𝑉𝑥𝑉 (((𝐸𝑋) = {𝑌, 𝑦} ∧ (𝐸𝑋) = {𝑌, 𝑥}) → 𝑦 = 𝑥))
11 preq2 3774 . . . 4 (𝑦 = 𝑥 → {𝑌, 𝑦} = {𝑌, 𝑥})
1211eqeq2d 2246 . . 3 (𝑦 = 𝑥 → ((𝐸𝑋) = {𝑌, 𝑦} ↔ (𝐸𝑋) = {𝑌, 𝑥}))
1312reu4 3014 . 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 2205  wral 2522  wrex 2523  ∃!wreu 2524  {cpr 3695  dom cdm 4754  cfv 5357  Vtxcvtx 16136  iEdgciedg 16137  USGraphcusgr 16278
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 2207  ax-14 2208  ax-ext 2216  ax-sep 4233  ax-nul 4241  ax-pow 4292  ax-pr 4327  ax-un 4559  ax-setind 4664  ax-iinf 4715  ax-cnex 8234  ax-resscn 8235  ax-1cn 8236  ax-1re 8237  ax-icn 8238  ax-addcl 8239  ax-addrcl 8240  ax-mulcl 8241  ax-addcom 8243  ax-mulcom 8244  ax-addass 8245  ax-mulass 8246  ax-distr 8247  ax-i2m1 8248  ax-1rid 8250  ax-0id 8251  ax-rnegex 8252  ax-cnre 8254
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 2085  df-mo 2086  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ne 2415  df-ral 2527  df-rex 2528  df-reu 2529  df-rmo 2530  df-rab 2531  df-v 2817  df-sbc 3046  df-csb 3142  df-dif 3216  df-un 3218  df-in 3220  df-ss 3227  df-nul 3513  df-if 3625  df-pw 3676  df-sn 3700  df-pr 3701  df-op 3703  df-uni 3920  df-int 3955  df-br 4115  df-opab 4177  df-mpt 4178  df-tr 4214  df-id 4419  df-iord 4492  df-on 4494  df-suc 4497  df-iom 4718  df-xp 4760  df-rel 4761  df-cnv 4762  df-co 4763  df-dm 4764  df-rn 4765  df-res 4766  df-ima 4767  df-iota 5317  df-fun 5359  df-fn 5360  df-f 5361  df-f1 5362  df-fo 5363  df-f1o 5364  df-fv 5365  df-riota 6011  df-ov 6061  df-oprab 6062  df-mpo 6063  df-1st 6347  df-2nd 6348  df-1o 6660  df-2o 6661  df-er 6780  df-en 6989  df-sub 8463  df-inn 9258  df-2 9316  df-3 9317  df-4 9318  df-5 9319  df-6 9320  df-7 9321  df-8 9322  df-9 9323  df-n0 9517  df-dec 9731  df-ndx 13302  df-slot 13303  df-base 13305  df-edgf 16129  df-vtx 16138  df-iedg 16139  df-edg 16182  df-umgren 16218  df-usgren 16280
This theorem is referenced by:  usgredg2vlem1  16346  usgredg2vlem2  16347
  Copyright terms: Public domain W3C validator