Theorem uhgr2edg 29463

Description: If a vertex is adjacent to two different vertices in a hypergraph, there are more than one edges starting at this vertex. (Contributed by Alexander van der Vekens, 10-Dec-2017.) (Revised by AV, 11-Feb-2021.)

Hypotheses

Ref	Expression
usgrf1oedg.i	⊢ 𝐼 = (iEdg‘𝐺)
usgrf1oedg.e	⊢ 𝐸 = (Edg‘𝐺)
uhgr2edg.v	⊢ 𝑉 = (Vtx‘𝐺)

Assertion

Ref	Expression
uhgr2edg	⊢ (((𝐺 ∈ UHGraph ∧ 𝐴 ≠ 𝐵) ∧ (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝑁 ∈ 𝑉) ∧ ({𝑁, 𝐴} ∈ 𝐸 ∧ {𝐵, 𝑁} ∈ 𝐸)) → ∃𝑥 ∈ dom 𝐼∃𝑦 ∈ dom 𝐼(𝑥 ≠ 𝑦 ∧ 𝑁 ∈ (𝐼‘𝑥) ∧ 𝑁 ∈ (𝐼‘𝑦)))

Distinct variable groups:   𝑥,𝐺   𝑥,𝐴,𝑦   𝑥,𝐵,𝑦   𝑦,𝐺   𝑥,𝐼,𝑦   𝑥,𝑁,𝑦   𝑥,𝑉,𝑦

Allowed substitution hints:   𝐸(𝑥,𝑦)

Proof of Theorem uhgr2edg

