Theorem grilcbri2 48817

Description: Implications of two graphs being locally isomorphic. (Contributed by AV, 9-Jun-2025.)

Hypotheses

Ref	Expression
dfgrlic2.v	⊢ 𝑉 = (Vtx‘𝐺)
dfgrlic2.w	⊢ 𝑊 = (Vtx‘𝐻)
dfgrlic3.i	⊢ 𝐼 = (iEdg‘𝐺)
dfgrlic3.j	⊢ 𝐽 = (iEdg‘𝐻)
grilcbri2.n	⊢ 𝑁 = (𝐺 ClNeighbVtx 𝑋)
grilcbri2.m	⊢ 𝑀 = (𝐻 ClNeighbVtx (𝑓‘𝑋))
grilcbri2.k	⊢ 𝐾 = {𝑥 ∈ dom 𝐼 ∣ (𝐼‘𝑥) ⊆ 𝑁}
grilcbri2.l	⊢ 𝐿 = {𝑥 ∈ dom 𝐽 ∣ (𝐽‘𝑥) ⊆ 𝑀}

Assertion

Ref	Expression
grilcbri2	⊢ (𝐺 ≃𝑙𝑔𝑟 𝐻 → ∃𝑓(𝑓:𝑉–1-1-onto→𝑊 ∧ (𝑋 ∈ 𝑉 → ∃𝑗(𝑗:𝑁–1-1-onto→𝑀 ∧ ∃𝑔(𝑔:𝐾–1-1-onto→𝐿 ∧ ∀𝑖 ∈ 𝐾 (𝑗 “ (𝐼‘𝑖)) = (𝐽‘(𝑔‘𝑖)))))))

Distinct variable groups:   𝑓,𝐺   𝑓,𝐻   𝑓,𝑋   𝑔,𝐺,𝑖,𝑗,𝑓   𝑥,𝐺   𝑔,𝐻,𝑖,𝑗   𝑥,𝐻   𝑖,𝐼,𝑥   𝑖,𝐽,𝑥   𝑖,𝐾   𝑔,𝑋,𝑗   𝑥,𝑋,𝑓

Allowed substitution hints:   𝐼(𝑓, 𝑔, 𝑗)   𝐽(𝑓, 𝑔, 𝑗)   𝐾(𝑥, 𝑓, 𝑔, 𝑗)   𝐿(𝑥, 𝑓, 𝑔, 𝑖, 𝑗)   𝑀(𝑥, 𝑓, 𝑔, 𝑖, 𝑗)   𝑁(𝑥, 𝑓, 𝑔, 𝑖, 𝑗)   𝑉(𝑥, 𝑓, 𝑔, 𝑖, 𝑗)   𝑊(𝑥, 𝑓, 𝑔, 𝑖, 𝑗)   𝑋(𝑖)

Proof of Theorem grilcbri2

