Theorem uspgrlimlem1 48753

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

Hypotheses

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

Assertion

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

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

Allowed substitution hints:   𝐿(𝑥)   𝑋(𝑥)

Proof of Theorem uspgrlimlem1

Dummy variables 𝑦 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		uspgrlimlem1.l	. 2 ⊢ 𝐿 = {𝑥 ∈ 𝐽 ∣ 𝑥 ⊆ 𝑀}
2		eqid 2763	. . . . . 6 ⊢ (iEdg‘𝐻) = (iEdg‘𝐻)
3	2	uspgrf1oedg 29523	. . . . 5 ⊢ (𝐻 ∈ USPGraph → (iEdg‘𝐻):dom (iEdg‘𝐻)–1-1-onto→(Edg‘𝐻))
4		f1of 6820	. . . . 5 ⊢ ((iEdg‘𝐻):dom (iEdg‘𝐻)–1-1-onto→(Edg‘𝐻) → (iEdg‘𝐻):dom (iEdg‘𝐻)⟶(Edg‘𝐻))
5	3, 4	syl 18	. . . 4 ⊢ (𝐻 ∈ USPGraph → (iEdg‘𝐻):dom (iEdg‘𝐻)⟶(Edg‘𝐻))
6		ssrab2 4034	. . . 4 ⊢ {𝑥 ∈ dom (iEdg‘𝐻) ∣ ((iEdg‘𝐻)‘𝑥) ⊆ 𝑀} ⊆ dom (iEdg‘𝐻)
7		fimarab 6955	. . . 4 ⊢ (((iEdg‘𝐻):dom (iEdg‘𝐻)⟶(Edg‘𝐻) ∧ {𝑥 ∈ dom (iEdg‘𝐻) ∣ ((iEdg‘𝐻)‘𝑥) ⊆ 𝑀} ⊆ dom (iEdg‘𝐻)) → ((iEdg‘𝐻) “ {𝑥 ∈ dom (iEdg‘𝐻) ∣ ((iEdg‘𝐻)‘𝑥) ⊆ 𝑀}) = {𝑦 ∈ (Edg‘𝐻) ∣ ∃𝑧 ∈ {𝑥 ∈ dom (iEdg‘𝐻) ∣ ((iEdg‘𝐻)‘𝑥) ⊆ 𝑀} ((iEdg‘𝐻)‘𝑧) = 𝑦})
8	5, 6, 7	sylancl 597	. . 3 ⊢ (𝐻 ∈ USPGraph → ((iEdg‘𝐻) “ {𝑥 ∈ dom (iEdg‘𝐻) ∣ ((iEdg‘𝐻)‘𝑥) ⊆ 𝑀}) = {𝑦 ∈ (Edg‘𝐻) ∣ ∃𝑧 ∈ {𝑥 ∈ dom (iEdg‘𝐻) ∣ ((iEdg‘𝐻)‘𝑥) ⊆ 𝑀} ((iEdg‘𝐻)‘𝑧) = 𝑦})
9		uspgrlimlem1.j	. . . . . 6 ⊢ 𝐽 = (Edg‘𝐻)
10	9	eqcomi 2772	. . . . 5 ⊢ (Edg‘𝐻) = 𝐽
11	10	a1i 11	. . . 4 ⊢ (𝐻 ∈ USPGraph → (Edg‘𝐻) = 𝐽)
12		fveq2 6881	. . . . . . 7 ⊢ (𝑥 = 𝑧 → ((iEdg‘𝐻)‘𝑥) = ((iEdg‘𝐻)‘𝑧))
13	12	sseq1d 3968	. . . . . 6 ⊢ (𝑥 = 𝑧 → (((iEdg‘𝐻)‘𝑥) ⊆ 𝑀 ↔ ((iEdg‘𝐻)‘𝑧) ⊆ 𝑀))
14	13	rexrab 3659	. . . . 5 ⊢ (∃𝑧 ∈ {𝑥 ∈ dom (iEdg‘𝐻) ∣ ((iEdg‘𝐻)‘𝑥) ⊆ 𝑀} ((iEdg‘𝐻)‘𝑧) = 𝑦 ↔ ∃𝑧 ∈ dom (iEdg‘𝐻)(((iEdg‘𝐻)‘𝑧) ⊆ 𝑀 ∧ ((iEdg‘𝐻)‘𝑧) = 𝑦))
15		sseq1 3962	. . . . . . . 8 ⊢ (((iEdg‘𝐻)‘𝑧) = 𝑦 → (((iEdg‘𝐻)‘𝑧) ⊆ 𝑀 ↔ 𝑦 ⊆ 𝑀))
16	15	biimpac 483	. . . . . . 7 ⊢ ((((iEdg‘𝐻)‘𝑧) ⊆ 𝑀 ∧ ((iEdg‘𝐻)‘𝑧) = 𝑦) → 𝑦 ⊆ 𝑀)
17	16	a1i 11	. . . . . 6 ⊢ (((𝐻 ∈ USPGraph ∧ 𝑦 ∈ (Edg‘𝐻)) ∧ 𝑧 ∈ dom (iEdg‘𝐻)) → ((((iEdg‘𝐻)‘𝑧) ⊆ 𝑀 ∧ ((iEdg‘𝐻)‘𝑧) = 𝑦) → 𝑦 ⊆ 𝑀))
18		f1ocnv 6833	. . . . . . . . 9 ⊢ ((iEdg‘𝐻):dom (iEdg‘𝐻)–1-1-onto→(Edg‘𝐻) → ◡(iEdg‘𝐻):(Edg‘𝐻)–1-1-onto→dom (iEdg‘𝐻))
19		f1of 6820	. . . . . . . . 9 ⊢ (◡(iEdg‘𝐻):(Edg‘𝐻)–1-1-onto→dom (iEdg‘𝐻) → ◡(iEdg‘𝐻):(Edg‘𝐻)⟶dom (iEdg‘𝐻))
20	3, 18, 19	3syl 19	. . . . . . . 8 ⊢ (𝐻 ∈ USPGraph → ◡(iEdg‘𝐻):(Edg‘𝐻)⟶dom (iEdg‘𝐻))
21	20	ffvelcdmda 7079	. . . . . . 7 ⊢ ((𝐻 ∈ USPGraph ∧ 𝑦 ∈ (Edg‘𝐻)) → (◡(iEdg‘𝐻)‘𝑦) ∈ dom (iEdg‘𝐻))
22	21	adantr 485	. . . . . 6 ⊢ (((𝐻 ∈ USPGraph ∧ 𝑦 ∈ (Edg‘𝐻)) ∧ 𝑦 ⊆ 𝑀) → (◡(iEdg‘𝐻)‘𝑦) ∈ dom (iEdg‘𝐻))
23		f1ocnvfv2 7275	. . . . . . . . 9 ⊢ (((iEdg‘𝐻):dom (iEdg‘𝐻)–1-1-onto→(Edg‘𝐻) ∧ 𝑦 ∈ (Edg‘𝐻)) → ((iEdg‘𝐻)‘(◡(iEdg‘𝐻)‘𝑦)) = 𝑦)
24	3, 23	sylan 591	. . . . . . . 8 ⊢ ((𝐻 ∈ USPGraph ∧ 𝑦 ∈ (Edg‘𝐻)) → ((iEdg‘𝐻)‘(◡(iEdg‘𝐻)‘𝑦)) = 𝑦)
25	24	adantr 485	. . . . . . 7 ⊢ (((𝐻 ∈ USPGraph ∧ 𝑦 ∈ (Edg‘𝐻)) ∧ 𝑦 ⊆ 𝑀) → ((iEdg‘𝐻)‘(◡(iEdg‘𝐻)‘𝑦)) = 𝑦)
26		sseq1 3962	. . . . . . . . . . 11 ⊢ (𝑦 = ((iEdg‘𝐻)‘(◡(iEdg‘𝐻)‘𝑦)) → (𝑦 ⊆ 𝑀 ↔ ((iEdg‘𝐻)‘(◡(iEdg‘𝐻)‘𝑦)) ⊆ 𝑀))
27	26	eqcoms 2771	. . . . . . . . . 10 ⊢ (((iEdg‘𝐻)‘(◡(iEdg‘𝐻)‘𝑦)) = 𝑦 → (𝑦 ⊆ 𝑀 ↔ ((iEdg‘𝐻)‘(◡(iEdg‘𝐻)‘𝑦)) ⊆ 𝑀))
28	27	biimpcd 252	. . . . . . . . 9 ⊢ (𝑦 ⊆ 𝑀 → (((iEdg‘𝐻)‘(◡(iEdg‘𝐻)‘𝑦)) = 𝑦 → ((iEdg‘𝐻)‘(◡(iEdg‘𝐻)‘𝑦)) ⊆ 𝑀))
29	28	adantl 486	. . . . . . . 8 ⊢ (((𝐻 ∈ USPGraph ∧ 𝑦 ∈ (Edg‘𝐻)) ∧ 𝑦 ⊆ 𝑀) → (((iEdg‘𝐻)‘(◡(iEdg‘𝐻)‘𝑦)) = 𝑦 → ((iEdg‘𝐻)‘(◡(iEdg‘𝐻)‘𝑦)) ⊆ 𝑀))
30	29	ancrd 560	. . . . . . 7 ⊢ (((𝐻 ∈ USPGraph ∧ 𝑦 ∈ (Edg‘𝐻)) ∧ 𝑦 ⊆ 𝑀) → (((iEdg‘𝐻)‘(◡(iEdg‘𝐻)‘𝑦)) = 𝑦 → (((iEdg‘𝐻)‘(◡(iEdg‘𝐻)‘𝑦)) ⊆ 𝑀 ∧ ((iEdg‘𝐻)‘(◡(iEdg‘𝐻)‘𝑦)) = 𝑦)))
31	25, 30	mpd 16	. . . . . 6 ⊢ (((𝐻 ∈ USPGraph ∧ 𝑦 ∈ (Edg‘𝐻)) ∧ 𝑦 ⊆ 𝑀) → (((iEdg‘𝐻)‘(◡(iEdg‘𝐻)‘𝑦)) ⊆ 𝑀 ∧ ((iEdg‘𝐻)‘(◡(iEdg‘𝐻)‘𝑦)) = 𝑦))
32		fveq2 6881	. . . . . . . 8 ⊢ (𝑧 = (◡(iEdg‘𝐻)‘𝑦) → ((iEdg‘𝐻)‘𝑧) = ((iEdg‘𝐻)‘(◡(iEdg‘𝐻)‘𝑦)))
33	32	sseq1d 3968	. . . . . . 7 ⊢ (𝑧 = (◡(iEdg‘𝐻)‘𝑦) → (((iEdg‘𝐻)‘𝑧) ⊆ 𝑀 ↔ ((iEdg‘𝐻)‘(◡(iEdg‘𝐻)‘𝑦)) ⊆ 𝑀))
34		fveqeq2 6890	. . . . . . 7 ⊢ (𝑧 = (◡(iEdg‘𝐻)‘𝑦) → (((iEdg‘𝐻)‘𝑧) = 𝑦 ↔ ((iEdg‘𝐻)‘(◡(iEdg‘𝐻)‘𝑦)) = 𝑦))
35	33, 34	anbi12d 643	. . . . . 6 ⊢ (𝑧 = (◡(iEdg‘𝐻)‘𝑦) → ((((iEdg‘𝐻)‘𝑧) ⊆ 𝑀 ∧ ((iEdg‘𝐻)‘𝑧) = 𝑦) ↔ (((iEdg‘𝐻)‘(◡(iEdg‘𝐻)‘𝑦)) ⊆ 𝑀 ∧ ((iEdg‘𝐻)‘(◡(iEdg‘𝐻)‘𝑦)) = 𝑦)))
36	17, 22, 31, 35	rspceb2dv 3585	. . . . 5 ⊢ ((𝐻 ∈ USPGraph ∧ 𝑦 ∈ (Edg‘𝐻)) → (∃𝑧 ∈ dom (iEdg‘𝐻)(((iEdg‘𝐻)‘𝑧) ⊆ 𝑀 ∧ ((iEdg‘𝐻)‘𝑧) = 𝑦) ↔ 𝑦 ⊆ 𝑀))
37	14, 36	bitrid 286	. . . 4 ⊢ ((𝐻 ∈ USPGraph ∧ 𝑦 ∈ (Edg‘𝐻)) → (∃𝑧 ∈ {𝑥 ∈ dom (iEdg‘𝐻) ∣ ((iEdg‘𝐻)‘𝑥) ⊆ 𝑀} ((iEdg‘𝐻)‘𝑧) = 𝑦 ↔ 𝑦 ⊆ 𝑀))
38	11, 37	rabeqbidva 3432	. . 3 ⊢ (𝐻 ∈ USPGraph → {𝑦 ∈ (Edg‘𝐻) ∣ ∃𝑧 ∈ {𝑥 ∈ dom (iEdg‘𝐻) ∣ ((iEdg‘𝐻)‘𝑥) ⊆ 𝑀} ((iEdg‘𝐻)‘𝑧) = 𝑦} = {𝑦 ∈ 𝐽 ∣ 𝑦 ⊆ 𝑀})
39		sseq1 3962	. . . . 5 ⊢ (𝑦 = 𝑥 → (𝑦 ⊆ 𝑀 ↔ 𝑥 ⊆ 𝑀))
40	39	cbvrabv 3426	. . . 4 ⊢ {𝑦 ∈ 𝐽 ∣ 𝑦 ⊆ 𝑀} = {𝑥 ∈ 𝐽 ∣ 𝑥 ⊆ 𝑀}
41	40	a1i 11	. . 3 ⊢ (𝐻 ∈ USPGraph → {𝑦 ∈ 𝐽 ∣ 𝑦 ⊆ 𝑀} = {𝑥 ∈ 𝐽 ∣ 𝑥 ⊆ 𝑀})
42	8, 38, 41	3eqtrrd 2803	. 2 ⊢ (𝐻 ∈ USPGraph → {𝑥 ∈ 𝐽 ∣ 𝑥 ⊆ 𝑀} = ((iEdg‘𝐻) “ {𝑥 ∈ dom (iEdg‘𝐻) ∣ ((iEdg‘𝐻)‘𝑥) ⊆ 𝑀}))
43	1, 42	eqtrid 2810	1 ⊢ (𝐻 ∈ USPGraph → 𝐿 = ((iEdg‘𝐻) “ {𝑥 ∈ dom (iEdg‘𝐻) ∣ ((iEdg‘𝐻)‘𝑥) ⊆ 𝑀}))