Step	Hyp	Ref	Expression
1		simp1l 1214	. . 3 ⊢ (((𝐺 ∈ UHGraph ∧ 𝐴 ≠ 𝐵) ∧ (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝑁 ∈ 𝑉) ∧ ({𝑁, 𝐴} ∈ 𝐸 ∧ {𝐵, 𝑁} ∈ 𝐸)) → 𝐺 ∈ UHGraph)
2		simp1r 1215	. . 3 ⊢ (((𝐺 ∈ UHGraph ∧ 𝐴 ≠ 𝐵) ∧ (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝑁 ∈ 𝑉) ∧ ({𝑁, 𝐴} ∈ 𝐸 ∧ {𝐵, 𝑁} ∈ 𝐸)) → 𝐴 ≠ 𝐵)
3		simp23 1225	. . . 4 ⊢ (((𝐺 ∈ UHGraph ∧ 𝐴 ≠ 𝐵) ∧ (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝑁 ∈ 𝑉) ∧ ({𝑁, 𝐴} ∈ 𝐸 ∧ {𝐵, 𝑁} ∈ 𝐸)) → 𝑁 ∈ 𝑉)
4		simp21 1223	. . . 4 ⊢ (((𝐺 ∈ UHGraph ∧ 𝐴 ≠ 𝐵) ∧ (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝑁 ∈ 𝑉) ∧ ({𝑁, 𝐴} ∈ 𝐸 ∧ {𝐵, 𝑁} ∈ 𝐸)) → 𝐴 ∈ 𝑉)
5		3simpc 1166	. . . . 5 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝑁 ∈ 𝑉) → (𝐵 ∈ 𝑉 ∧ 𝑁 ∈ 𝑉))
6	5	3ad2ant2 1150	. . . 4 ⊢ (((𝐺 ∈ UHGraph ∧ 𝐴 ≠ 𝐵) ∧ (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝑁 ∈ 𝑉) ∧ ({𝑁, 𝐴} ∈ 𝐸 ∧ {𝐵, 𝑁} ∈ 𝐸)) → (𝐵 ∈ 𝑉 ∧ 𝑁 ∈ 𝑉))
7	3, 4, 6	jca31 523	. . 3 ⊢ (((𝐺 ∈ UHGraph ∧ 𝐴 ≠ 𝐵) ∧ (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝑁 ∈ 𝑉) ∧ ({𝑁, 𝐴} ∈ 𝐸 ∧ {𝐵, 𝑁} ∈ 𝐸)) → ((𝑁 ∈ 𝑉 ∧ 𝐴 ∈ 𝑉) ∧ (𝐵 ∈ 𝑉 ∧ 𝑁 ∈ 𝑉)))
8	1, 2, 7	jca31 523	. 2 ⊢ (((𝐺 ∈ UHGraph ∧ 𝐴 ≠ 𝐵) ∧ (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝑁 ∈ 𝑉) ∧ ({𝑁, 𝐴} ∈ 𝐸 ∧ {𝐵, 𝑁} ∈ 𝐸)) → ((𝐺 ∈ UHGraph ∧ 𝐴 ≠ 𝐵) ∧ ((𝑁 ∈ 𝑉 ∧ 𝐴 ∈ 𝑉) ∧ (𝐵 ∈ 𝑉 ∧ 𝑁 ∈ 𝑉))))
9		simp3 1154	. 2 ⊢ (((𝐺 ∈ UHGraph ∧ 𝐴 ≠ 𝐵) ∧ (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝑁 ∈ 𝑉) ∧ ({𝑁, 𝐴} ∈ 𝐸 ∧ {𝐵, 𝑁} ∈ 𝐸)) → ({𝑁, 𝐴} ∈ 𝐸 ∧ {𝐵, 𝑁} ∈ 𝐸))
10		usgrf1oedg.e	. . . . . . . . 9 ⊢ 𝐸 = (Edg‘𝐺)
11	10	a1i 11	. . . . . . . 8 ⊢ (𝐺 ∈ UHGraph → 𝐸 = (Edg‘𝐺))
12		edgval 29304	. . . . . . . . 9 ⊢ (Edg‘𝐺) = ran (iEdg‘𝐺)
13	12	a1i 11	. . . . . . . 8 ⊢ (𝐺 ∈ UHGraph → (Edg‘𝐺) = ran (iEdg‘𝐺))
14		usgrf1oedg.i	. . . . . . . . . . 11 ⊢ 𝐼 = (iEdg‘𝐺)
15	14	eqcomi 2774	. . . . . . . . . 10 ⊢ (iEdg‘𝐺) = 𝐼
16	15	a1i 11	. . . . . . . . 9 ⊢ (𝐺 ∈ UHGraph → (iEdg‘𝐺) = 𝐼)
17	16	rneqd 5918	. . . . . . . 8 ⊢ (𝐺 ∈ UHGraph → ran (iEdg‘𝐺) = ran 𝐼)
18	11, 13, 17	3eqtrd 2804	. . . . . . 7 ⊢ (𝐺 ∈ UHGraph → 𝐸 = ran 𝐼)
19	18	eleq2d 2851	. . . . . 6 ⊢ (𝐺 ∈ UHGraph → ({𝑁, 𝐴} ∈ 𝐸 ↔ {𝑁, 𝐴} ∈ ran 𝐼))
20	18	eleq2d 2851	. . . . . 6 ⊢ (𝐺 ∈ UHGraph → ({𝐵, 𝑁} ∈ 𝐸 ↔ {𝐵, 𝑁} ∈ ran 𝐼))
21	19, 20	anbi12d 643	. . . . 5 ⊢ (𝐺 ∈ UHGraph → (({𝑁, 𝐴} ∈ 𝐸 ∧ {𝐵, 𝑁} ∈ 𝐸) ↔ ({𝑁, 𝐴} ∈ ran 𝐼 ∧ {𝐵, 𝑁} ∈ ran 𝐼)))
22	14	uhgrfun 29321	. . . . . . 7 ⊢ (𝐺 ∈ UHGraph → Fun 𝐼)
23	22	funfnd 6556	. . . . . 6 ⊢ (𝐺 ∈ UHGraph → 𝐼 Fn dom 𝐼)
24		fvelrnb 6931	. . . . . . 7 ⊢ (𝐼 Fn dom 𝐼 → ({𝑁, 𝐴} ∈ ran 𝐼 ↔ ∃𝑥 ∈ dom 𝐼(𝐼‘𝑥) = {𝑁, 𝐴}))
25		fvelrnb 6931	. . . . . . 7 ⊢ (𝐼 Fn dom 𝐼 → ({𝐵, 𝑁} ∈ ran 𝐼 ↔ ∃𝑦 ∈ dom 𝐼(𝐼‘𝑦) = {𝐵, 𝑁}))
26	24, 25	anbi12d 643	. . . . . 6 ⊢ (𝐼 Fn dom 𝐼 → (({𝑁, 𝐴} ∈ ran 𝐼 ∧ {𝐵, 𝑁} ∈ ran 𝐼) ↔ (∃𝑥 ∈ dom 𝐼(𝐼‘𝑥) = {𝑁, 𝐴} ∧ ∃𝑦 ∈ dom 𝐼(𝐼‘𝑦) = {𝐵, 𝑁})))
27	23, 26	syl 18	. . . . 5 ⊢ (𝐺 ∈ UHGraph → (({𝑁, 𝐴} ∈ ran 𝐼 ∧ {𝐵, 𝑁} ∈ ran 𝐼) ↔ (∃𝑥 ∈ dom 𝐼(𝐼‘𝑥) = {𝑁, 𝐴} ∧ ∃𝑦 ∈ dom 𝐼(𝐼‘𝑦) = {𝐵, 𝑁})))
28	21, 27	bitrd 282	. . . 4 ⊢ (𝐺 ∈ UHGraph → (({𝑁, 𝐴} ∈ 𝐸 ∧ {𝐵, 𝑁} ∈ 𝐸) ↔ (∃𝑥 ∈ dom 𝐼(𝐼‘𝑥) = {𝑁, 𝐴} ∧ ∃𝑦 ∈ dom 𝐼(𝐼‘𝑦) = {𝐵, 𝑁})))
29	28	ad2antrr 738	. . 3 ⊢ (((𝐺 ∈ UHGraph ∧ 𝐴 ≠ 𝐵) ∧ ((𝑁 ∈ 𝑉 ∧ 𝐴 ∈ 𝑉) ∧ (𝐵 ∈ 𝑉 ∧ 𝑁 ∈ 𝑉))) → (({𝑁, 𝐴} ∈ 𝐸 ∧ {𝐵, 𝑁} ∈ 𝐸) ↔ (∃𝑥 ∈ dom 𝐼(𝐼‘𝑥) = {𝑁, 𝐴} ∧ ∃𝑦 ∈ dom 𝐼(𝐼‘𝑦) = {𝐵, 𝑁})))
30		reeanv 3237	. . . 4 ⊢ (∃𝑥 ∈ dom 𝐼∃𝑦 ∈ dom 𝐼((𝐼‘𝑥) = {𝑁, 𝐴} ∧ (𝐼‘𝑦) = {𝐵, 𝑁}) ↔ (∃𝑥 ∈ dom 𝐼(𝐼‘𝑥) = {𝑁, 𝐴} ∧ ∃𝑦 ∈ dom 𝐼(𝐼‘𝑦) = {𝐵, 𝑁}))
31		fveqeq2 6880	. . . . . . . . . . . 12 ⊢ (𝑥 = 𝑦 → ((𝐼‘𝑥) = {𝑁, 𝐴} ↔ (𝐼‘𝑦) = {𝑁, 𝐴}))
32	31	anbi1d 642	. . . . . . . . . . 11 ⊢ (𝑥 = 𝑦 → (((𝐼‘𝑥) = {𝑁, 𝐴} ∧ (𝐼‘𝑦) = {𝐵, 𝑁}) ↔ ((𝐼‘𝑦) = {𝑁, 𝐴} ∧ (𝐼‘𝑦) = {𝐵, 𝑁})))
33		eqtr2 2786	. . . . . . . . . . . 12 ⊢ (((𝐼‘𝑦) = {𝑁, 𝐴} ∧ (𝐼‘𝑦) = {𝐵, 𝑁}) → {𝑁, 𝐴} = {𝐵, 𝑁})
34		prcom 4694	. . . . . . . . . . . . . 14 ⊢ {𝐵, 𝑁} = {𝑁, 𝐵}
35	34	eqeq2i 2778	. . . . . . . . . . . . 13 ⊢ ({𝑁, 𝐴} = {𝐵, 𝑁} ↔ {𝑁, 𝐴} = {𝑁, 𝐵})
36		preq12bg 4813	. . . . . . . . . . . . . . . . 17 ⊢ (((𝑁 ∈ 𝑉 ∧ 𝐴 ∈ 𝑉) ∧ (𝑁 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉)) → ({𝑁, 𝐴} = {𝑁, 𝐵} ↔ ((𝑁 = 𝑁 ∧ 𝐴 = 𝐵) ∨ (𝑁 = 𝐵 ∧ 𝐴 = 𝑁))))
37	36	ancom2s 662	. . . . . . . . . . . . . . . 16 ⊢ (((𝑁 ∈ 𝑉 ∧ 𝐴 ∈ 𝑉) ∧ (𝐵 ∈ 𝑉 ∧ 𝑁 ∈ 𝑉)) → ({𝑁, 𝐴} = {𝑁, 𝐵} ↔ ((𝑁 = 𝑁 ∧ 𝐴 = 𝐵) ∨ (𝑁 = 𝐵 ∧ 𝐴 = 𝑁))))
38		eqneqall 2971	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝐴 = 𝐵 → (𝐴 ≠ 𝐵 → 𝑥 ≠ 𝑦))
39	38	adantl 486	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝑁 = 𝑁 ∧ 𝐴 = 𝐵) → (𝐴 ≠ 𝐵 → 𝑥 ≠ 𝑦))
40		eqtr 2785	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝐴 = 𝑁 ∧ 𝑁 = 𝐵) → 𝐴 = 𝐵)
41	40	ancoms 463	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝑁 = 𝐵 ∧ 𝐴 = 𝑁) → 𝐴 = 𝐵)
42	41, 38	syl 18	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝑁 = 𝐵 ∧ 𝐴 = 𝑁) → (𝐴 ≠ 𝐵 → 𝑥 ≠ 𝑦))
43	39, 42	jaoi 870	. . . . . . . . . . . . . . . . 17 ⊢ (((𝑁 = 𝑁 ∧ 𝐴 = 𝐵) ∨ (𝑁 = 𝐵 ∧ 𝐴 = 𝑁)) → (𝐴 ≠ 𝐵 → 𝑥 ≠ 𝑦))
44	43	adantld 495	. . . . . . . . . . . . . . . 16 ⊢ (((𝑁 = 𝑁 ∧ 𝐴 = 𝐵) ∨ (𝑁 = 𝐵 ∧ 𝐴 = 𝑁)) → ((𝐺 ∈ UHGraph ∧ 𝐴 ≠ 𝐵) → 𝑥 ≠ 𝑦))
45	37, 44	biimtrdi 256	. . . . . . . . . . . . . . 15 ⊢ (((𝑁 ∈ 𝑉 ∧ 𝐴 ∈ 𝑉) ∧ (𝐵 ∈ 𝑉 ∧ 𝑁 ∈ 𝑉)) → ({𝑁, 𝐴} = {𝑁, 𝐵} → ((𝐺 ∈ UHGraph ∧ 𝐴 ≠ 𝐵) → 𝑥 ≠ 𝑦)))
46	45	com3l 90	. . . . . . . . . . . . . 14 ⊢ ({𝑁, 𝐴} = {𝑁, 𝐵} → ((𝐺 ∈ UHGraph ∧ 𝐴 ≠ 𝐵) → (((𝑁 ∈ 𝑉 ∧ 𝐴 ∈ 𝑉) ∧ (𝐵 ∈ 𝑉 ∧ 𝑁 ∈ 𝑉)) → 𝑥 ≠ 𝑦)))
47	46	impd 415	. . . . . . . . . . . . 13 ⊢ ({𝑁, 𝐴} = {𝑁, 𝐵} → (((𝐺 ∈ UHGraph ∧ 𝐴 ≠ 𝐵) ∧ ((𝑁 ∈ 𝑉 ∧ 𝐴 ∈ 𝑉) ∧ (𝐵 ∈ 𝑉 ∧ 𝑁 ∈ 𝑉))) → 𝑥 ≠ 𝑦))
48	35, 47	sylbi 220	. . . . . . . . . . . 12 ⊢ ({𝑁, 𝐴} = {𝐵, 𝑁} → (((𝐺 ∈ UHGraph ∧ 𝐴 ≠ 𝐵) ∧ ((𝑁 ∈ 𝑉 ∧ 𝐴 ∈ 𝑉) ∧ (𝐵 ∈ 𝑉 ∧ 𝑁 ∈ 𝑉))) → 𝑥 ≠ 𝑦))
49	33, 48	syl 18	. . . . . . . . . . 11 ⊢ (((𝐼‘𝑦) = {𝑁, 𝐴} ∧ (𝐼‘𝑦) = {𝐵, 𝑁}) → (((𝐺 ∈ UHGraph ∧ 𝐴 ≠ 𝐵) ∧ ((𝑁 ∈ 𝑉 ∧ 𝐴 ∈ 𝑉) ∧ (𝐵 ∈ 𝑉 ∧ 𝑁 ∈ 𝑉))) → 𝑥 ≠ 𝑦))
50	32, 49	biimtrdi 256	. . . . . . . . . 10 ⊢ (𝑥 = 𝑦 → (((𝐼‘𝑥) = {𝑁, 𝐴} ∧ (𝐼‘𝑦) = {𝐵, 𝑁}) → (((𝐺 ∈ UHGraph ∧ 𝐴 ≠ 𝐵) ∧ ((𝑁 ∈ 𝑉 ∧ 𝐴 ∈ 𝑉) ∧ (𝐵 ∈ 𝑉 ∧ 𝑁 ∈ 𝑉))) → 𝑥 ≠ 𝑦)))
51	50	impcomd 416	. . . . . . . . 9 ⊢ (𝑥 = 𝑦 → ((((𝐺 ∈ UHGraph ∧ 𝐴 ≠ 𝐵) ∧ ((𝑁 ∈ 𝑉 ∧ 𝐴 ∈ 𝑉) ∧ (𝐵 ∈ 𝑉 ∧ 𝑁 ∈ 𝑉))) ∧ ((𝐼‘𝑥) = {𝑁, 𝐴} ∧ (𝐼‘𝑦) = {𝐵, 𝑁})) → 𝑥 ≠ 𝑦))
52		ax-1 6	. . . . . . . . 9 ⊢ (𝑥 ≠ 𝑦 → ((((𝐺 ∈ UHGraph ∧ 𝐴 ≠ 𝐵) ∧ ((𝑁 ∈ 𝑉 ∧ 𝐴 ∈ 𝑉) ∧ (𝐵 ∈ 𝑉 ∧ 𝑁 ∈ 𝑉))) ∧ ((𝐼‘𝑥) = {𝑁, 𝐴} ∧ (𝐼‘𝑦) = {𝐵, 𝑁})) → 𝑥 ≠ 𝑦))
53	51, 52	pm2.61ine 3043	. . . . . . . 8 ⊢ ((((𝐺 ∈ UHGraph ∧ 𝐴 ≠ 𝐵) ∧ ((𝑁 ∈ 𝑉 ∧ 𝐴 ∈ 𝑉) ∧ (𝐵 ∈ 𝑉 ∧ 𝑁 ∈ 𝑉))) ∧ ((𝐼‘𝑥) = {𝑁, 𝐴} ∧ (𝐼‘𝑦) = {𝐵, 𝑁})) → 𝑥 ≠ 𝑦)
54		prid1g 4722	. . . . . . . . . . . . 13 ⊢ (𝑁 ∈ 𝑉 → 𝑁 ∈ {𝑁, 𝐴})
55	54	ad2antrr 738	. . . . . . . . . . . 12 ⊢ (((𝑁 ∈ 𝑉 ∧ 𝐴 ∈ 𝑉) ∧ (𝐵 ∈ 𝑉 ∧ 𝑁 ∈ 𝑉)) → 𝑁 ∈ {𝑁, 𝐴})
56	55	adantl 486	. . . . . . . . . . 11 ⊢ (((𝐺 ∈ UHGraph ∧ 𝐴 ≠ 𝐵) ∧ ((𝑁 ∈ 𝑉 ∧ 𝐴 ∈ 𝑉) ∧ (𝐵 ∈ 𝑉 ∧ 𝑁 ∈ 𝑉))) → 𝑁 ∈ {𝑁, 𝐴})
57		eleq2 2854	. . . . . . . . . . 11 ⊢ ((𝐼‘𝑥) = {𝑁, 𝐴} → (𝑁 ∈ (𝐼‘𝑥) ↔ 𝑁 ∈ {𝑁, 𝐴}))
58	56, 57	imbitrrid 249	. . . . . . . . . 10 ⊢ ((𝐼‘𝑥) = {𝑁, 𝐴} → (((𝐺 ∈ UHGraph ∧ 𝐴 ≠ 𝐵) ∧ ((𝑁 ∈ 𝑉 ∧ 𝐴 ∈ 𝑉) ∧ (𝐵 ∈ 𝑉 ∧ 𝑁 ∈ 𝑉))) → 𝑁 ∈ (𝐼‘𝑥)))
59	58	adantr 485	. . . . . . . . 9 ⊢ (((𝐼‘𝑥) = {𝑁, 𝐴} ∧ (𝐼‘𝑦) = {𝐵, 𝑁}) → (((𝐺 ∈ UHGraph ∧ 𝐴 ≠ 𝐵) ∧ ((𝑁 ∈ 𝑉 ∧ 𝐴 ∈ 𝑉) ∧ (𝐵 ∈ 𝑉 ∧ 𝑁 ∈ 𝑉))) → 𝑁 ∈ (𝐼‘𝑥)))
60	59	impcom 412	. . . . . . . 8 ⊢ ((((𝐺 ∈ UHGraph ∧ 𝐴 ≠ 𝐵) ∧ ((𝑁 ∈ 𝑉 ∧ 𝐴 ∈ 𝑉) ∧ (𝐵 ∈ 𝑉 ∧ 𝑁 ∈ 𝑉))) ∧ ((𝐼‘𝑥) = {𝑁, 𝐴} ∧ (𝐼‘𝑦) = {𝐵, 𝑁})) → 𝑁 ∈ (𝐼‘𝑥))
61		prid2g 4723	. . . . . . . . . . . . 13 ⊢ (𝑁 ∈ 𝑉 → 𝑁 ∈ {𝐵, 𝑁})
62	61	ad2antrr 738	. . . . . . . . . . . 12 ⊢ (((𝑁 ∈ 𝑉 ∧ 𝐴 ∈ 𝑉) ∧ (𝐵 ∈ 𝑉 ∧ 𝑁 ∈ 𝑉)) → 𝑁 ∈ {𝐵, 𝑁})
63	62	adantl 486	. . . . . . . . . . 11 ⊢ (((𝐺 ∈ UHGraph ∧ 𝐴 ≠ 𝐵) ∧ ((𝑁 ∈ 𝑉 ∧ 𝐴 ∈ 𝑉) ∧ (𝐵 ∈ 𝑉 ∧ 𝑁 ∈ 𝑉))) → 𝑁 ∈ {𝐵, 𝑁})
64		eleq2 2854	. . . . . . . . . . 11 ⊢ ((𝐼‘𝑦) = {𝐵, 𝑁} → (𝑁 ∈ (𝐼‘𝑦) ↔ 𝑁 ∈ {𝐵, 𝑁}))
65	63, 64	imbitrrid 249	. . . . . . . . . 10 ⊢ ((𝐼‘𝑦) = {𝐵, 𝑁} → (((𝐺 ∈ UHGraph ∧ 𝐴 ≠ 𝐵) ∧ ((𝑁 ∈ 𝑉 ∧ 𝐴 ∈ 𝑉) ∧ (𝐵 ∈ 𝑉 ∧ 𝑁 ∈ 𝑉))) → 𝑁 ∈ (𝐼‘𝑦)))
66	65	adantl 486	. . . . . . . . 9 ⊢ (((𝐼‘𝑥) = {𝑁, 𝐴} ∧ (𝐼‘𝑦) = {𝐵, 𝑁}) → (((𝐺 ∈ UHGraph ∧ 𝐴 ≠ 𝐵) ∧ ((𝑁 ∈ 𝑉 ∧ 𝐴 ∈ 𝑉) ∧ (𝐵 ∈ 𝑉 ∧ 𝑁 ∈ 𝑉))) → 𝑁 ∈ (𝐼‘𝑦)))
67	66	impcom 412	. . . . . . . 8 ⊢ ((((𝐺 ∈ UHGraph ∧ 𝐴 ≠ 𝐵) ∧ ((𝑁 ∈ 𝑉 ∧ 𝐴 ∈ 𝑉) ∧ (𝐵 ∈ 𝑉 ∧ 𝑁 ∈ 𝑉))) ∧ ((𝐼‘𝑥) = {𝑁, 𝐴} ∧ (𝐼‘𝑦) = {𝐵, 𝑁})) → 𝑁 ∈ (𝐼‘𝑦))
68	53, 60, 67	3jca 1144	. . . . . . 7 ⊢ ((((𝐺 ∈ UHGraph ∧ 𝐴 ≠ 𝐵) ∧ ((𝑁 ∈ 𝑉 ∧ 𝐴 ∈ 𝑉) ∧ (𝐵 ∈ 𝑉 ∧ 𝑁 ∈ 𝑉))) ∧ ((𝐼‘𝑥) = {𝑁, 𝐴} ∧ (𝐼‘𝑦) = {𝐵, 𝑁})) → (𝑥 ≠ 𝑦 ∧ 𝑁 ∈ (𝐼‘𝑥) ∧ 𝑁 ∈ (𝐼‘𝑦)))
69	68	ex 417	. . . . . 6 ⊢ (((𝐺 ∈ UHGraph ∧ 𝐴 ≠ 𝐵) ∧ ((𝑁 ∈ 𝑉 ∧ 𝐴 ∈ 𝑉) ∧ (𝐵 ∈ 𝑉 ∧ 𝑁 ∈ 𝑉))) → (((𝐼‘𝑥) = {𝑁, 𝐴} ∧ (𝐼‘𝑦) = {𝐵, 𝑁}) → (𝑥 ≠ 𝑦 ∧ 𝑁 ∈ (𝐼‘𝑥) ∧ 𝑁 ∈ (𝐼‘𝑦))))
70	69	reximdv 3180	. . . . 5 ⊢ (((𝐺 ∈ UHGraph ∧ 𝐴 ≠ 𝐵) ∧ ((𝑁 ∈ 𝑉 ∧ 𝐴 ∈ 𝑉) ∧ (𝐵 ∈ 𝑉 ∧ 𝑁 ∈ 𝑉))) → (∃𝑦 ∈ dom 𝐼((𝐼‘𝑥) = {𝑁, 𝐴} ∧ (𝐼‘𝑦) = {𝐵, 𝑁}) → ∃𝑦 ∈ dom 𝐼(𝑥 ≠ 𝑦 ∧ 𝑁 ∈ (𝐼‘𝑥) ∧ 𝑁 ∈ (𝐼‘𝑦))))
71	70	reximdv 3180	. . . 4 ⊢ (((𝐺 ∈ UHGraph ∧ 𝐴 ≠ 𝐵) ∧ ((𝑁 ∈ 𝑉 ∧ 𝐴 ∈ 𝑉) ∧ (𝐵 ∈ 𝑉 ∧ 𝑁 ∈ 𝑉))) → (∃𝑥 ∈ dom 𝐼∃𝑦 ∈ dom 𝐼((𝐼‘𝑥) = {𝑁, 𝐴} ∧ (𝐼‘𝑦) = {𝐵, 𝑁}) → ∃𝑥 ∈ dom 𝐼∃𝑦 ∈ dom 𝐼(𝑥 ≠ 𝑦 ∧ 𝑁 ∈ (𝐼‘𝑥) ∧ 𝑁 ∈ (𝐼‘𝑦))))
72	30, 71	biimtrrid 246	. . 3 ⊢ (((𝐺 ∈ UHGraph ∧ 𝐴 ≠ 𝐵) ∧ ((𝑁 ∈ 𝑉 ∧ 𝐴 ∈ 𝑉) ∧ (𝐵 ∈ 𝑉 ∧ 𝑁 ∈ 𝑉))) → ((∃𝑥 ∈ dom 𝐼(𝐼‘𝑥) = {𝑁, 𝐴} ∧ ∃𝑦 ∈ dom 𝐼(𝐼‘𝑦) = {𝐵, 𝑁}) → ∃𝑥 ∈ dom 𝐼∃𝑦 ∈ dom 𝐼(𝑥 ≠ 𝑦 ∧ 𝑁 ∈ (𝐼‘𝑥) ∧ 𝑁 ∈ (𝐼‘𝑦))))
73	29, 72	sylbid 243	. 2 ⊢ (((𝐺 ∈ UHGraph ∧ 𝐴 ≠ 𝐵) ∧ ((𝑁 ∈ 𝑉 ∧ 𝐴 ∈ 𝑉) ∧ (𝐵 ∈ 𝑉 ∧ 𝑁 ∈ 𝑉))) → (({𝑁, 𝐴} ∈ 𝐸 ∧ {𝐵, 𝑁} ∈ 𝐸) → ∃𝑥 ∈ dom 𝐼∃𝑦 ∈ dom 𝐼(𝑥 ≠ 𝑦 ∧ 𝑁 ∈ (𝐼‘𝑥) ∧ 𝑁 ∈ (𝐼‘𝑦))))
74	8, 9, 73	sylc 66	1 ⊢ (((𝐺 ∈ UHGraph ∧ 𝐴 ≠ 𝐵) ∧ (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝑁 ∈ 𝑉) ∧ ({𝑁, 𝐴} ∈ 𝐸 ∧ {𝐵, 𝑁} ∈ 𝐸)) → ∃𝑥 ∈ dom 𝐼∃𝑦 ∈ dom 𝐼(𝑥 ≠ 𝑦 ∧ 𝑁 ∈ (𝐼‘𝑥) ∧ 𝑁 ∈ (𝐼‘𝑦)))

