Theorem uspgrlimlem2 49360

Description: Lemma 2 for uspgrlim 49363. (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 2763	. . . . 5 ⊢ (iEdg‘𝐻) = (iEdg‘𝐻)
2	1	uspgrf1oedg 29811	. . . 4 ⊢ (𝐻 ∈ USPGraph → (iEdg‘𝐻):dom (iEdg‘𝐻)⟶1-1onto(Edg‘𝐻))
3		f1ocnv 6867	. . . 4 ⊢ ((iEdg‘𝐻):dom (iEdg‘𝐻)⟶1-1onto(Edg‘𝐻) → ◡(iEdg‘𝐻):(Edg‘𝐻)⟶1-1ontodom (iEdg‘𝐻))
4		f1of 6854	. . . 4 ⊢ (◡(iEdg‘𝐻):(Edg‘𝐻)⟶1-1ontodom (iEdg‘𝐻) → ◡(iEdg‘𝐻):(Edg‘𝐻)⟶dom (iEdg‘𝐻))
5	2, 3, 4	3syl 19	. . 3 ⊢ (𝐻 ∈ USPGraph → ◡(iEdg‘𝐻):(Edg‘𝐻)⟶dom (iEdg‘𝐻))
6		uspgrlimlem1.l	. . . . 5 ⊢ 𝐿 = {𝑥 ∈ 𝐽 ∣ 𝑥 ⊆ 𝑀}
7		uspgrlimlem1.j	. . . . . 6 ⊢ 𝐽 = (Edg‘𝐻)
8	7	rabeqi 3429	. . . . 5 ⊢ {𝑥 ∈ 𝐽 ∣ 𝑥 ⊆ 𝑀} = {𝑥 ∈ (Edg‘𝐻) ∣ 𝑥 ⊆ 𝑀}
9	6, 8	eqtri 2786	. . . 4 ⊢ 𝐿 = {𝑥 ∈ (Edg‘𝐻) ∣ 𝑥 ⊆ 𝑀}
10	9	ssrab3 4010	. . 3 ⊢ 𝐿 ⊆ (Edg‘𝐻)
11		fimarab 6990	. . 3 ⊢ ((◡(iEdg‘𝐻):(Edg‘𝐻)⟶dom (iEdg‘𝐻) ∧ 𝐿 ⊆ (Edg‘𝐻)) → (◡(iEdg‘𝐻) “ 𝐿) = {𝑥 ∈ dom (iEdg‘𝐻) ∣ ∃𝑦 ∈ 𝐿 (◡(iEdg‘𝐻)‘𝑦) = 𝑥})
12	5, 10, 11	sylancl 598	. 2 ⊢ (𝐻 ∈ USPGraph → (◡(iEdg‘𝐻) “ 𝐿) = {𝑥 ∈ dom (iEdg‘𝐻) ∣ ∃𝑦 ∈ 𝐿 (◡(iEdg‘𝐻)‘𝑦) = 𝑥})
13		sseq1 3938	. . . . . . 7 ⊢ (𝑥 = 𝑦 → (𝑥 ⊆ 𝑀 ↔ 𝑦 ⊆ 𝑀))
14	13, 6	elrab2 3652	. . . . . 6 ⊢ (𝑦 ∈ 𝐿 ↔ (𝑦 ∈ 𝐽 ∧ 𝑦 ⊆ 𝑀))
15	7	eleq2i 2856	. . . . . . . . . . . . . . . . 17 ⊢ (𝑦 ∈ 𝐽 ↔ 𝑦 ∈ (Edg‘𝐻))
16	15	biimpi 219	. . . . . . . . . . . . . . . 16 ⊢ (𝑦 ∈ 𝐽 → 𝑦 ∈ (Edg‘𝐻))
17		f1ocnvfv2 7316	. . . . . . . . . . . . . . . 16 ⊢ (((iEdg‘𝐻):dom (iEdg‘𝐻)⟶1-1onto(Edg‘𝐻) ∧ 𝑦 ∈ (Edg‘𝐻)) → ((iEdg‘𝐻)‘(◡(iEdg‘𝐻)‘𝑦)) = 𝑦)
18	2, 16, 17	syl2an 608	. . . . . . . . . . . . . . 15 ⊢ ((𝐻 ∈ USPGraph ∧ 𝑦 ∈ 𝐽) → ((iEdg‘𝐻)‘(◡(iEdg‘𝐻)‘𝑦)) = 𝑦)
19	18	eqcomd 2769	. . . . . . . . . . . . . 14 ⊢ ((𝐻 ∈ USPGraph ∧ 𝑦 ∈ 𝐽) → 𝑦 = ((iEdg‘𝐻)‘(◡(iEdg‘𝐻)‘𝑦)))
20	19	sseq1d 3944	. . . . . . . . . . . . 13 ⊢ ((𝐻 ∈ USPGraph ∧ 𝑦 ∈ 𝐽) → (𝑦 ⊆ 𝑀 ↔ ((iEdg‘𝐻)‘(◡(iEdg‘𝐻)‘𝑦)) ⊆ 𝑀))
21	20	biimpd 232	. . . . . . . . . . . 12 ⊢ ((𝐻 ∈ USPGraph ∧ 𝑦 ∈ 𝐽) → (𝑦 ⊆ 𝑀 → ((iEdg‘𝐻)‘(◡(iEdg‘𝐻)‘𝑦)) ⊆ 𝑀))
22	21	ex 418	. . . . . . . . . . 11 ⊢ (𝐻 ∈ USPGraph → (𝑦 ∈ 𝐽 → (𝑦 ⊆ 𝑀 → ((iEdg‘𝐻)‘(◡(iEdg‘𝐻)‘𝑦)) ⊆ 𝑀)))
23	22	adantr 486	. . . . . . . . . 10 ⊢ ((𝐻 ∈ USPGraph ∧ 𝑥 ∈ dom (iEdg‘𝐻)) → (𝑦 ∈ 𝐽 → (𝑦 ⊆ 𝑀 → ((iEdg‘𝐻)‘(◡(iEdg‘𝐻)‘𝑦)) ⊆ 𝑀)))
24	23	imp32 424	. . . . . . . . 9 ⊢ (((𝐻 ∈ USPGraph ∧ 𝑥 ∈ dom (iEdg‘𝐻)) ∧ (𝑦 ∈ 𝐽 ∧ 𝑦 ⊆ 𝑀)) → ((iEdg‘𝐻)‘(◡(iEdg‘𝐻)‘𝑦)) ⊆ 𝑀)
25	24	3adant3 1150	. . . . . . . 8 ⊢ (((𝐻 ∈ USPGraph ∧ 𝑥 ∈ dom (iEdg‘𝐻)) ∧ (𝑦 ∈ 𝐽 ∧ 𝑦 ⊆ 𝑀) ∧ (◡(iEdg‘𝐻)‘𝑦) = 𝑥) → ((iEdg‘𝐻)‘(◡(iEdg‘𝐻)‘𝑦)) ⊆ 𝑀)
26		fveq2 6916	. . . . . . . . . 10 ⊢ ((◡(iEdg‘𝐻)‘𝑦) = 𝑥 → ((iEdg‘𝐻)‘(◡(iEdg‘𝐻)‘𝑦)) = ((iEdg‘𝐻)‘𝑥))
27	26	sseq1d 3944	. . . . . . . . 9 ⊢ ((◡(iEdg‘𝐻)‘𝑦) = 𝑥 → (((iEdg‘𝐻)‘(◡(iEdg‘𝐻)‘𝑦)) ⊆ 𝑀 ↔ ((iEdg‘𝐻)‘𝑥) ⊆ 𝑀))
28	27	3ad2ant3 1153	. . . . . . . 8 ⊢ (((𝐻 ∈ USPGraph ∧ 𝑥 ∈ dom (iEdg‘𝐻)) ∧ (𝑦 ∈ 𝐽 ∧ 𝑦 ⊆ 𝑀) ∧ (◡(iEdg‘𝐻)‘𝑦) = 𝑥) → (((iEdg‘𝐻)‘(◡(iEdg‘𝐻)‘𝑦)) ⊆ 𝑀 ↔ ((iEdg‘𝐻)‘𝑥) ⊆ 𝑀))
29	25, 28	mpbid 235	. . . . . . 7 ⊢ (((𝐻 ∈ USPGraph ∧ 𝑥 ∈ dom (iEdg‘𝐻)) ∧ (𝑦 ∈ 𝐽 ∧ 𝑦 ⊆ 𝑀) ∧ (◡(iEdg‘𝐻)‘𝑦) = 𝑥) → ((iEdg‘𝐻)‘𝑥) ⊆ 𝑀)
30	29	3exp 1137	. . . . . 6 ⊢ ((𝐻 ∈ USPGraph ∧ 𝑥 ∈ dom (iEdg‘𝐻)) → ((𝑦 ∈ 𝐽 ∧ 𝑦 ⊆ 𝑀) → ((◡(iEdg‘𝐻)‘𝑦) = 𝑥 → ((iEdg‘𝐻)‘𝑥) ⊆ 𝑀)))
31	14, 30	biimtrid 245	. . . . 5 ⊢ ((𝐻 ∈ USPGraph ∧ 𝑥 ∈ dom (iEdg‘𝐻)) → (𝑦 ∈ 𝐿 → ((◡(iEdg‘𝐻)‘𝑦) = 𝑥 → ((iEdg‘𝐻)‘𝑥) ⊆ 𝑀)))
32	31	rexlimdv 3165	. . . 4 ⊢ ((𝐻 ∈ USPGraph ∧ 𝑥 ∈ dom (iEdg‘𝐻)) → (∃𝑦 ∈ 𝐿 (◡(iEdg‘𝐻)‘𝑦) = 𝑥 → ((iEdg‘𝐻)‘𝑥) ⊆ 𝑀))
33		fveqeq2 6925	. . . . . 6 ⊢ (𝑦 = ((iEdg‘𝐻)‘𝑥) → ((◡(iEdg‘𝐻)‘𝑦) = 𝑥 ↔ (◡(iEdg‘𝐻)‘((iEdg‘𝐻)‘𝑥)) = 𝑥))
34		f1of 6854	. . . . . . . . . 10 ⊢ ((iEdg‘𝐻):dom (iEdg‘𝐻)⟶1-1onto(Edg‘𝐻) → (iEdg‘𝐻):dom (iEdg‘𝐻)⟶(Edg‘𝐻))
35		eqid 2763	. . . . . . . . . . . 12 ⊢ dom (iEdg‘𝐻) = dom (iEdg‘𝐻)
36	7	eqcomi 2772	. . . . . . . . . . . 12 ⊢ (Edg‘𝐻) = 𝐽
37	35, 36	feq23i 6733	. . . . . . . . . . 11 ⊢ ((iEdg‘𝐻):dom (iEdg‘𝐻)⟶(Edg‘𝐻) ↔ (iEdg‘𝐻):dom (iEdg‘𝐻)⟶𝐽)
38	37	biimpi 219	. . . . . . . . . 10 ⊢ ((iEdg‘𝐻):dom (iEdg‘𝐻)⟶(Edg‘𝐻) → (iEdg‘𝐻):dom (iEdg‘𝐻)⟶𝐽)
39	2, 34, 38	3syl 19	. . . . . . . . 9 ⊢ (𝐻 ∈ USPGraph → (iEdg‘𝐻):dom (iEdg‘𝐻)⟶𝐽)
40	39	ffvelcdmda 7116	. . . . . . . 8 ⊢ ((𝐻 ∈ USPGraph ∧ 𝑥 ∈ dom (iEdg‘𝐻)) → ((iEdg‘𝐻)‘𝑥) ∈ 𝐽)
41	40	anim1i 627	. . . . . . 7 ⊢ (((𝐻 ∈ USPGraph ∧ 𝑥 ∈ dom (iEdg‘𝐻)) ∧ ((iEdg‘𝐻)‘𝑥) ⊆ 𝑀) → (((iEdg‘𝐻)‘𝑥) ∈ 𝐽 ∧ ((iEdg‘𝐻)‘𝑥) ⊆ 𝑀))
42		sseq1 3938	. . . . . . . 8 ⊢ (𝑦 = ((iEdg‘𝐻)‘𝑥) → (𝑦 ⊆ 𝑀 ↔ ((iEdg‘𝐻)‘𝑥) ⊆ 𝑀))
43	13, 42, 6	elrab2w 3653	. . . . . . 7 ⊢ (((iEdg‘𝐻)‘𝑥) ∈ 𝐿 ↔ (((iEdg‘𝐻)‘𝑥) ∈ 𝐽 ∧ ((iEdg‘𝐻)‘𝑥) ⊆ 𝑀))
44	41, 43	sylibr 237	. . . . . 6 ⊢ (((𝐻 ∈ USPGraph ∧ 𝑥 ∈ dom (iEdg‘𝐻)) ∧ ((iEdg‘𝐻)‘𝑥) ⊆ 𝑀) → ((iEdg‘𝐻)‘𝑥) ∈ 𝐿)
45		f1ocnvfv1 7315	. . . . . . . 8 ⊢ (((iEdg‘𝐻):dom (iEdg‘𝐻)⟶1-1onto(Edg‘𝐻) ∧ 𝑥 ∈ dom (iEdg‘𝐻)) → (◡(iEdg‘𝐻)‘((iEdg‘𝐻)‘𝑥)) = 𝑥)
46	2, 45	sylan 592	. . . . . . 7 ⊢ ((𝐻 ∈ USPGraph ∧ 𝑥 ∈ dom (iEdg‘𝐻)) → (◡(iEdg‘𝐻)‘((iEdg‘𝐻)‘𝑥)) = 𝑥)
47	46	adantr 486	. . . . . 6 ⊢ (((𝐻 ∈ USPGraph ∧ 𝑥 ∈ dom (iEdg‘𝐻)) ∧ ((iEdg‘𝐻)‘𝑥) ⊆ 𝑀) → (◡(iEdg‘𝐻)‘((iEdg‘𝐻)‘𝑥)) = 𝑥)
48	33, 44, 47	rspcedvdw 3583	. . . . 5 ⊢ (((𝐻 ∈ USPGraph ∧ 𝑥 ∈ dom (iEdg‘𝐻)) ∧ ((iEdg‘𝐻)‘𝑥) ⊆ 𝑀) → ∃𝑦 ∈ 𝐿 (◡(iEdg‘𝐻)‘𝑦) = 𝑥)
49	48	ex 418	. . . 4 ⊢ ((𝐻 ∈ USPGraph ∧ 𝑥 ∈ dom (iEdg‘𝐻)) → (((iEdg‘𝐻)‘𝑥) ⊆ 𝑀 → ∃𝑦 ∈ 𝐿 (◡(iEdg‘𝐻)‘𝑦) = 𝑥))
50	32, 49	impbid 215	. . 3 ⊢ ((𝐻 ∈ USPGraph ∧ 𝑥 ∈ dom (iEdg‘𝐻)) → (∃𝑦 ∈ 𝐿 (◡(iEdg‘𝐻)‘𝑦) = 𝑥 ↔ ((iEdg‘𝐻)‘𝑥) ⊆ 𝑀))
51	50	rabbidva 3422	. 2 ⊢ (𝐻 ∈ USPGraph → {𝑥 ∈ dom (iEdg‘𝐻) ∣ ∃𝑦 ∈ 𝐿 (◡(iEdg‘𝐻)‘𝑦) = 𝑥} = {𝑥 ∈ dom (iEdg‘𝐻) ∣ ((iEdg‘𝐻)‘𝑥) ⊆ 𝑀})
52	12, 51	eqtrd 2798	1 ⊢ (𝐻 ∈ USPGraph → (◡(iEdg‘𝐻) “ 𝐿) = {𝑥 ∈ dom (iEdg‘𝐻) ∣ ((iEdg‘𝐻)‘𝑥) ⊆ 𝑀})

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2147  ∃wrex 3090  {crab 3416   ⊆ wss 3900  ^◡ccnv 5657  dom cdm 5658   “ cima 5661  ⟶wf 6562  ⟶1-1ontowf1o 6565  ‘cfv 6566  (class class class)co 7451  iEdgciedg 29632  Edgcedg 29682  USPGraphcuspgr 29786   ClNeighbVtx cclnbgr 49189

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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5255  ax-nul 5266  ax-pr 5398  ax-un 7783

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 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-sbc 3743  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-br 5109  df-opab 5174  df-mpt 5193  df-id 5553  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-f1 6571  df-fo 6572  df-f1o 6573  df-fv 6574  df-edg 29683  df-uspgr 29788

This theorem is used by:  uspgrlim  49363