| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > uspgredg2vlem | GIF version | ||
| Description: Lemma for uspgredg2v 16445. (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 2302 | . . 3 ⊢ (𝑒 = 𝑌 → (𝑁 ∈ 𝑒 ↔ 𝑁 ∈ 𝑌)) | |
| 2 | uspgredg2v.a | . . 3 ⊢ 𝐴 = {𝑒 ∈ 𝐸 ∣ 𝑁 ∈ 𝑒} | |
| 3 | 1, 2 | elrab2 2985 | . 2 ⊢ (𝑌 ∈ 𝐴 ↔ (𝑌 ∈ 𝐸 ∧ 𝑁 ∈ 𝑌)) |
| 4 | simpl 109 | . . . 4 ⊢ ((𝐺 ∈ USPGraph ∧ (𝑌 ∈ 𝐸 ∧ 𝑁 ∈ 𝑌)) → 𝐺 ∈ USPGraph) | |
| 5 | uspgredg2v.e | . . . . . . 7 ⊢ 𝐸 = (Edg‘𝐺) | |
| 6 | 5 | eleq2i 2305 | . . . . . 6 ⊢ (𝑌 ∈ 𝐸 ↔ 𝑌 ∈ (Edg‘𝐺)) |
| 7 | 6 | biimpi 120 | . . . . 5 ⊢ (𝑌 ∈ 𝐸 → 𝑌 ∈ (Edg‘𝐺)) |
| 8 | 7 | ad2antrl 494 | . . . 4 ⊢ ((𝐺 ∈ USPGraph ∧ (𝑌 ∈ 𝐸 ∧ 𝑁 ∈ 𝑌)) → 𝑌 ∈ (Edg‘𝐺)) |
| 9 | simprr 537 | . . . 4 ⊢ ((𝐺 ∈ USPGraph ∧ (𝑌 ∈ 𝐸 ∧ 𝑁 ∈ 𝑌)) → 𝑁 ∈ 𝑌) | |
| 10 | 4, 8, 9 | 3jca 1208 | . . 3 ⊢ ((𝐺 ∈ USPGraph ∧ (𝑌 ∈ 𝐸 ∧ 𝑁 ∈ 𝑌)) → (𝐺 ∈ USPGraph ∧ 𝑌 ∈ (Edg‘𝐺) ∧ 𝑁 ∈ 𝑌)) |
| 11 | uspgredg2vtxeu 16442 | . . . 4 ⊢ ((𝐺 ∈ USPGraph ∧ 𝑌 ∈ (Edg‘𝐺) ∧ 𝑁 ∈ 𝑌) → ∃!𝑧 ∈ (Vtx‘𝐺)𝑌 = {𝑁, 𝑧}) | |
| 12 | uspgredg2v.v | . . . . 5 ⊢ 𝑉 = (Vtx‘𝐺) | |
| 13 | reueq1 2751 | . . . . 5 ⊢ (𝑉 = (Vtx‘𝐺) → (∃!𝑧 ∈ 𝑉 𝑌 = {𝑁, 𝑧} ↔ ∃!𝑧 ∈ (Vtx‘𝐺)𝑌 = {𝑁, 𝑧})) | |
| 14 | 12, 13 | ax-mp 5 | . . . 4 ⊢ (∃!𝑧 ∈ 𝑉 𝑌 = {𝑁, 𝑧} ↔ ∃!𝑧 ∈ (Vtx‘𝐺)𝑌 = {𝑁, 𝑧}) |
| 15 | 11, 14 | sylibr 134 | . . 3 ⊢ ((𝐺 ∈ USPGraph ∧ 𝑌 ∈ (Edg‘𝐺) ∧ 𝑁 ∈ 𝑌) → ∃!𝑧 ∈ 𝑉 𝑌 = {𝑁, 𝑧}) |
| 16 | riotacl 6048 | . . 3 ⊢ (∃!𝑧 ∈ 𝑉 𝑌 = {𝑁, 𝑧} → (℩𝑧 ∈ 𝑉 𝑌 = {𝑁, 𝑧}) ∈ 𝑉) | |
| 17 | 10, 15, 16 | 3syl 17 | . 2 ⊢ ((𝐺 ∈ USPGraph ∧ (𝑌 ∈ 𝐸 ∧ 𝑁 ∈ 𝑌)) → (℩𝑧 ∈ 𝑉 𝑌 = {𝑁, 𝑧}) ∈ 𝑉) |
| 18 | 3, 17 | sylan2b 287 | 1 ⊢ ((𝐺 ∈ USPGraph ∧ 𝑌 ∈ 𝐴) → (℩𝑧 ∈ 𝑉 𝑌 = {𝑁, 𝑧}) ∈ 𝑉) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ↔ wb 105 ∧ w3a 1009 = wceq 1402 ∈ wcel 2209 ∃!wreu 2530 {crab 2532 {cpr 3709 ‘cfv 5375 ℩crio 6031 Vtxcvtx 16236 Edgcedg 16281 USPGraphcuspgr 16377 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 623 ax-in2 624 ax-io 721 ax-5 1500 ax-7 1501 ax-gen 1502 ax-ie1 1546 ax-ie2 1547 ax-8 1557 ax-10 1558 ax-11 1559 ax-i12 1560 ax-bndl 1562 ax-4 1563 ax-17 1579 ax-i9 1583 ax-ial 1587 ax-i5r 1588 ax-14 2212 ax-ext 2220 ax-sep 4247 ax-nul 4257 ax-pow 4309 ax-pr 4344 ax-un 4576 ax-setind 4682 ax-cnex 8264 ax-resscn 8265 ax-1cn 8266 ax-1re 8267 ax-icn 8268 ax-addcl 8269 ax-addrcl 8270 ax-mulcl 8271 ax-addcom 8273 ax-mulcom 8274 ax-addass 8275 ax-mulass 8276 ax-distr 8277 ax-i2m1 8278 ax-1rid 8280 ax-0id 8281 ax-rnegex 8282 ax-cnre 8284 |
| This theorem depends on definitions: df-bi 117 df-3an 1011 df-tru 1405 df-fal 1408 df-nf 1514 df-sb 1816 df-eu 2089 df-mo 2090 df-clab 2225 df-cleq 2231 df-clel 2234 df-nfc 2381 df-ne 2421 df-ral 2533 df-rex 2534 df-reu 2535 df-rmo 2536 df-rab 2537 df-v 2823 df-sbc 3052 df-csb 3148 df-dif 3222 df-un 3224 df-in 3226 df-ss 3233 df-nul 3521 df-if 3639 df-pw 3690 df-sn 3714 df-pr 3715 df-op 3717 df-uni 3934 df-int 3969 df-br 4129 df-opab 4191 df-mpt 4192 df-tr 4228 df-id 4436 df-iord 4509 df-on 4511 df-suc 4514 df-xp 4778 df-rel 4779 df-cnv 4780 df-co 4781 df-dm 4782 df-rn 4783 df-res 4784 df-ima 4785 df-iota 5335 df-fun 5377 df-fn 5378 df-f 5379 df-f1 5380 df-fo 5381 df-f1o 5382 df-fv 5383 df-riota 6032 df-ov 6082 df-oprab 6083 df-mpo 6084 df-1st 6368 df-2nd 6369 df-1o 6681 df-2o 6682 df-en 7017 df-sub 8493 df-inn 9288 df-2 9346 df-3 9347 df-4 9348 df-5 9349 df-6 9350 df-7 9351 df-8 9352 df-9 9353 df-n0 9547 df-dec 9761 df-ndx 13338 df-slot 13339 df-base 13341 df-edgf 16229 df-vtx 16238 df-iedg 16239 df-edg 16282 df-upgren 16317 df-uspgren 16379 |
| This theorem is referenced by: uspgredg2v 16445 |
| Copyright terms: Public domain | W3C validator |