Theorem uspgrlimlem2 48020

Description: Lemma 2 for uspgrlim 48023. (Contributed by AV, 16-Aug-2025.)

Hypotheses

Ref	Expression
uspgrlimlem1.m	⊢ 𝑀 = (𝐻 ClNeighbVtx 𝑋)
uspgrlimlem1.j	⊢ 𝐽 = (Edg‘𝐻)
uspgrlimlem1.l	⊢ 𝐿 = {𝑥 ∈ 𝐽 ∣ 𝑥 ⊆ 𝑀}

Assertion

Ref	Expression
uspgrlimlem2	⊢ (𝐻 ∈ USPGraph → (◡(iEdg‘𝐻) “ 𝐿) = {𝑥 ∈ dom (iEdg‘𝐻) ∣ ((iEdg‘𝐻)‘𝑥) ⊆ 𝑀})

Distinct variable groups:   𝑥,𝐻   𝑥,𝐽   𝑥,𝑀   𝑥,𝐿

Allowed substitution hint:   𝑋(𝑥)

Proof of Theorem uspgrlimlem2

Dummy variable 𝑦 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		eqid 2731	. . . . 5 ⊢ (iEdg‘𝐻) = (iEdg‘𝐻)
2	1	uspgrf1oedg 29146	. . . 4 ⊢ (𝐻 ∈ USPGraph → (iEdg‘𝐻):dom (iEdg‘𝐻)–1-1-onto→(Edg‘𝐻))
3		f1ocnv 6770	. . . 4 ⊢ ((iEdg‘𝐻):dom (iEdg‘𝐻)–1-1-onto→(Edg‘𝐻) → ◡(iEdg‘𝐻):(Edg‘𝐻)–1-1-onto→dom (iEdg‘𝐻))
4		f1of 6758	. . . 4 ⊢ (◡(iEdg‘𝐻):(Edg‘𝐻)–1-1-onto→dom (iEdg‘𝐻) → ◡(iEdg‘𝐻):(Edg‘𝐻)⟶dom (iEdg‘𝐻))
5	2, 3, 4	3syl 18	. . 3 ⊢ (𝐻 ∈ USPGraph → ◡(iEdg‘𝐻):(Edg‘𝐻)⟶dom (iEdg‘𝐻))
6		uspgrlimlem1.l	. . . . 5 ⊢ 𝐿 = {𝑥 ∈ 𝐽 ∣ 𝑥 ⊆ 𝑀}
7		uspgrlimlem1.j	. . . . . 6 ⊢ 𝐽 = (Edg‘𝐻)
8	7	rabeqi 3408	. . . . 5 ⊢ {𝑥 ∈ 𝐽 ∣ 𝑥 ⊆ 𝑀} = {𝑥 ∈ (Edg‘𝐻) ∣ 𝑥 ⊆ 𝑀}
9	6, 8	eqtri 2754	. . . 4 ⊢ 𝐿 = {𝑥 ∈ (Edg‘𝐻) ∣ 𝑥 ⊆ 𝑀}
10	9	ssrab3 4027	. . 3 ⊢ 𝐿 ⊆ (Edg‘𝐻)
11		fimarab 6891	. . 3 ⊢ ((◡(iEdg‘𝐻):(Edg‘𝐻)⟶dom (iEdg‘𝐻) ∧ 𝐿 ⊆ (Edg‘𝐻)) → (◡(iEdg‘𝐻) “ 𝐿) = {𝑥 ∈ dom (iEdg‘𝐻) ∣ ∃𝑦 ∈ 𝐿 (◡(iEdg‘𝐻)‘𝑦) = 𝑥})
12	5, 10, 11	sylancl 586	. 2 ⊢ (𝐻 ∈ USPGraph → (◡(iEdg‘𝐻) “ 𝐿) = {𝑥 ∈ dom (iEdg‘𝐻) ∣ ∃𝑦 ∈ 𝐿 (◡(iEdg‘𝐻)‘𝑦) = 𝑥})
13		sseq1 3955	. . . . . . 7 ⊢ (𝑥 = 𝑦 → (𝑥 ⊆ 𝑀 ↔ 𝑦 ⊆ 𝑀))
14	13, 6	elrab2 3645	. . . . . 6 ⊢ (𝑦 ∈ 𝐿 ↔ (𝑦 ∈ 𝐽 ∧ 𝑦 ⊆ 𝑀))
15	7	eleq2i 2823	. . . . . . . . . . . . . . . . 17 ⊢ (𝑦 ∈ 𝐽 ↔ 𝑦 ∈ (Edg‘𝐻))
16	15	biimpi 216	. . . . . . . . . . . . . . . 16 ⊢ (𝑦 ∈ 𝐽 → 𝑦 ∈ (Edg‘𝐻))
17		f1ocnvfv2 7206	. . . . . . . . . . . . . . . 16 ⊢ (((iEdg‘𝐻):dom (iEdg‘𝐻)–1-1-onto→(Edg‘𝐻) ∧ 𝑦 ∈ (Edg‘𝐻)) → ((iEdg‘𝐻)‘(◡(iEdg‘𝐻)‘𝑦)) = 𝑦)
18	2, 16, 17	syl2an 596	. . . . . . . . . . . . . . 15 ⊢ ((𝐻 ∈ USPGraph ∧ 𝑦 ∈ 𝐽) → ((iEdg‘𝐻)‘(◡(iEdg‘𝐻)‘𝑦)) = 𝑦)
19	18	eqcomd 2737	. . . . . . . . . . . . . 14 ⊢ ((𝐻 ∈ USPGraph ∧ 𝑦 ∈ 𝐽) → 𝑦 = ((iEdg‘𝐻)‘(◡(iEdg‘𝐻)‘𝑦)))
20	19	sseq1d 3961	. . . . . . . . . . . . 13 ⊢ ((𝐻 ∈ USPGraph ∧ 𝑦 ∈ 𝐽) → (𝑦 ⊆ 𝑀 ↔ ((iEdg‘𝐻)‘(◡(iEdg‘𝐻)‘𝑦)) ⊆ 𝑀))
21	20	biimpd 229	. . . . . . . . . . . 12 ⊢ ((𝐻 ∈ USPGraph ∧ 𝑦 ∈ 𝐽) → (𝑦 ⊆ 𝑀 → ((iEdg‘𝐻)‘(◡(iEdg‘𝐻)‘𝑦)) ⊆ 𝑀))
22	21	ex 412	. . . . . . . . . . 11 ⊢ (𝐻 ∈ USPGraph → (𝑦 ∈ 𝐽 → (𝑦 ⊆ 𝑀 → ((iEdg‘𝐻)‘(◡(iEdg‘𝐻)‘𝑦)) ⊆ 𝑀)))
23	22	adantr 480	. . . . . . . . . 10 ⊢ ((𝐻 ∈ USPGraph ∧ 𝑥 ∈ dom (iEdg‘𝐻)) → (𝑦 ∈ 𝐽 → (𝑦 ⊆ 𝑀 → ((iEdg‘𝐻)‘(◡(iEdg‘𝐻)‘𝑦)) ⊆ 𝑀)))
24	23	imp32 418	. . . . . . . . 9 ⊢ (((𝐻 ∈ USPGraph ∧ 𝑥 ∈ dom (iEdg‘𝐻)) ∧ (𝑦 ∈ 𝐽 ∧ 𝑦 ⊆ 𝑀)) → ((iEdg‘𝐻)‘(◡(iEdg‘𝐻)‘𝑦)) ⊆ 𝑀)
25	24	3adant3 1132	. . . . . . . 8 ⊢ (((𝐻 ∈ USPGraph ∧ 𝑥 ∈ dom (iEdg‘𝐻)) ∧ (𝑦 ∈ 𝐽 ∧ 𝑦 ⊆ 𝑀) ∧ (◡(iEdg‘𝐻)‘𝑦) = 𝑥) → ((iEdg‘𝐻)‘(◡(iEdg‘𝐻)‘𝑦)) ⊆ 𝑀)
26		fveq2 6817	. . . . . . . . . 10 ⊢ ((◡(iEdg‘𝐻)‘𝑦) = 𝑥 → ((iEdg‘𝐻)‘(◡(iEdg‘𝐻)‘𝑦)) = ((iEdg‘𝐻)‘𝑥))
27	26	sseq1d 3961	. . . . . . . . 9 ⊢ ((◡(iEdg‘𝐻)‘𝑦) = 𝑥 → (((iEdg‘𝐻)‘(◡(iEdg‘𝐻)‘𝑦)) ⊆ 𝑀 ↔ ((iEdg‘𝐻)‘𝑥) ⊆ 𝑀))
28	27	3ad2ant3 1135	. . . . . . . 8 ⊢ (((𝐻 ∈ USPGraph ∧ 𝑥 ∈ dom (iEdg‘𝐻)) ∧ (𝑦 ∈ 𝐽 ∧ 𝑦 ⊆ 𝑀) ∧ (◡(iEdg‘𝐻)‘𝑦) = 𝑥) → (((iEdg‘𝐻)‘(◡(iEdg‘𝐻)‘𝑦)) ⊆ 𝑀 ↔ ((iEdg‘𝐻)‘𝑥) ⊆ 𝑀))
29	25, 28	mpbid 232	. . . . . . 7 ⊢ (((𝐻 ∈ USPGraph ∧ 𝑥 ∈ dom (iEdg‘𝐻)) ∧ (𝑦 ∈ 𝐽 ∧ 𝑦 ⊆ 𝑀) ∧ (◡(iEdg‘𝐻)‘𝑦) = 𝑥) → ((iEdg‘𝐻)‘𝑥) ⊆ 𝑀)
30	29	3exp 1119	. . . . . 6 ⊢ ((𝐻 ∈ USPGraph ∧ 𝑥 ∈ dom (iEdg‘𝐻)) → ((𝑦 ∈ 𝐽 ∧ 𝑦 ⊆ 𝑀) → ((◡(iEdg‘𝐻)‘𝑦) = 𝑥 → ((iEdg‘𝐻)‘𝑥) ⊆ 𝑀)))
31	14, 30	biimtrid 242	. . . . 5 ⊢ ((𝐻 ∈ USPGraph ∧ 𝑥 ∈ dom (iEdg‘𝐻)) → (𝑦 ∈ 𝐿 → ((◡(iEdg‘𝐻)‘𝑦) = 𝑥 → ((iEdg‘𝐻)‘𝑥) ⊆ 𝑀)))
32	31	rexlimdv 3131	. . . 4 ⊢ ((𝐻 ∈ USPGraph ∧ 𝑥 ∈ dom (iEdg‘𝐻)) → (∃𝑦 ∈ 𝐿 (◡(iEdg‘𝐻)‘𝑦) = 𝑥 → ((iEdg‘𝐻)‘𝑥) ⊆ 𝑀))
33		fveqeq2 6826	. . . . . 6 ⊢ (𝑦 = ((iEdg‘𝐻)‘𝑥) → ((◡(iEdg‘𝐻)‘𝑦) = 𝑥 ↔ (◡(iEdg‘𝐻)‘((iEdg‘𝐻)‘𝑥)) = 𝑥))
34		f1of 6758	. . . . . . . . . 10 ⊢ ((iEdg‘𝐻):dom (iEdg‘𝐻)–1-1-onto→(Edg‘𝐻) → (iEdg‘𝐻):dom (iEdg‘𝐻)⟶(Edg‘𝐻))
35		eqid 2731	. . . . . . . . . . . 12 ⊢ dom (iEdg‘𝐻) = dom (iEdg‘𝐻)
36	7	eqcomi 2740	. . . . . . . . . . . 12 ⊢ (Edg‘𝐻) = 𝐽
37	35, 36	feq23i 6640	. . . . . . . . . . 11 ⊢ ((iEdg‘𝐻):dom (iEdg‘𝐻)⟶(Edg‘𝐻) ↔ (iEdg‘𝐻):dom (iEdg‘𝐻)⟶𝐽)
38	37	biimpi 216	. . . . . . . . . 10 ⊢ ((iEdg‘𝐻):dom (iEdg‘𝐻)⟶(Edg‘𝐻) → (iEdg‘𝐻):dom (iEdg‘𝐻)⟶𝐽)
39	2, 34, 38	3syl 18	. . . . . . . . 9 ⊢ (𝐻 ∈ USPGraph → (iEdg‘𝐻):dom (iEdg‘𝐻)⟶𝐽)
40	39	ffvelcdmda 7012	. . . . . . . 8 ⊢ ((𝐻 ∈ USPGraph ∧ 𝑥 ∈ dom (iEdg‘𝐻)) → ((iEdg‘𝐻)‘𝑥) ∈ 𝐽)
41	40	anim1i 615	. . . . . . 7 ⊢ (((𝐻 ∈ USPGraph ∧ 𝑥 ∈ dom (iEdg‘𝐻)) ∧ ((iEdg‘𝐻)‘𝑥) ⊆ 𝑀) → (((iEdg‘𝐻)‘𝑥) ∈ 𝐽 ∧ ((iEdg‘𝐻)‘𝑥) ⊆ 𝑀))
42		sseq1 3955	. . . . . . . 8 ⊢ (𝑦 = ((iEdg‘𝐻)‘𝑥) → (𝑦 ⊆ 𝑀 ↔ ((iEdg‘𝐻)‘𝑥) ⊆ 𝑀))
43	13, 42, 6	elrab2w 3646	. . . . . . 7 ⊢ (((iEdg‘𝐻)‘𝑥) ∈ 𝐿 ↔ (((iEdg‘𝐻)‘𝑥) ∈ 𝐽 ∧ ((iEdg‘𝐻)‘𝑥) ⊆ 𝑀))
44	41, 43	sylibr 234	. . . . . 6 ⊢ (((𝐻 ∈ USPGraph ∧ 𝑥 ∈ dom (iEdg‘𝐻)) ∧ ((iEdg‘𝐻)‘𝑥) ⊆ 𝑀) → ((iEdg‘𝐻)‘𝑥) ∈ 𝐿)
45		f1ocnvfv1 7205	. . . . . . . 8 ⊢ (((iEdg‘𝐻):dom (iEdg‘𝐻)–1-1-onto→(Edg‘𝐻) ∧ 𝑥 ∈ dom (iEdg‘𝐻)) → (◡(iEdg‘𝐻)‘((iEdg‘𝐻)‘𝑥)) = 𝑥)
46	2, 45	sylan 580	. . . . . . 7 ⊢ ((𝐻 ∈ USPGraph ∧ 𝑥 ∈ dom (iEdg‘𝐻)) → (◡(iEdg‘𝐻)‘((iEdg‘𝐻)‘𝑥)) = 𝑥)
47	46	adantr 480	. . . . . 6 ⊢ (((𝐻 ∈ USPGraph ∧ 𝑥 ∈ dom (iEdg‘𝐻)) ∧ ((iEdg‘𝐻)‘𝑥) ⊆ 𝑀) → (◡(iEdg‘𝐻)‘((iEdg‘𝐻)‘𝑥)) = 𝑥)
48	33, 44, 47	rspcedvdw 3575	. . . . 5 ⊢ (((𝐻 ∈ USPGraph ∧ 𝑥 ∈ dom (iEdg‘𝐻)) ∧ ((iEdg‘𝐻)‘𝑥) ⊆ 𝑀) → ∃𝑦 ∈ 𝐿 (◡(iEdg‘𝐻)‘𝑦) = 𝑥)
49	48	ex 412	. . . 4 ⊢ ((𝐻 ∈ USPGraph ∧ 𝑥 ∈ dom (iEdg‘𝐻)) → (((iEdg‘𝐻)‘𝑥) ⊆ 𝑀 → ∃𝑦 ∈ 𝐿 (◡(iEdg‘𝐻)‘𝑦) = 𝑥))
50	32, 49	impbid 212	. . 3 ⊢ ((𝐻 ∈ USPGraph ∧ 𝑥 ∈ dom (iEdg‘𝐻)) → (∃𝑦 ∈ 𝐿 (◡(iEdg‘𝐻)‘𝑦) = 𝑥 ↔ ((iEdg‘𝐻)‘𝑥) ⊆ 𝑀))
51	50	rabbidva 3401	. 2 ⊢ (𝐻 ∈ USPGraph → {𝑥 ∈ dom (iEdg‘𝐻) ∣ ∃𝑦 ∈ 𝐿 (◡(iEdg‘𝐻)‘𝑦) = 𝑥} = {𝑥 ∈ dom (iEdg‘𝐻) ∣ ((iEdg‘𝐻)‘𝑥) ⊆ 𝑀})
52	12, 51	eqtrd 2766	1 ⊢ (𝐻 ∈ USPGraph → (◡(iEdg‘𝐻) “ 𝐿) = {𝑥 ∈ dom (iEdg‘𝐻) ∣ ((iEdg‘𝐻)‘𝑥) ⊆ 𝑀})

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   ∧ w3a 1086   = wceq 1541   ∈ wcel 2111  ∃wrex 3056  {crab 3395   ⊆ wss 3897  ^◡ccnv 5610  dom cdm 5611   “ cima 5614  ⟶wf 6472  –1-1-onto→wf1o 6475  ‘cfv 6476  (class class class)co 7341  iEdgciedg 28970  Edgcedg 29020  USPGraphcuspgr 29121   ClNeighbVtx cclnbgr 47849

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2113  ax-9 2121  ax-10 2144  ax-11 2160  ax-12 2180  ax-ext 2703  ax-sep 5229  ax-nul 5239  ax-pr 5365  ax-un 7663

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2535  df-eu 2564  df-clab 2710  df-cleq 2723  df-clel 2806  df-nfc 2881  df-ne 2929  df-ral 3048  df-rex 3057  df-rab 3396  df-v 3438  df-sbc 3737  df-dif 3900  df-un 3902  df-in 3904  df-ss 3914  df-nul 4279  df-if 4471  df-pw 4547  df-sn 4572  df-pr 4574  df-op 4578  df-uni 4855  df-br 5087  df-opab 5149  df-mpt 5168  df-id 5506  df-xp 5617  df-rel 5618  df-cnv 5619  df-co 5620  df-dm 5621  df-rn 5622  df-res 5623  df-ima 5624  df-iota 6432  df-fun 6478  df-fn 6479  df-f 6480  df-f1 6481  df-fo 6482  df-f1o 6483  df-fv 6484  df-edg 29021  df-uspgr 29123

This theorem is referenced by:  uspgrlim  48023