Syntax hints:   → wi 4   ↔ wb 209   ∧ wa 400   = wceq 1570   ∈ wcel 2143  ∃wrex 3089  {crab 3416   ⊆ wss 3905  ^◡ccnv 5660  dom cdm 5661   “ cima 5664  ⟶wf 6532  –1-1-onto→wf1o 6535  ‘cfv 6536  (class class class)co 7410  iEdgciedg 29347  Edgcedg 29397  USPGraphcuspgr 29498   ClNeighbVtx cclnbgr 48583

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-10 2176  ax-11 2192  ax-12 2213  ax-ext 2735  ax-sep 5257  ax-nul 5269  ax-pr 5404  ax-un 7732

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-nf 1814  df-sb 2097  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2838  df-nfc 2912  df-ne 2959  df-ral 3080  df-rex 3090  df-rab 3417  df-v 3457  df-sbc 3745  df-dif 3908  df-un 3910  df-in 3912  df-ss 3922  df-nul 4287  df-if 4488  df-pw 4564  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4873  df-br 5110  df-opab 5174  df-mpt 5193  df-id 5556  df-xp 5667  df-rel 5668  df-cnv 5669  df-co 5670  df-dm 5671  df-rn 5672  df-res 5673  df-ima 5674  df-iota 6492  df-fun 6538  df-fn 6539  df-f 6540  df-f1 6541  df-fo 6542  df-f1o 6543  df-fv 6544  df-edg 29398  df-uspgr 29500

This theorem is referenced by:  uspgrlim  48757