Theorem cusgrexi 40662

Description: An arbitrary set regarded as vertices together with the set of pairs of elements of this set regarded as edges is a complete simple graph. (Contributed by Alexander van der Vekens, 12-Jan-2018.) (Revised by AV, 5-Nov-2020.)

Hypothesis

Ref	Expression
usgrexi.p	⊢ 𝑃 = {𝑥 ∈ 𝒫 𝑉 ∣ (#‘𝑥) = 2}

Assertion

Ref	Expression
cusgrexi	⊢ (𝑉 ∈ 𝑊 → ⟨𝑉, ( I ↾ 𝑃)⟩ ∈ ComplUSGraph)

Distinct variable groups:   𝑥,𝑃   𝑥,𝑉   𝑥,𝑊

Proof of Theorem cusgrexi

Dummy variables 𝑒 𝑛 𝑣 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		usgrexi.p	. . 3 ⊢ 𝑃 = {𝑥 ∈ 𝒫 𝑉 ∣ (#‘𝑥) = 2}
2	1	usgrexi 40661	. 2 ⊢ (𝑉 ∈ 𝑊 → ⟨𝑉, ( I ↾ 𝑃)⟩ ∈ USGraph )
3	1	cusgraexilem1 25995	. . . . . . . . . 10 ⊢ (𝑉 ∈ 𝑊 → ( I ↾ 𝑃) ∈ V)
4		opvtxfv 25681	. . . . . . . . . . 11 ⊢ ((𝑉 ∈ 𝑊 ∧ ( I ↾ 𝑃) ∈ V) → (Vtx‘⟨𝑉, ( I ↾ 𝑃)⟩) = 𝑉)
5	4	eqcomd 2616	. . . . . . . . . 10 ⊢ ((𝑉 ∈ 𝑊 ∧ ( I ↾ 𝑃) ∈ V) → 𝑉 = (Vtx‘⟨𝑉, ( I ↾ 𝑃)⟩))
6	3, 5	mpdan 699	. . . . . . . . 9 ⊢ (𝑉 ∈ 𝑊 → 𝑉 = (Vtx‘⟨𝑉, ( I ↾ 𝑃)⟩))
7	6	eleq2d 2673	. . . . . . . 8 ⊢ (𝑉 ∈ 𝑊 → (𝑣 ∈ 𝑉 ↔ 𝑣 ∈ (Vtx‘⟨𝑉, ( I ↾ 𝑃)⟩)))
8	7	biimpa 500	. . . . . . 7 ⊢ ((𝑉 ∈ 𝑊 ∧ 𝑣 ∈ 𝑉) → 𝑣 ∈ (Vtx‘⟨𝑉, ( I ↾ 𝑃)⟩))
9		eldifi 3694	. . . . . . . . . . . . 13 ⊢ (𝑛 ∈ (𝑉 ∖ {𝑣}) → 𝑛 ∈ 𝑉)
10	9	adantl 481	. . . . . . . . . . . 12 ⊢ (((𝑉 ∈ 𝑊 ∧ 𝑣 ∈ 𝑉) ∧ 𝑛 ∈ (𝑉 ∖ {𝑣})) → 𝑛 ∈ 𝑉)
11	3, 4	mpdan 699	. . . . . . . . . . . . . 14 ⊢ (𝑉 ∈ 𝑊 → (Vtx‘⟨𝑉, ( I ↾ 𝑃)⟩) = 𝑉)
12	11	eleq2d 2673	. . . . . . . . . . . . 13 ⊢ (𝑉 ∈ 𝑊 → (𝑛 ∈ (Vtx‘⟨𝑉, ( I ↾ 𝑃)⟩) ↔ 𝑛 ∈ 𝑉))
13	12	ad2antrr 758	. . . . . . . . . . . 12 ⊢ (((𝑉 ∈ 𝑊 ∧ 𝑣 ∈ 𝑉) ∧ 𝑛 ∈ (𝑉 ∖ {𝑣})) → (𝑛 ∈ (Vtx‘⟨𝑉, ( I ↾ 𝑃)⟩) ↔ 𝑛 ∈ 𝑉))
14	10, 13	mpbird 246	. . . . . . . . . . 11 ⊢ (((𝑉 ∈ 𝑊 ∧ 𝑣 ∈ 𝑉) ∧ 𝑛 ∈ (𝑉 ∖ {𝑣})) → 𝑛 ∈ (Vtx‘⟨𝑉, ( I ↾ 𝑃)⟩))
15		simpr 476	. . . . . . . . . . . . 13 ⊢ ((𝑉 ∈ 𝑊 ∧ 𝑣 ∈ 𝑉) → 𝑣 ∈ 𝑉)
16	15	adantr 480	. . . . . . . . . . . 12 ⊢ (((𝑉 ∈ 𝑊 ∧ 𝑣 ∈ 𝑉) ∧ 𝑛 ∈ (𝑉 ∖ {𝑣})) → 𝑣 ∈ 𝑉)
17	11	eleq2d 2673	. . . . . . . . . . . . 13 ⊢ (𝑉 ∈ 𝑊 → (𝑣 ∈ (Vtx‘⟨𝑉, ( I ↾ 𝑃)⟩) ↔ 𝑣 ∈ 𝑉))
18	17	ad2antrr 758	. . . . . . . . . . . 12 ⊢ (((𝑉 ∈ 𝑊 ∧ 𝑣 ∈ 𝑉) ∧ 𝑛 ∈ (𝑉 ∖ {𝑣})) → (𝑣 ∈ (Vtx‘⟨𝑉, ( I ↾ 𝑃)⟩) ↔ 𝑣 ∈ 𝑉))
19	16, 18	mpbird 246	. . . . . . . . . . 11 ⊢ (((𝑉 ∈ 𝑊 ∧ 𝑣 ∈ 𝑉) ∧ 𝑛 ∈ (𝑉 ∖ {𝑣})) → 𝑣 ∈ (Vtx‘⟨𝑉, ( I ↾ 𝑃)⟩))
20	14, 19	jca 553	. . . . . . . . . 10 ⊢ (((𝑉 ∈ 𝑊 ∧ 𝑣 ∈ 𝑉) ∧ 𝑛 ∈ (𝑉 ∖ {𝑣})) → (𝑛 ∈ (Vtx‘⟨𝑉, ( I ↾ 𝑃)⟩) ∧ 𝑣 ∈ (Vtx‘⟨𝑉, ( I ↾ 𝑃)⟩)))
21		eldifsn 4260	. . . . . . . . . . . 12 ⊢ (𝑛 ∈ (𝑉 ∖ {𝑣}) ↔ (𝑛 ∈ 𝑉 ∧ 𝑛 ≠ 𝑣))
22		simpr 476	. . . . . . . . . . . 12 ⊢ ((𝑛 ∈ 𝑉 ∧ 𝑛 ≠ 𝑣) → 𝑛 ≠ 𝑣)
23	21, 22	sylbi 206	. . . . . . . . . . 11 ⊢ (𝑛 ∈ (𝑉 ∖ {𝑣}) → 𝑛 ≠ 𝑣)
24	23	adantl 481	. . . . . . . . . 10 ⊢ (((𝑉 ∈ 𝑊 ∧ 𝑣 ∈ 𝑉) ∧ 𝑛 ∈ (𝑉 ∖ {𝑣})) → 𝑛 ≠ 𝑣)
25		prelpwi 4842	. . . . . . . . . . . . . 14 ⊢ ((𝑣 ∈ 𝑉 ∧ 𝑛 ∈ 𝑉) → {𝑣, 𝑛} ∈ 𝒫 𝑉)
26	15, 9, 25	syl2an 493	. . . . . . . . . . . . 13 ⊢ (((𝑉 ∈ 𝑊 ∧ 𝑣 ∈ 𝑉) ∧ 𝑛 ∈ (𝑉 ∖ {𝑣})) → {𝑣, 𝑛} ∈ 𝒫 𝑉)
27	22	necomd 2837	. . . . . . . . . . . . . . . 16 ⊢ ((𝑛 ∈ 𝑉 ∧ 𝑛 ≠ 𝑣) → 𝑣 ≠ 𝑛)
28	21, 27	sylbi 206	. . . . . . . . . . . . . . 15 ⊢ (𝑛 ∈ (𝑉 ∖ {𝑣}) → 𝑣 ≠ 𝑛)
29	28	adantl 481	. . . . . . . . . . . . . 14 ⊢ (((𝑉 ∈ 𝑊 ∧ 𝑣 ∈ 𝑉) ∧ 𝑛 ∈ (𝑉 ∖ {𝑣})) → 𝑣 ≠ 𝑛)
30		hashprg 13043	. . . . . . . . . . . . . . 15 ⊢ ((𝑣 ∈ 𝑉 ∧ 𝑛 ∈ 𝑉) → (𝑣 ≠ 𝑛 ↔ (#‘{𝑣, 𝑛}) = 2))
31	15, 9, 30	syl2an 493	. . . . . . . . . . . . . 14 ⊢ (((𝑉 ∈ 𝑊 ∧ 𝑣 ∈ 𝑉) ∧ 𝑛 ∈ (𝑉 ∖ {𝑣})) → (𝑣 ≠ 𝑛 ↔ (#‘{𝑣, 𝑛}) = 2))
32	29, 31	mpbid 221	. . . . . . . . . . . . 13 ⊢ (((𝑉 ∈ 𝑊 ∧ 𝑣 ∈ 𝑉) ∧ 𝑛 ∈ (𝑉 ∖ {𝑣})) → (#‘{𝑣, 𝑛}) = 2)
33		fveq2 6103	. . . . . . . . . . . . . . 15 ⊢ (𝑥 = {𝑣, 𝑛} → (#‘𝑥) = (#‘{𝑣, 𝑛}))
34	33	eqeq1d 2612	. . . . . . . . . . . . . 14 ⊢ (𝑥 = {𝑣, 𝑛} → ((#‘𝑥) = 2 ↔ (#‘{𝑣, 𝑛}) = 2))
35		rnresi 5398	. . . . . . . . . . . . . . 15 ⊢ ran ( I ↾ 𝑃) = 𝑃
36	35, 1	eqtri 2632	. . . . . . . . . . . . . 14 ⊢ ran ( I ↾ 𝑃) = {𝑥 ∈ 𝒫 𝑉 ∣ (#‘𝑥) = 2}
37	34, 36	elrab2 3333	. . . . . . . . . . . . 13 ⊢ ({𝑣, 𝑛} ∈ ran ( I ↾ 𝑃) ↔ ({𝑣, 𝑛} ∈ 𝒫 𝑉 ∧ (#‘{𝑣, 𝑛}) = 2))
38	26, 32, 37	sylanbrc 695	. . . . . . . . . . . 12 ⊢ (((𝑉 ∈ 𝑊 ∧ 𝑣 ∈ 𝑉) ∧ 𝑛 ∈ (𝑉 ∖ {𝑣})) → {𝑣, 𝑛} ∈ ran ( I ↾ 𝑃))
39		sseq2 3590	. . . . . . . . . . . . 13 ⊢ (𝑒 = {𝑣, 𝑛} → ({𝑣, 𝑛} ⊆ 𝑒 ↔ {𝑣, 𝑛} ⊆ {𝑣, 𝑛}))
40	39	adantl 481	. . . . . . . . . . . 12 ⊢ ((((𝑉 ∈ 𝑊 ∧ 𝑣 ∈ 𝑉) ∧ 𝑛 ∈ (𝑉 ∖ {𝑣})) ∧ 𝑒 = {𝑣, 𝑛}) → ({𝑣, 𝑛} ⊆ 𝑒 ↔ {𝑣, 𝑛} ⊆ {𝑣, 𝑛}))
41		ssid 3587	. . . . . . . . . . . . 13 ⊢ {𝑣, 𝑛} ⊆ {𝑣, 𝑛}
42	41	a1i 11	. . . . . . . . . . . 12 ⊢ (((𝑉 ∈ 𝑊 ∧ 𝑣 ∈ 𝑉) ∧ 𝑛 ∈ (𝑉 ∖ {𝑣})) → {𝑣, 𝑛} ⊆ {𝑣, 𝑛})
43	38, 40, 42	rspcedvd 3289	. . . . . . . . . . 11 ⊢ (((𝑉 ∈ 𝑊 ∧ 𝑣 ∈ 𝑉) ∧ 𝑛 ∈ (𝑉 ∖ {𝑣})) → ∃𝑒 ∈ ran ( I ↾ 𝑃){𝑣, 𝑛} ⊆ 𝑒)
44		opex 4859	. . . . . . . . . . . . . . 15 ⊢ ⟨𝑉, ( I ↾ 𝑃)⟩ ∈ V
45		edgaval 25794	. . . . . . . . . . . . . . 15 ⊢ (⟨𝑉, ( I ↾ 𝑃)⟩ ∈ V → (Edg‘⟨𝑉, ( I ↾ 𝑃)⟩) = ran (iEdg‘⟨𝑉, ( I ↾ 𝑃)⟩))
46	44, 45	mp1i 13	. . . . . . . . . . . . . 14 ⊢ (𝑉 ∈ 𝑊 → (Edg‘⟨𝑉, ( I ↾ 𝑃)⟩) = ran (iEdg‘⟨𝑉, ( I ↾ 𝑃)⟩))
47		opiedgfv 25684	. . . . . . . . . . . . . . . 16 ⊢ ((𝑉 ∈ 𝑊 ∧ ( I ↾ 𝑃) ∈ V) → (iEdg‘⟨𝑉, ( I ↾ 𝑃)⟩) = ( I ↾ 𝑃))
48	3, 47	mpdan 699	. . . . . . . . . . . . . . 15 ⊢ (𝑉 ∈ 𝑊 → (iEdg‘⟨𝑉, ( I ↾ 𝑃)⟩) = ( I ↾ 𝑃))
49	48	rneqd 5274	. . . . . . . . . . . . . 14 ⊢ (𝑉 ∈ 𝑊 → ran (iEdg‘⟨𝑉, ( I ↾ 𝑃)⟩) = ran ( I ↾ 𝑃))
50	46, 49	eqtrd 2644	. . . . . . . . . . . . 13 ⊢ (𝑉 ∈ 𝑊 → (Edg‘⟨𝑉, ( I ↾ 𝑃)⟩) = ran ( I ↾ 𝑃))
51	50	rexeqdv 3122	. . . . . . . . . . . 12 ⊢ (𝑉 ∈ 𝑊 → (∃𝑒 ∈ (Edg‘⟨𝑉, ( I ↾ 𝑃)⟩){𝑣, 𝑛} ⊆ 𝑒 ↔ ∃𝑒 ∈ ran ( I ↾ 𝑃){𝑣, 𝑛} ⊆ 𝑒))
52	51	ad2antrr 758	. . . . . . . . . . 11 ⊢ (((𝑉 ∈ 𝑊 ∧ 𝑣 ∈ 𝑉) ∧ 𝑛 ∈ (𝑉 ∖ {𝑣})) → (∃𝑒 ∈ (Edg‘⟨𝑉, ( I ↾ 𝑃)⟩){𝑣, 𝑛} ⊆ 𝑒 ↔ ∃𝑒 ∈ ran ( I ↾ 𝑃){𝑣, 𝑛} ⊆ 𝑒))
53	43, 52	mpbird 246	. . . . . . . . . 10 ⊢ (((𝑉 ∈ 𝑊 ∧ 𝑣 ∈ 𝑉) ∧ 𝑛 ∈ (𝑉 ∖ {𝑣})) → ∃𝑒 ∈ (Edg‘⟨𝑉, ( I ↾ 𝑃)⟩){𝑣, 𝑛} ⊆ 𝑒)
54		eqid 2610	. . . . . . . . . . . 12 ⊢ (Vtx‘⟨𝑉, ( I ↾ 𝑃)⟩) = (Vtx‘⟨𝑉, ( I ↾ 𝑃)⟩)
55		eqid 2610	. . . . . . . . . . . 12 ⊢ (Edg‘⟨𝑉, ( I ↾ 𝑃)⟩) = (Edg‘⟨𝑉, ( I ↾ 𝑃)⟩)
56	54, 55	nbgrel 40564	. . . . . . . . . . 11 ⊢ (⟨𝑉, ( I ↾ 𝑃)⟩ ∈ V → (𝑛 ∈ (⟨𝑉, ( I ↾ 𝑃)⟩ NeighbVtx 𝑣) ↔ ((𝑛 ∈ (Vtx‘⟨𝑉, ( I ↾ 𝑃)⟩) ∧ 𝑣 ∈ (Vtx‘⟨𝑉, ( I ↾ 𝑃)⟩)) ∧ 𝑛 ≠ 𝑣 ∧ ∃𝑒 ∈ (Edg‘⟨𝑉, ( I ↾ 𝑃)⟩){𝑣, 𝑛} ⊆ 𝑒)))
57	44, 56	mp1i 13	. . . . . . . . . 10 ⊢ (((𝑉 ∈ 𝑊 ∧ 𝑣 ∈ 𝑉) ∧ 𝑛 ∈ (𝑉 ∖ {𝑣})) → (𝑛 ∈ (⟨𝑉, ( I ↾ 𝑃)⟩ NeighbVtx 𝑣) ↔ ((𝑛 ∈ (Vtx‘⟨𝑉, ( I ↾ 𝑃)⟩) ∧ 𝑣 ∈ (Vtx‘⟨𝑉, ( I ↾ 𝑃)⟩)) ∧ 𝑛 ≠ 𝑣 ∧ ∃𝑒 ∈ (Edg‘⟨𝑉, ( I ↾ 𝑃)⟩){𝑣, 𝑛} ⊆ 𝑒)))
58	20, 24, 53, 57	mpbir3and 1238	. . . . . . . . 9 ⊢ (((𝑉 ∈ 𝑊 ∧ 𝑣 ∈ 𝑉) ∧ 𝑛 ∈ (𝑉 ∖ {𝑣})) → 𝑛 ∈ (⟨𝑉, ( I ↾ 𝑃)⟩ NeighbVtx 𝑣))
59	58	ralrimiva 2949	. . . . . . . 8 ⊢ ((𝑉 ∈ 𝑊 ∧ 𝑣 ∈ 𝑉) → ∀𝑛 ∈ (𝑉 ∖ {𝑣})𝑛 ∈ (⟨𝑉, ( I ↾ 𝑃)⟩ NeighbVtx 𝑣))
60	11	adantr 480	. . . . . . . . . 10 ⊢ ((𝑉 ∈ 𝑊 ∧ 𝑣 ∈ 𝑉) → (Vtx‘⟨𝑉, ( I ↾ 𝑃)⟩) = 𝑉)
61	60	difeq1d 3689	. . . . . . . . 9 ⊢ ((𝑉 ∈ 𝑊 ∧ 𝑣 ∈ 𝑉) → ((Vtx‘⟨𝑉, ( I ↾ 𝑃)⟩) ∖ {𝑣}) = (𝑉 ∖ {𝑣}))
62	61	raleqdv 3121	. . . . . . . 8 ⊢ ((𝑉 ∈ 𝑊 ∧ 𝑣 ∈ 𝑉) → (∀𝑛 ∈ ((Vtx‘⟨𝑉, ( I ↾ 𝑃)⟩) ∖ {𝑣})𝑛 ∈ (⟨𝑉, ( I ↾ 𝑃)⟩ NeighbVtx 𝑣) ↔ ∀𝑛 ∈ (𝑉 ∖ {𝑣})𝑛 ∈ (⟨𝑉, ( I ↾ 𝑃)⟩ NeighbVtx 𝑣)))
63	59, 62	mpbird 246	. . . . . . 7 ⊢ ((𝑉 ∈ 𝑊 ∧ 𝑣 ∈ 𝑉) → ∀𝑛 ∈ ((Vtx‘⟨𝑉, ( I ↾ 𝑃)⟩) ∖ {𝑣})𝑛 ∈ (⟨𝑉, ( I ↾ 𝑃)⟩ NeighbVtx 𝑣))
64	8, 63	jca 553	. . . . . 6 ⊢ ((𝑉 ∈ 𝑊 ∧ 𝑣 ∈ 𝑉) → (𝑣 ∈ (Vtx‘⟨𝑉, ( I ↾ 𝑃)⟩) ∧ ∀𝑛 ∈ ((Vtx‘⟨𝑉, ( I ↾ 𝑃)⟩) ∖ {𝑣})𝑛 ∈ (⟨𝑉, ( I ↾ 𝑃)⟩ NeighbVtx 𝑣)))
65	54	uvtxael 40614	. . . . . . 7 ⊢ (⟨𝑉, ( I ↾ 𝑃)⟩ ∈ V → (𝑣 ∈ (UnivVtx‘⟨𝑉, ( I ↾ 𝑃)⟩) ↔ (𝑣 ∈ (Vtx‘⟨𝑉, ( I ↾ 𝑃)⟩) ∧ ∀𝑛 ∈ ((Vtx‘⟨𝑉, ( I ↾ 𝑃)⟩) ∖ {𝑣})𝑛 ∈ (⟨𝑉, ( I ↾ 𝑃)⟩ NeighbVtx 𝑣))))
66	44, 65	mp1i 13	. . . . . 6 ⊢ ((𝑉 ∈ 𝑊 ∧ 𝑣 ∈ 𝑉) → (𝑣 ∈ (UnivVtx‘⟨𝑉, ( I ↾ 𝑃)⟩) ↔ (𝑣 ∈ (Vtx‘⟨𝑉, ( I ↾ 𝑃)⟩) ∧ ∀𝑛 ∈ ((Vtx‘⟨𝑉, ( I ↾ 𝑃)⟩) ∖ {𝑣})𝑛 ∈ (⟨𝑉, ( I ↾ 𝑃)⟩ NeighbVtx 𝑣))))
67	64, 66	mpbird 246	. . . . 5 ⊢ ((𝑉 ∈ 𝑊 ∧ 𝑣 ∈ 𝑉) → 𝑣 ∈ (UnivVtx‘⟨𝑉, ( I ↾ 𝑃)⟩))
68	67	ralrimiva 2949	. . . 4 ⊢ (𝑉 ∈ 𝑊 → ∀𝑣 ∈ 𝑉 𝑣 ∈ (UnivVtx‘⟨𝑉, ( I ↾ 𝑃)⟩))
69	11	raleqdv 3121	. . . 4 ⊢ (𝑉 ∈ 𝑊 → (∀𝑣 ∈ (Vtx‘⟨𝑉, ( I ↾ 𝑃)⟩)𝑣 ∈ (UnivVtx‘⟨𝑉, ( I ↾ 𝑃)⟩) ↔ ∀𝑣 ∈ 𝑉 𝑣 ∈ (UnivVtx‘⟨𝑉, ( I ↾ 𝑃)⟩)))
70	68, 69	mpbird 246	. . 3 ⊢ (𝑉 ∈ 𝑊 → ∀𝑣 ∈ (Vtx‘⟨𝑉, ( I ↾ 𝑃)⟩)𝑣 ∈ (UnivVtx‘⟨𝑉, ( I ↾ 𝑃)⟩))
71	54	iscplgr 40636	. . . 4 ⊢ (⟨𝑉, ( I ↾ 𝑃)⟩ ∈ V → (⟨𝑉, ( I ↾ 𝑃)⟩ ∈ ComplGraph ↔ ∀𝑣 ∈ (Vtx‘⟨𝑉, ( I ↾ 𝑃)⟩)𝑣 ∈ (UnivVtx‘⟨𝑉, ( I ↾ 𝑃)⟩)))
72	44, 71	mp1i 13	. . 3 ⊢ (𝑉 ∈ 𝑊 → (⟨𝑉, ( I ↾ 𝑃)⟩ ∈ ComplGraph ↔ ∀𝑣 ∈ (Vtx‘⟨𝑉, ( I ↾ 𝑃)⟩)𝑣 ∈ (UnivVtx‘⟨𝑉, ( I ↾ 𝑃)⟩)))
73	70, 72	mpbird 246	. 2 ⊢ (𝑉 ∈ 𝑊 → ⟨𝑉, ( I ↾ 𝑃)⟩ ∈ ComplGraph)
74		iscusgr 40640	. 2 ⊢ (⟨𝑉, ( I ↾ 𝑃)⟩ ∈ ComplUSGraph ↔ (⟨𝑉, ( I ↾ 𝑃)⟩ ∈ USGraph ∧ ⟨𝑉, ( I ↾ 𝑃)⟩ ∈ ComplGraph))
75	2, 73, 74	sylanbrc 695	1 ⊢ (𝑉 ∈ 𝑊 → ⟨𝑉, ( I ↾ 𝑃)⟩ ∈ ComplUSGraph)

Syntax hints:   → wi 4   ↔ wb 195   ∧ wa 383   ∧ w3a 1031   = wceq 1475   ∈ wcel 1977   ≠ wne 2780  ∀wral 2896  ∃wrex 2897  {crab 2900  Vcvv 3173   ∖ cdif 3537   ⊆ wss 3540  𝒫 cpw 4108  {csn 4125  {cpr 4127  ⟨cop 4131   I cid 4948  ran crn 5039   ↾ cres 5040  ‘cfv 5804  (class class class)co 6549  2c2 10947  #chash 12979  Vtxcvtx 25673  iEdgciedg 25674  Edgcedga 25792   USGraph cusgr 40379   NeighbVtx cnbgr 40550  UnivVtxcuvtxa 40551  ComplGraphccplgr 40552  ComplUSGraphccusgr 40553

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-8 1979  ax-9 1986  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590  ax-rep 4699  ax-sep 4709  ax-nul 4717  ax-pow 4769  ax-pr 4833  ax-un 6847  ax-cnex 9871  ax-resscn 9872  ax-1cn 9873  ax-icn 9874  ax-addcl 9875  ax-addrcl 9876  ax-mulcl 9877  ax-mulrcl 9878  ax-mulcom 9879  ax-addass 9880  ax-mulass 9881  ax-distr 9882  ax-i2m1 9883  ax-1ne0 9884  ax-1rid 9885  ax-rnegex 9886  ax-rrecex 9887  ax-cnre 9888  ax-pre-lttri 9889  ax-pre-lttrn 9890  ax-pre-ltadd 9891  ax-pre-mulgt0 9892

This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-3or 1032  df-3an 1033  df-tru 1478  df-fal 1481  df-ex 1696  df-nf 1701  df-sb 1868  df-eu 2462  df-mo 2463  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-ne 2782  df-nel 2783  df-ral 2901  df-rex 2902  df-reu 2903  df-rmo 2904  df-rab 2905  df-v 3175  df-sbc 3403  df-csb 3500  df-dif 3543  df-un 3545  df-in 3547  df-ss 3554  df-pss 3556  df-nul 3875  df-if 4037  df-pw 4110  df-sn 4126  df-pr 4128  df-tp 4130  df-op 4132  df-uni 4373  df-int 4411  df-iun 4457  df-br 4584  df-opab 4644  df-mpt 4645  df-tr 4681  df-eprel 4949  df-id 4953  df-po 4959  df-so 4960  df-fr 4997  df-we 4999  df-xp 5044  df-rel 5045  df-cnv 5046  df-co 5047  df-dm 5048  df-rn 5049  df-res 5050  df-ima 5051  df-pred 5597  df-ord 5643  df-on 5644  df-lim 5645  df-suc 5646  df-iota 5768  df-fun 5806  df-fn 5807  df-f 5808  df-f1 5809  df-fo 5810  df-f1o 5811  df-fv 5812  df-riota 6511  df-ov 6552  df-oprab 6553  df-mpt2 6554  df-om 6958  df-1st 7059  df-2nd 7060  df-wrecs 7294  df-recs 7355  df-rdg 7393  df-1o 7447  df-oadd 7451  df-er 7629  df-en 7842  df-dom 7843  df-sdom 7844  df-fin 7845  df-card 8648  df-cda 8873  df-pnf 9955  df-mnf 9956  df-xr 9957  df-ltxr 9958  df-le 9959  df-sub 10147  df-neg 10148  df-nn 10898  df-2 10956  df-n0 11170  df-z 11255  df-uz 11564  df-fz 12198  df-hash 12980  df-vtx 25675  df-iedg 25676  df-edga 25793  df-usgr 40381  df-nbgr 40554  df-uvtxa 40556  df-cplgr 40557  df-cusgr 40558

This theorem is referenced by:  cusgrexg  40663