Dummy variable 𝑣 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		brgrlic 48810	. . 3 ⊢ (𝐺 ≃𝑙𝑔𝑟 𝐻 ↔ (𝐺 GraphLocIso 𝐻) ≠ ∅)
2		grlimdmrel 48786	. . . . 5 ⊢ Rel dom GraphLocIso
3	2	ovprc 7461	. . . 4 ⊢ (¬ (𝐺 ∈ V ∧ 𝐻 ∈ V) → (𝐺 GraphLocIso 𝐻) = ∅)
4	3	necon1ai 2988	. . 3 ⊢ ((𝐺 GraphLocIso 𝐻) ≠ ∅ → (𝐺 ∈ V ∧ 𝐻 ∈ V))
5	1, 4	sylbi 220	. 2 ⊢ (𝐺 ≃𝑙𝑔𝑟 𝐻 → (𝐺 ∈ V ∧ 𝐻 ∈ V))
6		dfgrlic2.v	. . . 4 ⊢ 𝑉 = (Vtx‘𝐺)
7		dfgrlic2.w	. . . 4 ⊢ 𝑊 = (Vtx‘𝐻)
8		dfgrlic3.i	. . . 4 ⊢ 𝐼 = (iEdg‘𝐺)
9		dfgrlic3.j	. . . 4 ⊢ 𝐽 = (iEdg‘𝐻)
10		eqid 2766	. . . 4 ⊢ (𝐺 ClNeighbVtx 𝑣) = (𝐺 ClNeighbVtx 𝑣)
11		eqid 2766	. . . 4 ⊢ (𝐻 ClNeighbVtx (𝑓‘𝑣)) = (𝐻 ClNeighbVtx (𝑓‘𝑣))
12		eqid 2766	. . . 4 ⊢ {𝑥 ∈ dom 𝐼 ∣ (𝐼‘𝑥) ⊆ (𝐺 ClNeighbVtx 𝑣)} = {𝑥 ∈ dom 𝐼 ∣ (𝐼‘𝑥) ⊆ (𝐺 ClNeighbVtx 𝑣)}
13		eqid 2766	. . . 4 ⊢ {𝑥 ∈ dom 𝐽 ∣ (𝐽‘𝑥) ⊆ (𝐻 ClNeighbVtx (𝑓‘𝑣))} = {𝑥 ∈ dom 𝐽 ∣ (𝐽‘𝑥) ⊆ (𝐻 ClNeighbVtx (𝑓‘𝑣))}
14	6, 7, 8, 9, 10, 11, 12, 13	dfgrlic3 48816	. . 3 ⊢ ((𝐺 ∈ V ∧ 𝐻 ∈ V) → (𝐺 ≃𝑙𝑔𝑟 𝐻 ↔ ∃𝑓(𝑓:𝑉–1-1-onto→𝑊 ∧ ∀𝑣 ∈ 𝑉 ∃𝑗(𝑗:(𝐺 ClNeighbVtx 𝑣)–1-1-onto→(𝐻 ClNeighbVtx (𝑓‘𝑣)) ∧ ∃𝑔(𝑔:{𝑥 ∈ dom 𝐼 ∣ (𝐼‘𝑥) ⊆ (𝐺 ClNeighbVtx 𝑣)}–1-1-onto→{𝑥 ∈ dom 𝐽 ∣ (𝐽‘𝑥) ⊆ (𝐻 ClNeighbVtx (𝑓‘𝑣))} ∧ ∀𝑖 ∈ {𝑥 ∈ dom 𝐼 ∣ (𝐼‘𝑥) ⊆ (𝐺 ClNeighbVtx 𝑣)} (𝑗 “ (𝐼‘𝑖)) = (𝐽‘(𝑔‘𝑖)))))))
15		eqidd 2767	. . . . . . . . . . 11 ⊢ (𝑣 = 𝑋 → 𝑗 = 𝑗)
16		oveq2 7431	. . . . . . . . . . . 12 ⊢ (𝑣 = 𝑋 → (𝐺 ClNeighbVtx 𝑣) = (𝐺 ClNeighbVtx 𝑋))
17		grilcbri2.n	. . . . . . . . . . . 12 ⊢ 𝑁 = (𝐺 ClNeighbVtx 𝑋)
18	16, 17	eqtr4di 2819	. . . . . . . . . . 11 ⊢ (𝑣 = 𝑋 → (𝐺 ClNeighbVtx 𝑣) = 𝑁)
19		fveq2 6888	. . . . . . . . . . . . 13 ⊢ (𝑣 = 𝑋 → (𝑓‘𝑣) = (𝑓‘𝑋))
20	19	oveq2d 7439	. . . . . . . . . . . 12 ⊢ (𝑣 = 𝑋 → (𝐻 ClNeighbVtx (𝑓‘𝑣)) = (𝐻 ClNeighbVtx (𝑓‘𝑋)))
21		grilcbri2.m	. . . . . . . . . . . 12 ⊢ 𝑀 = (𝐻 ClNeighbVtx (𝑓‘𝑋))
22	20, 21	eqtr4di 2819	. . . . . . . . . . 11 ⊢ (𝑣 = 𝑋 → (𝐻 ClNeighbVtx (𝑓‘𝑣)) = 𝑀)
23	15, 18, 22	f1oeq123d 6821	. . . . . . . . . 10 ⊢ (𝑣 = 𝑋 → (𝑗:(𝐺 ClNeighbVtx 𝑣)–1-1-onto→(𝐻 ClNeighbVtx (𝑓‘𝑣)) ↔ 𝑗:𝑁–1-1-onto→𝑀))
24		eqidd 2767	. . . . . . . . . . . . 13 ⊢ (𝑣 = 𝑋 → 𝑔 = 𝑔)
25	18	sseq2d 3972	. . . . . . . . . . . . . . 15 ⊢ (𝑣 = 𝑋 → ((𝐼‘𝑥) ⊆ (𝐺 ClNeighbVtx 𝑣) ↔ (𝐼‘𝑥) ⊆ 𝑁))
26	25	rabbidv 3426	. . . . . . . . . . . . . 14 ⊢ (𝑣 = 𝑋 → {𝑥 ∈ dom 𝐼 ∣ (𝐼‘𝑥) ⊆ (𝐺 ClNeighbVtx 𝑣)} = {𝑥 ∈ dom 𝐼 ∣ (𝐼‘𝑥) ⊆ 𝑁})
27		grilcbri2.k	. . . . . . . . . . . . . 14 ⊢ 𝐾 = {𝑥 ∈ dom 𝐼 ∣ (𝐼‘𝑥) ⊆ 𝑁}
28	26, 27	eqtr4di 2819	. . . . . . . . . . . . 13 ⊢ (𝑣 = 𝑋 → {𝑥 ∈ dom 𝐼 ∣ (𝐼‘𝑥) ⊆ (𝐺 ClNeighbVtx 𝑣)} = 𝐾)
29	22	sseq2d 3972	. . . . . . . . . . . . . . 15 ⊢ (𝑣 = 𝑋 → ((𝐽‘𝑥) ⊆ (𝐻 ClNeighbVtx (𝑓‘𝑣)) ↔ (𝐽‘𝑥) ⊆ 𝑀))
30	29	rabbidv 3426	. . . . . . . . . . . . . 14 ⊢ (𝑣 = 𝑋 → {𝑥 ∈ dom 𝐽 ∣ (𝐽‘𝑥) ⊆ (𝐻 ClNeighbVtx (𝑓‘𝑣))} = {𝑥 ∈ dom 𝐽 ∣ (𝐽‘𝑥) ⊆ 𝑀})
31		grilcbri2.l	. . . . . . . . . . . . . 14 ⊢ 𝐿 = {𝑥 ∈ dom 𝐽 ∣ (𝐽‘𝑥) ⊆ 𝑀}
32	30, 31	eqtr4di 2819	. . . . . . . . . . . . 13 ⊢ (𝑣 = 𝑋 → {𝑥 ∈ dom 𝐽 ∣ (𝐽‘𝑥) ⊆ (𝐻 ClNeighbVtx (𝑓‘𝑣))} = 𝐿)
33	24, 28, 32	f1oeq123d 6821	. . . . . . . . . . . 12 ⊢ (𝑣 = 𝑋 → (𝑔:{𝑥 ∈ dom 𝐼 ∣ (𝐼‘𝑥) ⊆ (𝐺 ClNeighbVtx 𝑣)}–1-1-onto→{𝑥 ∈ dom 𝐽 ∣ (𝐽‘𝑥) ⊆ (𝐻 ClNeighbVtx (𝑓‘𝑣))} ↔ 𝑔:𝐾–1-1-onto→𝐿))
34	28	raleqdv 3326	. . . . . . . . . . . 12 ⊢ (𝑣 = 𝑋 → (∀𝑖 ∈ {𝑥 ∈ dom 𝐼 ∣ (𝐼‘𝑥) ⊆ (𝐺 ClNeighbVtx 𝑣)} (𝑗 “ (𝐼‘𝑖)) = (𝐽‘(𝑔‘𝑖)) ↔ ∀𝑖 ∈ 𝐾 (𝑗 “ (𝐼‘𝑖)) = (𝐽‘(𝑔‘𝑖))))
35	33, 34	anbi12d 644	. . . . . . . . . . 11 ⊢ (𝑣 = 𝑋 → ((𝑔:{𝑥 ∈ dom 𝐼 ∣ (𝐼‘𝑥) ⊆ (𝐺 ClNeighbVtx 𝑣)}–1-1-onto→{𝑥 ∈ dom 𝐽 ∣ (𝐽‘𝑥) ⊆ (𝐻 ClNeighbVtx (𝑓‘𝑣))} ∧ ∀𝑖 ∈ {𝑥 ∈ dom 𝐼 ∣ (𝐼‘𝑥) ⊆ (𝐺 ClNeighbVtx 𝑣)} (𝑗 “ (𝐼‘𝑖)) = (𝐽‘(𝑔‘𝑖))) ↔ (𝑔:𝐾–1-1-onto→𝐿 ∧ ∀𝑖 ∈ 𝐾 (𝑗 “ (𝐼‘𝑖)) = (𝐽‘(𝑔‘𝑖)))))
36	35	exbidv 1954	. . . . . . . . . 10 ⊢ (𝑣 = 𝑋 → (∃𝑔(𝑔:{𝑥 ∈ dom 𝐼 ∣ (𝐼‘𝑥) ⊆ (𝐺 ClNeighbVtx 𝑣)}–1-1-onto→{𝑥 ∈ dom 𝐽 ∣ (𝐽‘𝑥) ⊆ (𝐻 ClNeighbVtx (𝑓‘𝑣))} ∧ ∀𝑖 ∈ {𝑥 ∈ dom 𝐼 ∣ (𝐼‘𝑥) ⊆ (𝐺 ClNeighbVtx 𝑣)} (𝑗 “ (𝐼‘𝑖)) = (𝐽‘(𝑔‘𝑖))) ↔ ∃𝑔(𝑔:𝐾–1-1-onto→𝐿 ∧ ∀𝑖 ∈ 𝐾 (𝑗 “ (𝐼‘𝑖)) = (𝐽‘(𝑔‘𝑖)))))
37	23, 36	anbi12d 644	. . . . . . . . 9 ⊢ (𝑣 = 𝑋 → ((𝑗:(𝐺 ClNeighbVtx 𝑣)–1-1-onto→(𝐻 ClNeighbVtx (𝑓‘𝑣)) ∧ ∃𝑔(𝑔:{𝑥 ∈ dom 𝐼 ∣ (𝐼‘𝑥) ⊆ (𝐺 ClNeighbVtx 𝑣)}–1-1-onto→{𝑥 ∈ dom 𝐽 ∣ (𝐽‘𝑥) ⊆ (𝐻 ClNeighbVtx (𝑓‘𝑣))} ∧ ∀𝑖 ∈ {𝑥 ∈ dom 𝐼 ∣ (𝐼‘𝑥) ⊆ (𝐺 ClNeighbVtx 𝑣)} (𝑗 “ (𝐼‘𝑖)) = (𝐽‘(𝑔‘𝑖)))) ↔ (𝑗:𝑁–1-1-onto→𝑀 ∧ ∃𝑔(𝑔:𝐾–1-1-onto→𝐿 ∧ ∀𝑖 ∈ 𝐾 (𝑗 “ (𝐼‘𝑖)) = (𝐽‘(𝑔‘𝑖))))))
38	37	exbidv 1954	. . . . . . . 8 ⊢ (𝑣 = 𝑋 → (∃𝑗(𝑗:(𝐺 ClNeighbVtx 𝑣)–1-1-onto→(𝐻 ClNeighbVtx (𝑓‘𝑣)) ∧ ∃𝑔(𝑔:{𝑥 ∈ dom 𝐼 ∣ (𝐼‘𝑥) ⊆ (𝐺 ClNeighbVtx 𝑣)}–1-1-onto→{𝑥 ∈ dom 𝐽 ∣ (𝐽‘𝑥) ⊆ (𝐻 ClNeighbVtx (𝑓‘𝑣))} ∧ ∀𝑖 ∈ {𝑥 ∈ dom 𝐼 ∣ (𝐼‘𝑥) ⊆ (𝐺 ClNeighbVtx 𝑣)} (𝑗 “ (𝐼‘𝑖)) = (𝐽‘(𝑔‘𝑖)))) ↔ ∃𝑗(𝑗:𝑁–1-1-onto→𝑀 ∧ ∃𝑔(𝑔:𝐾–1-1-onto→𝐿 ∧ ∀𝑖 ∈ 𝐾 (𝑗 “ (𝐼‘𝑖)) = (𝐽‘(𝑔‘𝑖))))))
39	38	rspcv 3580	. . . . . . 7 ⊢ (𝑋 ∈ 𝑉 → (∀𝑣 ∈ 𝑉 ∃𝑗(𝑗:(𝐺 ClNeighbVtx 𝑣)–1-1-onto→(𝐻 ClNeighbVtx (𝑓‘𝑣)) ∧ ∃𝑔(𝑔:{𝑥 ∈ dom 𝐼 ∣ (𝐼‘𝑥) ⊆ (𝐺 ClNeighbVtx 𝑣)}–1-1-onto→{𝑥 ∈ dom 𝐽 ∣ (𝐽‘𝑥) ⊆ (𝐻 ClNeighbVtx (𝑓‘𝑣))} ∧ ∀𝑖 ∈ {𝑥 ∈ dom 𝐼 ∣ (𝐼‘𝑥) ⊆ (𝐺 ClNeighbVtx 𝑣)} (𝑗 “ (𝐼‘𝑖)) = (𝐽‘(𝑔‘𝑖)))) → ∃𝑗(𝑗:𝑁–1-1-onto→𝑀 ∧ ∃𝑔(𝑔:𝐾–1-1-onto→𝐿 ∧ ∀𝑖 ∈ 𝐾 (𝑗 “ (𝐼‘𝑖)) = (𝐽‘(𝑔‘𝑖))))))
40	39	com12 33	. . . . . 6 ⊢ (∀𝑣 ∈ 𝑉 ∃𝑗(𝑗:(𝐺 ClNeighbVtx 𝑣)–1-1-onto→(𝐻 ClNeighbVtx (𝑓‘𝑣)) ∧ ∃𝑔(𝑔:{𝑥 ∈ dom 𝐼 ∣ (𝐼‘𝑥) ⊆ (𝐺 ClNeighbVtx 𝑣)}–1-1-onto→{𝑥 ∈ dom 𝐽 ∣ (𝐽‘𝑥) ⊆ (𝐻 ClNeighbVtx (𝑓‘𝑣))} ∧ ∀𝑖 ∈ {𝑥 ∈ dom 𝐼 ∣ (𝐼‘𝑥) ⊆ (𝐺 ClNeighbVtx 𝑣)} (𝑗 “ (𝐼‘𝑖)) = (𝐽‘(𝑔‘𝑖)))) → (𝑋 ∈ 𝑉 → ∃𝑗(𝑗:𝑁–1-1-onto→𝑀 ∧ ∃𝑔(𝑔:𝐾–1-1-onto→𝐿 ∧ ∀𝑖 ∈ 𝐾 (𝑗 “ (𝐼‘𝑖)) = (𝐽‘(𝑔‘𝑖))))))
41	40	a1i 11	. . . . 5 ⊢ ((𝐺 ∈ V ∧ 𝐻 ∈ V) → (∀𝑣 ∈ 𝑉 ∃𝑗(𝑗:(𝐺 ClNeighbVtx 𝑣)–1-1-onto→(𝐻 ClNeighbVtx (𝑓‘𝑣)) ∧ ∃𝑔(𝑔:{𝑥 ∈ dom 𝐼 ∣ (𝐼‘𝑥) ⊆ (𝐺 ClNeighbVtx 𝑣)}–1-1-onto→{𝑥 ∈ dom 𝐽 ∣ (𝐽‘𝑥) ⊆ (𝐻 ClNeighbVtx (𝑓‘𝑣))} ∧ ∀𝑖 ∈ {𝑥 ∈ dom 𝐼 ∣ (𝐼‘𝑥) ⊆ (𝐺 ClNeighbVtx 𝑣)} (𝑗 “ (𝐼‘𝑖)) = (𝐽‘(𝑔‘𝑖)))) → (𝑋 ∈ 𝑉 → ∃𝑗(𝑗:𝑁–1-1-onto→𝑀 ∧ ∃𝑔(𝑔:𝐾–1-1-onto→𝐿 ∧ ∀𝑖 ∈ 𝐾 (𝑗 “ (𝐼‘𝑖)) = (𝐽‘(𝑔‘𝑖)))))))
42	41	anim2d 624	. . . 4 ⊢ ((𝐺 ∈ V ∧ 𝐻 ∈ V) → ((𝑓:𝑉–1-1-onto→𝑊 ∧ ∀𝑣 ∈ 𝑉 ∃𝑗(𝑗:(𝐺 ClNeighbVtx 𝑣)–1-1-onto→(𝐻 ClNeighbVtx (𝑓‘𝑣)) ∧ ∃𝑔(𝑔:{𝑥 ∈ dom 𝐼 ∣ (𝐼‘𝑥) ⊆ (𝐺 ClNeighbVtx 𝑣)}–1-1-onto→{𝑥 ∈ dom 𝐽 ∣ (𝐽‘𝑥) ⊆ (𝐻 ClNeighbVtx (𝑓‘𝑣))} ∧ ∀𝑖 ∈ {𝑥 ∈ dom 𝐼 ∣ (𝐼‘𝑥) ⊆ (𝐺 ClNeighbVtx 𝑣)} (𝑗 “ (𝐼‘𝑖)) = (𝐽‘(𝑔‘𝑖))))) → (𝑓:𝑉–1-1-onto→𝑊 ∧ (𝑋 ∈ 𝑉 → ∃𝑗(𝑗:𝑁–1-1-onto→𝑀 ∧ ∃𝑔(𝑔:𝐾–1-1-onto→𝐿 ∧ ∀𝑖 ∈ 𝐾 (𝑗 “ (𝐼‘𝑖)) = (𝐽‘(𝑔‘𝑖))))))))
43	42	eximdv 1950	. . 3 ⊢ ((𝐺 ∈ V ∧ 𝐻 ∈ V) → (∃𝑓(𝑓:𝑉–1-1-onto→𝑊 ∧ ∀𝑣 ∈ 𝑉 ∃𝑗(𝑗:(𝐺 ClNeighbVtx 𝑣)–1-1-onto→(𝐻 ClNeighbVtx (𝑓‘𝑣)) ∧ ∃𝑔(𝑔:{𝑥 ∈ dom 𝐼 ∣ (𝐼‘𝑥) ⊆ (𝐺 ClNeighbVtx 𝑣)}–1-1-onto→{𝑥 ∈ dom 𝐽 ∣ (𝐽‘𝑥) ⊆ (𝐻 ClNeighbVtx (𝑓‘𝑣))} ∧ ∀𝑖 ∈ {𝑥 ∈ dom 𝐼 ∣ (𝐼‘𝑥) ⊆ (𝐺 ClNeighbVtx 𝑣)} (𝑗 “ (𝐼‘𝑖)) = (𝐽‘(𝑔‘𝑖))))) → ∃𝑓(𝑓:𝑉–1-1-onto→𝑊 ∧ (𝑋 ∈ 𝑉 → ∃𝑗(𝑗:𝑁–1-1-onto→𝑀 ∧ ∃𝑔(𝑔:𝐾–1-1-onto→𝐿 ∧ ∀𝑖 ∈ 𝐾 (𝑗 “ (𝐼‘𝑖)) = (𝐽‘(𝑔‘𝑖))))))))
44	14, 43	sylbid 243	. 2 ⊢ ((𝐺 ∈ V ∧ 𝐻 ∈ V) → (𝐺 ≃𝑙𝑔𝑟 𝐻 → ∃𝑓(𝑓:𝑉–1-1-onto→𝑊 ∧ (𝑋 ∈ 𝑉 → ∃𝑗(𝑗:𝑁–1-1-onto→𝑀 ∧ ∃𝑔(𝑔:𝐾–1-1-onto→𝐿 ∧ ∀𝑖 ∈ 𝐾 (𝑗 “ (𝐼‘𝑖)) = (𝐽‘(𝑔‘𝑖))))))))
45	5, 44	mpcom 39	1 ⊢ (𝐺 ≃𝑙𝑔𝑟 𝐻 → ∃𝑓(𝑓:𝑉–1-1-onto→𝑊 ∧ (𝑋 ∈ 𝑉 → ∃𝑗(𝑗:𝑁–1-1-onto→𝑀 ∧ ∃𝑔(𝑔:𝐾–1-1-onto→𝐿 ∧ ∀𝑖 ∈ 𝐾 (𝑗 “ (𝐼‘𝑖)) = (𝐽‘(𝑔‘𝑖)))))))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570  ∃wex 1812   ∈ wcel 2146   ≠ wne 2961  ∀wral 3082  {crab 3419  Vcvv 3458   ⊆ wss 3908  ∅c0 4289   class class class wbr 5114  dom cdm 5666   “ cima 5669  –1-1-onto→wf1o 6542  ‘cfv 6543  (class class class)co 7423  Vtxcvtx 29383  iEdgciedg 29384   ClNeighbVtx cclnbgr 48624   GraphLocIso cgrlim 48782   ≃_𝑙𝑔𝑟 cgrlic 48783

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2738  ax-sep 5262  ax-nul 5274  ax-pow 5341  ax-pr 5409  ax-un 7745

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2570  df-eu 2600  df-clab 2745  df-cleq 2758  df-clel 2841  df-nfc 2915  df-ne 2962  df-ral 3083  df-rex 3093  df-rab 3420  df-v 3460  df-sbc 3748  df-csb 3857  df-dif 3911  df-un 3913  df-in 3915  df-ss 3925  df-nul 4290  df-if 4493  df-pw 4569  df-sn 4595  df-pr 4597  df-op 4601  df-uni 4878  df-iun 4963  df-br 5115  df-opab 5179  df-mpt 5198  df-id 5561  df-xp 5672  df-rel 5673  df-cnv 5674  df-co 5675  df-dm 5676  df-rn 5677  df-res 5678  df-ima 5679  df-suc 6373  df-iota 6499  df-fun 6545  df-fn 6546  df-f 6547  df-f1 6548  df-fo 6549  df-f1o 6550  df-fv 6551  df-ov 7426  df-oprab 7427  df-mpo 7428  df-1st 7995  df-2nd 7996  df-1o 8462  df-map 8835  df-vtx 29385  df-iedg 29386  df-clnbgr 48625  df-isubgr 48667  df-grim 48684  df-gric 48687  df-grlim 48784  df-grlic 48787

This theorem is used by: (None)