| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > uspgredg2vlem | Structured version Visualization version GIF version | ||
| Description: Lemma for uspgredg2v 29515. (Contributed by Alexander van der Vekens, 4-Jan-2018.) (Revised by AV, 6-Dec-2020.) |
| Ref | Expression |
|---|---|
| uspgredg2v.v | ⊢ 𝑉 = (Vtx‘𝐺) |
| uspgredg2v.e | ⊢ 𝐸 = (Edg‘𝐺) |
| uspgredg2v.a | ⊢ 𝐴 = {𝑒 ∈ 𝐸 ∣ 𝑁 ∈ 𝑒} |
| Ref | Expression |
|---|---|
| uspgredg2vlem | ⊢ ((𝐺 ∈ USPGraph ∧ 𝑌 ∈ 𝐴) → (℩𝑧 ∈ 𝑉 𝑌 = {𝑁, 𝑧}) ∈ 𝑉) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eleq2 2858 | . . 3 ⊢ (𝑒 = 𝑌 → (𝑁 ∈ 𝑒 ↔ 𝑁 ∈ 𝑌)) | |
| 2 | uspgredg2v.a | . . 3 ⊢ 𝐴 = {𝑒 ∈ 𝐸 ∣ 𝑁 ∈ 𝑒} | |
| 3 | 1, 2 | elrab2 3663 | . 2 ⊢ (𝑌 ∈ 𝐴 ↔ (𝑌 ∈ 𝐸 ∧ 𝑁 ∈ 𝑌)) |
| 4 | simpl 487 | . . . 4 ⊢ ((𝐺 ∈ USPGraph ∧ (𝑌 ∈ 𝐸 ∧ 𝑁 ∈ 𝑌)) → 𝐺 ∈ USPGraph) | |
| 5 | uspgredg2v.e | . . . . . . 7 ⊢ 𝐸 = (Edg‘𝐺) | |
| 6 | 5 | eleq2i 2861 | . . . . . 6 ⊢ (𝑌 ∈ 𝐸 ↔ 𝑌 ∈ (Edg‘𝐺)) |
| 7 | 6 | biimpi 219 | . . . . 5 ⊢ (𝑌 ∈ 𝐸 → 𝑌 ∈ (Edg‘𝐺)) |
| 8 | 7 | ad2antrl 740 | . . . 4 ⊢ ((𝐺 ∈ USPGraph ∧ (𝑌 ∈ 𝐸 ∧ 𝑁 ∈ 𝑌)) → 𝑌 ∈ (Edg‘𝐺)) |
| 9 | simprr 784 | . . . 4 ⊢ ((𝐺 ∈ USPGraph ∧ (𝑌 ∈ 𝐸 ∧ 𝑁 ∈ 𝑌)) → 𝑁 ∈ 𝑌) | |
| 10 | 4, 8, 9 | 3jca 1144 | . . 3 ⊢ ((𝐺 ∈ USPGraph ∧ (𝑌 ∈ 𝐸 ∧ 𝑁 ∈ 𝑌)) → (𝐺 ∈ USPGraph ∧ 𝑌 ∈ (Edg‘𝐺) ∧ 𝑁 ∈ 𝑌)) |
| 11 | uspgredg2vtxeu 29511 | . . . 4 ⊢ ((𝐺 ∈ USPGraph ∧ 𝑌 ∈ (Edg‘𝐺) ∧ 𝑁 ∈ 𝑌) → ∃!𝑧 ∈ (Vtx‘𝐺)𝑌 = {𝑁, 𝑧}) | |
| 12 | uspgredg2v.v | . . . . 5 ⊢ 𝑉 = (Vtx‘𝐺) | |
| 13 | reueq1 3408 | . . . . 5 ⊢ (𝑉 = (Vtx‘𝐺) → (∃!𝑧 ∈ 𝑉 𝑌 = {𝑁, 𝑧} ↔ ∃!𝑧 ∈ (Vtx‘𝐺)𝑌 = {𝑁, 𝑧})) | |
| 14 | 12, 13 | ax-mp 5 | . . . 4 ⊢ (∃!𝑧 ∈ 𝑉 𝑌 = {𝑁, 𝑧} ↔ ∃!𝑧 ∈ (Vtx‘𝐺)𝑌 = {𝑁, 𝑧}) |
| 15 | 11, 14 | sylibr 237 | . . 3 ⊢ ((𝐺 ∈ USPGraph ∧ 𝑌 ∈ (Edg‘𝐺) ∧ 𝑁 ∈ 𝑌) → ∃!𝑧 ∈ 𝑉 𝑌 = {𝑁, 𝑧}) |
| 16 | riotacl 7385 | . . 3 ⊢ (∃!𝑧 ∈ 𝑉 𝑌 = {𝑁, 𝑧} → (℩𝑧 ∈ 𝑉 𝑌 = {𝑁, 𝑧}) ∈ 𝑉) | |
| 17 | 10, 15, 16 | 3syl 19 | . 2 ⊢ ((𝐺 ∈ USPGraph ∧ (𝑌 ∈ 𝐸 ∧ 𝑁 ∈ 𝑌)) → (℩𝑧 ∈ 𝑉 𝑌 = {𝑁, 𝑧}) ∈ 𝑉) |
| 18 | 3, 17 | sylan2b 605 | 1 ⊢ ((𝐺 ∈ USPGraph ∧ 𝑌 ∈ 𝐴) → (℩𝑧 ∈ 𝑉 𝑌 = {𝑁, 𝑧}) ∈ 𝑉) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 209 ∧ wa 400 ∧ w3a 1101 = wceq 1567 ∈ wcel 2149 ∃!wreu 3374 {crab 3423 {cpr 4596 ‘cfv 6537 ℩crio 7367 Vtxcvtx 29287 Edgcedg 29338 USPGraphcuspgr 29439 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1822 ax-4 1836 ax-5 1937 ax-6 1994 ax-7 2035 ax-8 2151 ax-9 2159 ax-10 2182 ax-11 2198 ax-12 2219 ax-ext 2741 ax-sep 5261 ax-nul 5271 ax-pow 5337 ax-pr 5405 ax-un 7733 ax-cnex 11156 ax-resscn 11157 ax-1cn 11158 ax-icn 11159 ax-addcl 11160 ax-addrcl 11161 ax-mulcl 11162 ax-mulrcl 11163 ax-mulcom 11164 ax-addass 11165 ax-mulass 11166 ax-distr 11167 ax-i2m1 11168 ax-1ne0 11169 ax-1rid 11170 ax-rnegex 11171 ax-rrecex 11172 ax-cnre 11173 ax-pre-lttri 11174 ax-pre-lttrn 11175 ax-pre-ltadd 11176 ax-pre-mulgt0 11177 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1102 df-3an 1103 df-tru 1570 df-fal 1580 df-ex 1807 df-nf 1811 df-sb 2098 df-mo 2573 df-eu 2603 df-clab 2748 df-cleq 2761 df-clel 2844 df-nfc 2918 df-ne 2965 df-nel 3071 df-ral 3086 df-rex 3096 df-rmo 3376 df-reu 3377 df-rab 3424 df-v 3465 df-sbc 3754 df-csb 3862 df-dif 3916 df-un 3918 df-in 3920 df-ss 3930 df-pss 3933 df-nul 4295 df-if 4493 df-pw 4569 df-sn 4595 df-pr 4597 df-op 4601 df-uni 4877 df-int 4917 df-iun 4962 df-br 5114 df-opab 5178 df-mpt 5197 df-tr 5223 df-id 5557 df-eprel 5562 df-po 5570 df-so 5571 df-fr 5615 df-we 5617 df-xp 5668 df-rel 5669 df-cnv 5670 df-co 5671 df-dm 5672 df-rn 5673 df-res 5674 df-ima 5675 df-pred 6303 df-ord 6364 df-on 6365 df-lim 6366 df-suc 6367 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-fv 6545 df-riota 7368 df-ov 7414 df-oprab 7415 df-mpo 7416 df-om 7863 df-1st 7986 df-2nd 7987 df-frecs 8278 df-wrecs 8309 df-recs 8358 df-rdg 8397 df-1o 8453 df-2o 8454 df-oadd 8457 df-er 8694 df-en 8944 df-dom 8945 df-sdom 8946 df-fin 8947 df-dju 9887 df-card 9925 df-pnf 11245 df-mnf 11246 df-xr 11247 df-ltxr 11248 df-le 11249 df-sub 11443 df-neg 11444 df-nn 12234 df-2 12303 df-n0 12505 df-xnn0 12578 df-z 12592 df-uz 12863 df-fz 13536 df-hash 14367 df-edg 29339 df-upgr 29373 df-uspgr 29441 |
| This theorem is referenced by: uspgredg2v 29515 |
| Copyright terms: Public domain | W3C validator |