| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > uspgredg2vlem | GIF version | ||
| Description: Lemma for uspgredg2v 16265. (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 2298 | . . 3 ⊢ (𝑒 = 𝑌 → (𝑁 ∈ 𝑒 ↔ 𝑁 ∈ 𝑌)) | |
| 2 | uspgredg2v.a | . . 3 ⊢ 𝐴 = {𝑒 ∈ 𝐸 ∣ 𝑁 ∈ 𝑒} | |
| 3 | 1, 2 | elrab2 2978 | . 2 ⊢ (𝑌 ∈ 𝐴 ↔ (𝑌 ∈ 𝐸 ∧ 𝑁 ∈ 𝑌)) |
| 4 | simpl 109 | . . . 4 ⊢ ((𝐺 ∈ USPGraph ∧ (𝑌 ∈ 𝐸 ∧ 𝑁 ∈ 𝑌)) → 𝐺 ∈ USPGraph) | |
| 5 | uspgredg2v.e | . . . . . . 7 ⊢ 𝐸 = (Edg‘𝐺) | |
| 6 | 5 | eleq2i 2301 | . . . . . 6 ⊢ (𝑌 ∈ 𝐸 ↔ 𝑌 ∈ (Edg‘𝐺)) |
| 7 | 6 | biimpi 120 | . . . . 5 ⊢ (𝑌 ∈ 𝐸 → 𝑌 ∈ (Edg‘𝐺)) |
| 8 | 7 | ad2antrl 490 | . . . 4 ⊢ ((𝐺 ∈ USPGraph ∧ (𝑌 ∈ 𝐸 ∧ 𝑁 ∈ 𝑌)) → 𝑌 ∈ (Edg‘𝐺)) |
| 9 | simprr 533 | . . . 4 ⊢ ((𝐺 ∈ USPGraph ∧ (𝑌 ∈ 𝐸 ∧ 𝑁 ∈ 𝑌)) → 𝑁 ∈ 𝑌) | |
| 10 | 4, 8, 9 | 3jca 1204 | . . 3 ⊢ ((𝐺 ∈ USPGraph ∧ (𝑌 ∈ 𝐸 ∧ 𝑁 ∈ 𝑌)) → (𝐺 ∈ USPGraph ∧ 𝑌 ∈ (Edg‘𝐺) ∧ 𝑁 ∈ 𝑌)) |
| 11 | uspgredg2vtxeu 16262 | . . . 4 ⊢ ((𝐺 ∈ USPGraph ∧ 𝑌 ∈ (Edg‘𝐺) ∧ 𝑁 ∈ 𝑌) → ∃!𝑧 ∈ (Vtx‘𝐺)𝑌 = {𝑁, 𝑧}) | |
| 12 | uspgredg2v.v | . . . . 5 ⊢ 𝑉 = (Vtx‘𝐺) | |
| 13 | reueq1 2745 | . . . . 5 ⊢ (𝑉 = (Vtx‘𝐺) → (∃!𝑧 ∈ 𝑉 𝑌 = {𝑁, 𝑧} ↔ ∃!𝑧 ∈ (Vtx‘𝐺)𝑌 = {𝑁, 𝑧})) | |
| 14 | 12, 13 | ax-mp 5 | . . . 4 ⊢ (∃!𝑧 ∈ 𝑉 𝑌 = {𝑁, 𝑧} ↔ ∃!𝑧 ∈ (Vtx‘𝐺)𝑌 = {𝑁, 𝑧}) |
| 15 | 11, 14 | sylibr 134 | . . 3 ⊢ ((𝐺 ∈ USPGraph ∧ 𝑌 ∈ (Edg‘𝐺) ∧ 𝑁 ∈ 𝑌) → ∃!𝑧 ∈ 𝑉 𝑌 = {𝑁, 𝑧}) |
| 16 | riotacl 6021 | . . 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 1005 = wceq 1398 ∈ wcel 2205 ∃!wreu 2524 {crab 2526 {cpr 3692 ‘cfv 5354 ℩crio 6004 Vtxcvtx 16056 Edgcedg 16101 USPGraphcuspgr 16197 |
| 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 619 ax-in2 620 ax-io 717 ax-5 1496 ax-7 1497 ax-gen 1498 ax-ie1 1542 ax-ie2 1543 ax-8 1553 ax-10 1554 ax-11 1555 ax-i12 1556 ax-bndl 1558 ax-4 1559 ax-17 1575 ax-i9 1579 ax-ial 1583 ax-i5r 1584 ax-13 2207 ax-14 2208 ax-ext 2216 ax-sep 4230 ax-nul 4238 ax-pow 4289 ax-pr 4324 ax-un 4556 ax-setind 4661 ax-cnex 8223 ax-resscn 8224 ax-1cn 8225 ax-1re 8226 ax-icn 8227 ax-addcl 8228 ax-addrcl 8229 ax-mulcl 8230 ax-addcom 8232 ax-mulcom 8233 ax-addass 8234 ax-mulass 8235 ax-distr 8236 ax-i2m1 8237 ax-1rid 8239 ax-0id 8240 ax-rnegex 8241 ax-cnre 8243 |
| This theorem depends on definitions: df-bi 117 df-3an 1007 df-tru 1401 df-fal 1404 df-nf 1510 df-sb 1812 df-eu 2085 df-mo 2086 df-clab 2221 df-cleq 2227 df-clel 2230 df-nfc 2375 df-ne 2415 df-ral 2527 df-rex 2528 df-reu 2529 df-rmo 2530 df-rab 2531 df-v 2817 df-sbc 3045 df-csb 3141 df-dif 3215 df-un 3217 df-in 3219 df-ss 3226 df-nul 3511 df-if 3623 df-pw 3673 df-sn 3697 df-pr 3698 df-op 3700 df-uni 3917 df-int 3952 df-br 4112 df-opab 4174 df-mpt 4175 df-tr 4211 df-id 4416 df-iord 4489 df-on 4491 df-suc 4494 df-xp 4757 df-rel 4758 df-cnv 4759 df-co 4760 df-dm 4761 df-rn 4762 df-res 4763 df-ima 4764 df-iota 5314 df-fun 5356 df-fn 5357 df-f 5358 df-f1 5359 df-fo 5360 df-f1o 5361 df-fv 5362 df-riota 6005 df-ov 6055 df-oprab 6056 df-mpo 6057 df-1st 6336 df-2nd 6337 df-1o 6649 df-2o 6650 df-en 6978 df-sub 8451 df-inn 9243 df-2 9301 df-3 9302 df-4 9303 df-5 9304 df-6 9305 df-7 9306 df-8 9307 df-9 9308 df-n0 9502 df-dec 9716 df-ndx 13236 df-slot 13237 df-base 13239 df-edgf 16049 df-vtx 16058 df-iedg 16059 df-edg 16102 df-upgren 16137 df-uspgren 16199 |
| This theorem is referenced by: uspgredg2v 16265 |
| Copyright terms: Public domain | W3C validator |