Syntax hints:   → wi 4   ↔ wb 209   ∧ wa 400   ∨ wo 860   ∧ w3a 1101   = wceq 1563   ∈ wcel 2145   ≠ wne 2960  ∃wrex 3089  {cpr 4587  dom cdm 5651  ran crn 5652   Fn wfn 6520  ‘cfv 6525  Vtxcvtx 29251  iEdgciedg 29252  Edgcedg 29302  UHGraphcuhgr 29311

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1818  ax-4 1832  ax-5 1933  ax-6 1990  ax-7 2031  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2215  ax-ext 2737  ax-sep 5250  ax-nul 5260  ax-pr 5394  ax-un 7722

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1103  df-tru 1566  df-fal 1576  df-ex 1803  df-nf 1807  df-sb 2094  df-mo 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ne 2961  df-ral 3080  df-rex 3090  df-rab 3418  df-v 3459  df-sbc 3748  df-dif 3910  df-un 3912  df-in 3914  df-ss 3924  df-nul 4289  df-if 4484  df-pw 4560  df-sn 4586  df-pr 4588  df-op 4592  df-uni 4868  df-br 5105  df-opab 5167  df-mpt 5186  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-iota 6481  df-fun 6527  df-fn 6528  df-f 6529  df-fv 6533  df-edg 29303  df-uhgr 29313

This theorem is referenced by:  umgr2edg  29464