Theorem upgredg2vtx 16389

Description: For a vertex incident to an edge there is another vertex incident to the edge in a pseudograph. (Contributed by AV, 18-Oct-2020.) (Revised by AV, 5-Dec-2020.)

Hypotheses

Ref	Expression
upgredg.v	⊢ 𝑉 = (Vtx‘𝐺)
upgredg.e	⊢ 𝐸 = (Edg‘𝐺)

Assertion

Ref	Expression
upgredg2vtx	⊢ ((𝐺 ∈ UPGraph ∧ 𝐶 ∈ 𝐸 ∧ 𝐴 ∈ 𝐶) → ∃𝑏 ∈ 𝑉 𝐶 = {𝐴, 𝑏})

Distinct variable groups:   𝐶,𝑏   𝐺,𝑏   𝑉,𝑏   𝐴,𝑏

Allowed substitution hint:   𝐸(𝑏)

Proof of Theorem upgredg2vtx

Dummy variables 𝑎 𝑐 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		upgredg.v	. . . 4 ⊢ 𝑉 = (Vtx‘𝐺)
2		upgredg.e	. . . 4 ⊢ 𝐸 = (Edg‘𝐺)
3	1, 2	upgredg 16385	. . 3 ⊢ ((𝐺 ∈ UPGraph ∧ 𝐶 ∈ 𝐸) → ∃𝑎 ∈ 𝑉 ∃𝑐 ∈ 𝑉 𝐶 = {𝑎, 𝑐})
4	3	3adant3 1048	. 2 ⊢ ((𝐺 ∈ UPGraph ∧ 𝐶 ∈ 𝐸 ∧ 𝐴 ∈ 𝐶) → ∃𝑎 ∈ 𝑉 ∃𝑐 ∈ 𝑉 𝐶 = {𝑎, 𝑐})
5		elpr2elpr 3901	. . . . . . 7 ⊢ ((𝑎 ∈ 𝑉 ∧ 𝑐 ∈ 𝑉 ∧ 𝐴 ∈ {𝑎, 𝑐}) → ∃𝑏 ∈ 𝑉 {𝑎, 𝑐} = {𝐴, 𝑏})
6	5	3expia 1236	. . . . . 6 ⊢ ((𝑎 ∈ 𝑉 ∧ 𝑐 ∈ 𝑉) → (𝐴 ∈ {𝑎, 𝑐} → ∃𝑏 ∈ 𝑉 {𝑎, 𝑐} = {𝐴, 𝑏}))
7		eleq2 2302	. . . . . . 7 ⊢ (𝐶 = {𝑎, 𝑐} → (𝐴 ∈ 𝐶 ↔ 𝐴 ∈ {𝑎, 𝑐}))
8		eqeq1 2245	. . . . . . . 8 ⊢ (𝐶 = {𝑎, 𝑐} → (𝐶 = {𝐴, 𝑏} ↔ {𝑎, 𝑐} = {𝐴, 𝑏}))
9	8	rexbidv 2551	. . . . . . 7 ⊢ (𝐶 = {𝑎, 𝑐} → (∃𝑏 ∈ 𝑉 𝐶 = {𝐴, 𝑏} ↔ ∃𝑏 ∈ 𝑉 {𝑎, 𝑐} = {𝐴, 𝑏}))
10	7, 9	imbi12d 234	. . . . . 6 ⊢ (𝐶 = {𝑎, 𝑐} → ((𝐴 ∈ 𝐶 → ∃𝑏 ∈ 𝑉 𝐶 = {𝐴, 𝑏}) ↔ (𝐴 ∈ {𝑎, 𝑐} → ∃𝑏 ∈ 𝑉 {𝑎, 𝑐} = {𝐴, 𝑏})))
11	6, 10	imbitrrid 156	. . . . 5 ⊢ (𝐶 = {𝑎, 𝑐} → ((𝑎 ∈ 𝑉 ∧ 𝑐 ∈ 𝑉) → (𝐴 ∈ 𝐶 → ∃𝑏 ∈ 𝑉 𝐶 = {𝐴, 𝑏})))
12	11	com13 80	. . . 4 ⊢ (𝐴 ∈ 𝐶 → ((𝑎 ∈ 𝑉 ∧ 𝑐 ∈ 𝑉) → (𝐶 = {𝑎, 𝑐} → ∃𝑏 ∈ 𝑉 𝐶 = {𝐴, 𝑏})))
13	12	3ad2ant3 1051	. . 3 ⊢ ((𝐺 ∈ UPGraph ∧ 𝐶 ∈ 𝐸 ∧ 𝐴 ∈ 𝐶) → ((𝑎 ∈ 𝑉 ∧ 𝑐 ∈ 𝑉) → (𝐶 = {𝑎, 𝑐} → ∃𝑏 ∈ 𝑉 𝐶 = {𝐴, 𝑏})))
14	13	rexlimdvv 2675	. 2 ⊢ ((𝐺 ∈ UPGraph ∧ 𝐶 ∈ 𝐸 ∧ 𝐴 ∈ 𝐶) → (∃𝑎 ∈ 𝑉 ∃𝑐 ∈ 𝑉 𝐶 = {𝑎, 𝑐} → ∃𝑏 ∈ 𝑉 𝐶 = {𝐴, 𝑏}))
15	4, 14	mpd 13	1 ⊢ ((𝐺 ∈ UPGraph ∧ 𝐶 ∈ 𝐸 ∧ 𝐴 ∈ 𝐶) → ∃𝑏 ∈ 𝑉 𝐶 = {𝐴, 𝑏})

This proof depends on syntax axioms:   → wi 4   ∧ wa 104   ∧ w3a 1009   = wceq 1402   ∈ wcel 2209  ∃wrex 2529  {cpr 3710  ‘cfv 5377  Vtxcvtx 16253  Edgcedg 16298  UPGraphcupgr 16332

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4249  ax-nul 4259  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-setind 4684  ax-cnex 8270  ax-resscn 8271  ax-1cn 8272  ax-1re 8273  ax-icn 8274  ax-addcl 8275  ax-addrcl 8276  ax-mulcl 8277  ax-addcom 8279  ax-mulcom 8280  ax-addass 8281  ax-mulass 8282  ax-distr 8283  ax-i2m1 8284  ax-1rid 8286  ax-0id 8287  ax-rnegex 8288  ax-cnre 8290

This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-ral 2533  df-rex 2534  df-reu 2535  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-if 3639  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-br 4131  df-opab 4193  df-mpt 4194  df-tr 4230  df-id 4438  df-iord 4511  df-on 4513  df-suc 4516  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-ima 4787  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-f1 5382  df-fo 5383  df-f1o 5384  df-fv 5385  df-riota 6038  df-ov 6088  df-oprab 6089  df-mpo 6090  df-1st 6374  df-2nd 6375  df-1o 6687  df-2o 6688  df-en 7023  df-sub 8499  df-inn 9305  df-2 9363  df-3 9364  df-4 9365  df-5 9366  df-6 9367  df-7 9368  df-8 9369  df-9 9370  df-n0 9564  df-dec 9778  df-ndx 13355  df-slot 13356  df-base 13358  df-edgf 16246  df-vtx 16255  df-iedg 16256  df-edg 16299  df-upgren 16334

This theorem is used by:  usgredg2vtx  16458  uspgredg2vtxeu  16459