Users' Mathboxes Mathbox for Alexander van der Vekens < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  uspgrlimlem1 Structured version   Visualization version   GIF version

Theorem uspgrlimlem1 47928
Description: Lemma 1 for uspgrlim 47932. (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.
StepHypRef Expression
1 uspgrlimlem1.l . 2 𝐿 = {𝑥𝐽𝑥𝑀}
2 eqid 2736 . . . . . 6 (iEdg‘𝐻) = (iEdg‘𝐻)
32uspgrf1oedg 29180 . . . . 5 (𝐻 ∈ USPGraph → (iEdg‘𝐻):dom (iEdg‘𝐻)–1-1-onto→(Edg‘𝐻))
4 f1of 6846 . . . . 5 ((iEdg‘𝐻):dom (iEdg‘𝐻)–1-1-onto→(Edg‘𝐻) → (iEdg‘𝐻):dom (iEdg‘𝐻)⟶(Edg‘𝐻))
53, 4syl 17 . . . 4 (𝐻 ∈ USPGraph → (iEdg‘𝐻):dom (iEdg‘𝐻)⟶(Edg‘𝐻))
6 ssrab2 4079 . . . 4 {𝑥 ∈ dom (iEdg‘𝐻) ∣ ((iEdg‘𝐻)‘𝑥) ⊆ 𝑀} ⊆ dom (iEdg‘𝐻)
7 fimarab 6981 . . . 4 (((iEdg‘𝐻):dom (iEdg‘𝐻)⟶(Edg‘𝐻) ∧ {𝑥 ∈ dom (iEdg‘𝐻) ∣ ((iEdg‘𝐻)‘𝑥) ⊆ 𝑀} ⊆ dom (iEdg‘𝐻)) → ((iEdg‘𝐻) “ {𝑥 ∈ dom (iEdg‘𝐻) ∣ ((iEdg‘𝐻)‘𝑥) ⊆ 𝑀}) = {𝑦 ∈ (Edg‘𝐻) ∣ ∃𝑧 ∈ {𝑥 ∈ dom (iEdg‘𝐻) ∣ ((iEdg‘𝐻)‘𝑥) ⊆ 𝑀} ((iEdg‘𝐻)‘𝑧) = 𝑦})
85, 6, 7sylancl 586 . . 3 (𝐻 ∈ USPGraph → ((iEdg‘𝐻) “ {𝑥 ∈ dom (iEdg‘𝐻) ∣ ((iEdg‘𝐻)‘𝑥) ⊆ 𝑀}) = {𝑦 ∈ (Edg‘𝐻) ∣ ∃𝑧 ∈ {𝑥 ∈ dom (iEdg‘𝐻) ∣ ((iEdg‘𝐻)‘𝑥) ⊆ 𝑀} ((iEdg‘𝐻)‘𝑧) = 𝑦})
9 uspgrlimlem1.j . . . . . 6 𝐽 = (Edg‘𝐻)
109eqcomi 2745 . . . . 5 (Edg‘𝐻) = 𝐽
1110a1i 11 . . . 4 (𝐻 ∈ USPGraph → (Edg‘𝐻) = 𝐽)
12 fveq2 6904 . . . . . . 7 (𝑥 = 𝑧 → ((iEdg‘𝐻)‘𝑥) = ((iEdg‘𝐻)‘𝑧))
1312sseq1d 4014 . . . . . 6 (𝑥 = 𝑧 → (((iEdg‘𝐻)‘𝑥) ⊆ 𝑀 ↔ ((iEdg‘𝐻)‘𝑧) ⊆ 𝑀))
1413rexrab 3701 . . . . 5 (∃𝑧 ∈ {𝑥 ∈ dom (iEdg‘𝐻) ∣ ((iEdg‘𝐻)‘𝑥) ⊆ 𝑀} ((iEdg‘𝐻)‘𝑧) = 𝑦 ↔ ∃𝑧 ∈ dom (iEdg‘𝐻)(((iEdg‘𝐻)‘𝑧) ⊆ 𝑀 ∧ ((iEdg‘𝐻)‘𝑧) = 𝑦))
15 sseq1 4008 . . . . . . . 8 (((iEdg‘𝐻)‘𝑧) = 𝑦 → (((iEdg‘𝐻)‘𝑧) ⊆ 𝑀𝑦𝑀))
1615biimpac 478 . . . . . . 7 ((((iEdg‘𝐻)‘𝑧) ⊆ 𝑀 ∧ ((iEdg‘𝐻)‘𝑧) = 𝑦) → 𝑦𝑀)
1716a1i 11 . . . . . 6 (((𝐻 ∈ USPGraph ∧ 𝑦 ∈ (Edg‘𝐻)) ∧ 𝑧 ∈ dom (iEdg‘𝐻)) → ((((iEdg‘𝐻)‘𝑧) ⊆ 𝑀 ∧ ((iEdg‘𝐻)‘𝑧) = 𝑦) → 𝑦𝑀))
18 f1ocnv 6858 . . . . . . . . 9 ((iEdg‘𝐻):dom (iEdg‘𝐻)–1-1-onto→(Edg‘𝐻) → (iEdg‘𝐻):(Edg‘𝐻)–1-1-onto→dom (iEdg‘𝐻))
19 f1of 6846 . . . . . . . . 9 ((iEdg‘𝐻):(Edg‘𝐻)–1-1-onto→dom (iEdg‘𝐻) → (iEdg‘𝐻):(Edg‘𝐻)⟶dom (iEdg‘𝐻))
203, 18, 193syl 18 . . . . . . . 8 (𝐻 ∈ USPGraph → (iEdg‘𝐻):(Edg‘𝐻)⟶dom (iEdg‘𝐻))
2120ffvelcdmda 7102 . . . . . . 7 ((𝐻 ∈ USPGraph ∧ 𝑦 ∈ (Edg‘𝐻)) → ((iEdg‘𝐻)‘𝑦) ∈ dom (iEdg‘𝐻))
2221adantr 480 . . . . . 6 (((𝐻 ∈ USPGraph ∧ 𝑦 ∈ (Edg‘𝐻)) ∧ 𝑦𝑀) → ((iEdg‘𝐻)‘𝑦) ∈ dom (iEdg‘𝐻))
23 f1ocnvfv2 7295 . . . . . . . . 9 (((iEdg‘𝐻):dom (iEdg‘𝐻)–1-1-onto→(Edg‘𝐻) ∧ 𝑦 ∈ (Edg‘𝐻)) → ((iEdg‘𝐻)‘((iEdg‘𝐻)‘𝑦)) = 𝑦)
243, 23sylan 580 . . . . . . . 8 ((𝐻 ∈ USPGraph ∧ 𝑦 ∈ (Edg‘𝐻)) → ((iEdg‘𝐻)‘((iEdg‘𝐻)‘𝑦)) = 𝑦)
2524adantr 480 . . . . . . 7 (((𝐻 ∈ USPGraph ∧ 𝑦 ∈ (Edg‘𝐻)) ∧ 𝑦𝑀) → ((iEdg‘𝐻)‘((iEdg‘𝐻)‘𝑦)) = 𝑦)
26 sseq1 4008 . . . . . . . . . . 11 (𝑦 = ((iEdg‘𝐻)‘((iEdg‘𝐻)‘𝑦)) → (𝑦𝑀 ↔ ((iEdg‘𝐻)‘((iEdg‘𝐻)‘𝑦)) ⊆ 𝑀))
2726eqcoms 2744 . . . . . . . . . 10 (((iEdg‘𝐻)‘((iEdg‘𝐻)‘𝑦)) = 𝑦 → (𝑦𝑀 ↔ ((iEdg‘𝐻)‘((iEdg‘𝐻)‘𝑦)) ⊆ 𝑀))
2827biimpcd 249 . . . . . . . . 9 (𝑦𝑀 → (((iEdg‘𝐻)‘((iEdg‘𝐻)‘𝑦)) = 𝑦 → ((iEdg‘𝐻)‘((iEdg‘𝐻)‘𝑦)) ⊆ 𝑀))
2928adantl 481 . . . . . . . 8 (((𝐻 ∈ USPGraph ∧ 𝑦 ∈ (Edg‘𝐻)) ∧ 𝑦𝑀) → (((iEdg‘𝐻)‘((iEdg‘𝐻)‘𝑦)) = 𝑦 → ((iEdg‘𝐻)‘((iEdg‘𝐻)‘𝑦)) ⊆ 𝑀))
3029ancrd 551 . . . . . . 7 (((𝐻 ∈ USPGraph ∧ 𝑦 ∈ (Edg‘𝐻)) ∧ 𝑦𝑀) → (((iEdg‘𝐻)‘((iEdg‘𝐻)‘𝑦)) = 𝑦 → (((iEdg‘𝐻)‘((iEdg‘𝐻)‘𝑦)) ⊆ 𝑀 ∧ ((iEdg‘𝐻)‘((iEdg‘𝐻)‘𝑦)) = 𝑦)))
3125, 30mpd 15 . . . . . 6 (((𝐻 ∈ USPGraph ∧ 𝑦 ∈ (Edg‘𝐻)) ∧ 𝑦𝑀) → (((iEdg‘𝐻)‘((iEdg‘𝐻)‘𝑦)) ⊆ 𝑀 ∧ ((iEdg‘𝐻)‘((iEdg‘𝐻)‘𝑦)) = 𝑦))
32 fveq2 6904 . . . . . . . 8 (𝑧 = ((iEdg‘𝐻)‘𝑦) → ((iEdg‘𝐻)‘𝑧) = ((iEdg‘𝐻)‘((iEdg‘𝐻)‘𝑦)))
3332sseq1d 4014 . . . . . . 7 (𝑧 = ((iEdg‘𝐻)‘𝑦) → (((iEdg‘𝐻)‘𝑧) ⊆ 𝑀 ↔ ((iEdg‘𝐻)‘((iEdg‘𝐻)‘𝑦)) ⊆ 𝑀))
34 fveqeq2 6913 . . . . . . 7 (𝑧 = ((iEdg‘𝐻)‘𝑦) → (((iEdg‘𝐻)‘𝑧) = 𝑦 ↔ ((iEdg‘𝐻)‘((iEdg‘𝐻)‘𝑦)) = 𝑦))
3533, 34anbi12d 632 . . . . . 6 (𝑧 = ((iEdg‘𝐻)‘𝑦) → ((((iEdg‘𝐻)‘𝑧) ⊆ 𝑀 ∧ ((iEdg‘𝐻)‘𝑧) = 𝑦) ↔ (((iEdg‘𝐻)‘((iEdg‘𝐻)‘𝑦)) ⊆ 𝑀 ∧ ((iEdg‘𝐻)‘((iEdg‘𝐻)‘𝑦)) = 𝑦)))
3617, 22, 31, 35rspceb2dv 3625 . . . . 5 ((𝐻 ∈ USPGraph ∧ 𝑦 ∈ (Edg‘𝐻)) → (∃𝑧 ∈ dom (iEdg‘𝐻)(((iEdg‘𝐻)‘𝑧) ⊆ 𝑀 ∧ ((iEdg‘𝐻)‘𝑧) = 𝑦) ↔ 𝑦𝑀))
3714, 36bitrid 283 . . . 4 ((𝐻 ∈ USPGraph ∧ 𝑦 ∈ (Edg‘𝐻)) → (∃𝑧 ∈ {𝑥 ∈ dom (iEdg‘𝐻) ∣ ((iEdg‘𝐻)‘𝑥) ⊆ 𝑀} ((iEdg‘𝐻)‘𝑧) = 𝑦𝑦𝑀))
3811, 37rabeqbidva 3452 . . 3 (𝐻 ∈ USPGraph → {𝑦 ∈ (Edg‘𝐻) ∣ ∃𝑧 ∈ {𝑥 ∈ dom (iEdg‘𝐻) ∣ ((iEdg‘𝐻)‘𝑥) ⊆ 𝑀} ((iEdg‘𝐻)‘𝑧) = 𝑦} = {𝑦𝐽𝑦𝑀})
39 sseq1 4008 . . . . 5 (𝑦 = 𝑥 → (𝑦𝑀𝑥𝑀))
4039cbvrabv 3446 . . . 4 {𝑦𝐽𝑦𝑀} = {𝑥𝐽𝑥𝑀}
4140a1i 11 . . 3 (𝐻 ∈ USPGraph → {𝑦𝐽𝑦𝑀} = {𝑥𝐽𝑥𝑀})
428, 38, 413eqtrrd 2781 . 2 (𝐻 ∈ USPGraph → {𝑥𝐽𝑥𝑀} = ((iEdg‘𝐻) “ {𝑥 ∈ dom (iEdg‘𝐻) ∣ ((iEdg‘𝐻)‘𝑥) ⊆ 𝑀}))
431, 42eqtrid 2788 1 (𝐻 ∈ USPGraph → 𝐿 = ((iEdg‘𝐻) “ {𝑥 ∈ dom (iEdg‘𝐻) ∣ ((iEdg‘𝐻)‘𝑥) ⊆ 𝑀}))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395   = wceq 1540  wcel 2108  wrex 3069  {crab 3435  wss 3950  ccnv 5682  dom cdm 5683  cima 5686  wf 6555  1-1-ontowf1o 6558  cfv 6559  (class class class)co 7429  iEdgciedg 29004  Edgcedg 29054  USPGraphcuspgr 29155   ClNeighbVtx cclnbgr 47778
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2157  ax-12 2177  ax-ext 2707  ax-sep 5294  ax-nul 5304  ax-pr 5430  ax-un 7751
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2065  df-mo 2539  df-eu 2568  df-clab 2714  df-cleq 2728  df-clel 2815  df-nfc 2891  df-ne 2940  df-ral 3061  df-rex 3070  df-rab 3436  df-v 3481  df-sbc 3788  df-dif 3953  df-un 3955  df-in 3957  df-ss 3967  df-nul 4333  df-if 4525  df-pw 4600  df-sn 4625  df-pr 4627  df-op 4631  df-uni 4906  df-br 5142  df-opab 5204  df-mpt 5224  df-id 5576  df-xp 5689  df-rel 5690  df-cnv 5691  df-co 5692  df-dm 5693  df-rn 5694  df-res 5695  df-ima 5696  df-iota 6512  df-fun 6561  df-fn 6562  df-f 6563  df-f1 6564  df-fo 6565  df-f1o 6566  df-fv 6567  df-edg 29055  df-uspgr 29157
This theorem is referenced by:  uspgrlim  47932
  Copyright terms: Public domain W3C validator