| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > usgredg2vtxeuALT | Structured version Visualization version GIF version | ||
| Description: Alternate proof of usgredg2vtxeu 29684, using edgiedgb 29514, the general translation from (iEdg‘𝐺) to (Edg‘𝐺). (Contributed by AV, 18-Oct-2020.) (Proof modification is discouraged.) (New usage is discouraged.) |
| Ref | Expression |
|---|---|
| usgredg2vtxeuALT | ⊢ ((𝐺 ∈ USGraph ∧ 𝐸 ∈ (Edg‘𝐺) ∧ 𝑌 ∈ 𝐸) → ∃!𝑦 ∈ (Vtx‘𝐺)𝐸 = {𝑌, 𝑦}) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | usgruhgr 29649 | . . . 4 ⊢ (𝐺 ∈ USGraph → 𝐺 ∈ UHGraph) | |
| 2 | eqid 2760 | . . . . 5 ⊢ (iEdg‘𝐺) = (iEdg‘𝐺) | |
| 3 | 2 | uhgredgiedgb 29586 | . . . 4 ⊢ (𝐺 ∈ UHGraph → (𝐸 ∈ (Edg‘𝐺) ↔ ∃𝑥 ∈ dom (iEdg‘𝐺)𝐸 = ((iEdg‘𝐺)‘𝑥))) |
| 4 | 1, 3 | syl 18 | . . 3 ⊢ (𝐺 ∈ USGraph → (𝐸 ∈ (Edg‘𝐺) ↔ ∃𝑥 ∈ dom (iEdg‘𝐺)𝐸 = ((iEdg‘𝐺)‘𝑥))) |
| 5 | eqid 2760 | . . . . . . . . 9 ⊢ (Vtx‘𝐺) = (Vtx‘𝐺) | |
| 6 | 5, 2 | usgredgreu 29681 | . . . . . . . 8 ⊢ ((𝐺 ∈ USGraph ∧ 𝑥 ∈ dom (iEdg‘𝐺) ∧ 𝑌 ∈ ((iEdg‘𝐺)‘𝑥)) → ∃!𝑦 ∈ (Vtx‘𝐺)((iEdg‘𝐺)‘𝑥) = {𝑌, 𝑦}) |
| 7 | 6 | 3expia 1139 | . . . . . . 7 ⊢ ((𝐺 ∈ USGraph ∧ 𝑥 ∈ dom (iEdg‘𝐺)) → (𝑌 ∈ ((iEdg‘𝐺)‘𝑥) → ∃!𝑦 ∈ (Vtx‘𝐺)((iEdg‘𝐺)‘𝑥) = {𝑌, 𝑦})) |
| 8 | 7 | 3adant3 1150 | . . . . . 6 ⊢ ((𝐺 ∈ USGraph ∧ 𝑥 ∈ dom (iEdg‘𝐺) ∧ 𝐸 = ((iEdg‘𝐺)‘𝑥)) → (𝑌 ∈ ((iEdg‘𝐺)‘𝑥) → ∃!𝑦 ∈ (Vtx‘𝐺)((iEdg‘𝐺)‘𝑥) = {𝑌, 𝑦})) |
| 9 | eleq2 2849 | . . . . . . . 8 ⊢ (𝐸 = ((iEdg‘𝐺)‘𝑥) → (𝑌 ∈ 𝐸 ↔ 𝑌 ∈ ((iEdg‘𝐺)‘𝑥))) | |
| 10 | eqeq1 2764 | . . . . . . . . 9 ⊢ (𝐸 = ((iEdg‘𝐺)‘𝑥) → (𝐸 = {𝑌, 𝑦} ↔ ((iEdg‘𝐺)‘𝑥) = {𝑌, 𝑦})) | |
| 11 | 10 | reubidv 3381 | . . . . . . . 8 ⊢ (𝐸 = ((iEdg‘𝐺)‘𝑥) → (∃!𝑦 ∈ (Vtx‘𝐺)𝐸 = {𝑌, 𝑦} ↔ ∃!𝑦 ∈ (Vtx‘𝐺)((iEdg‘𝐺)‘𝑥) = {𝑌, 𝑦})) |
| 12 | 9, 11 | imbi12d 347 | . . . . . . 7 ⊢ (𝐸 = ((iEdg‘𝐺)‘𝑥) → ((𝑌 ∈ 𝐸 → ∃!𝑦 ∈ (Vtx‘𝐺)𝐸 = {𝑌, 𝑦}) ↔ (𝑌 ∈ ((iEdg‘𝐺)‘𝑥) → ∃!𝑦 ∈ (Vtx‘𝐺)((iEdg‘𝐺)‘𝑥) = {𝑌, 𝑦}))) |
| 13 | 12 | 3ad2ant3 1153 | . . . . . 6 ⊢ ((𝐺 ∈ USGraph ∧ 𝑥 ∈ dom (iEdg‘𝐺) ∧ 𝐸 = ((iEdg‘𝐺)‘𝑥)) → ((𝑌 ∈ 𝐸 → ∃!𝑦 ∈ (Vtx‘𝐺)𝐸 = {𝑌, 𝑦}) ↔ (𝑌 ∈ ((iEdg‘𝐺)‘𝑥) → ∃!𝑦 ∈ (Vtx‘𝐺)((iEdg‘𝐺)‘𝑥) = {𝑌, 𝑦}))) |
| 14 | 8, 13 | mpbird 260 | . . . . 5 ⊢ ((𝐺 ∈ USGraph ∧ 𝑥 ∈ dom (iEdg‘𝐺) ∧ 𝐸 = ((iEdg‘𝐺)‘𝑥)) → (𝑌 ∈ 𝐸 → ∃!𝑦 ∈ (Vtx‘𝐺)𝐸 = {𝑌, 𝑦})) |
| 15 | 14 | 3exp 1137 | . . . 4 ⊢ (𝐺 ∈ USGraph → (𝑥 ∈ dom (iEdg‘𝐺) → (𝐸 = ((iEdg‘𝐺)‘𝑥) → (𝑌 ∈ 𝐸 → ∃!𝑦 ∈ (Vtx‘𝐺)𝐸 = {𝑌, 𝑦})))) |
| 16 | 15 | rexlimdv 3161 | . . 3 ⊢ (𝐺 ∈ USGraph → (∃𝑥 ∈ dom (iEdg‘𝐺)𝐸 = ((iEdg‘𝐺)‘𝑥) → (𝑌 ∈ 𝐸 → ∃!𝑦 ∈ (Vtx‘𝐺)𝐸 = {𝑌, 𝑦}))) |
| 17 | 4, 16 | sylbid 243 | . 2 ⊢ (𝐺 ∈ USGraph → (𝐸 ∈ (Edg‘𝐺) → (𝑌 ∈ 𝐸 → ∃!𝑦 ∈ (Vtx‘𝐺)𝐸 = {𝑌, 𝑦}))) |
| 18 | 17 | 3imp 1128 | 1 ⊢ ((𝐺 ∈ USGraph ∧ 𝐸 ∈ (Edg‘𝐺) ∧ 𝑌 ∈ 𝐸) → ∃!𝑦 ∈ (Vtx‘𝐺)𝐸 = {𝑌, 𝑦}) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ w3a 1103 = wceq 1570 ∈ wcel 2145 ∃wrex 3086 ∃!wreu 3363 {cpr 4586 dom cdm 5655 ‘cfv 6533 Vtxcvtx 29456 iEdgciedg 29457 Edgcedg 29507 UHGraphcuhgr 29516 USGraphcusgr 29612 |
| 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 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2732 ax-sep 5251 ax-nul 5263 ax-pow 5330 ax-pr 5398 ax-un 7737 ax-cnex 11183 ax-resscn 11184 ax-1cn 11185 ax-icn 11186 ax-addcl 11187 ax-addrcl 11188 ax-mulcl 11189 ax-mulrcl 11190 ax-mulcom 11191 ax-addass 11192 ax-mulass 11193 ax-distr 11194 ax-i2m1 11195 ax-1ne0 11196 ax-1rid 11197 ax-rnegex 11198 ax-rrecex 11199 ax-cnre 11200 ax-pre-lttri 11201 ax-pre-lttrn 11202 ax-pre-ltadd 11203 ax-pre-mulgt0 11204 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-nel 3062 df-ral 3077 df-rex 3087 df-rmo 3365 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-int 4908 df-iun 4953 df-br 5104 df-opab 5168 df-mpt 5187 df-tr 5213 df-id 5550 df-eprel 5555 df-po 5563 df-so 5564 df-fr 5608 df-we 5610 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 df-pred 6299 df-ord 6360 df-on 6361 df-lim 6362 df-suc 6363 df-iota 6489 df-fun 6535 df-fn 6536 df-f 6537 df-f1 6538 df-fo 6539 df-f1o 6540 df-fv 6541 df-riota 7371 df-ov 7417 df-oprab 7418 df-mpo 7419 df-om 7864 df-1st 7987 df-2nd 7988 df-frecs 8281 df-wrecs 8312 df-recs 8361 df-rdg 8400 df-1o 8458 df-2o 8459 df-oadd 8462 df-er 8699 df-en 8956 df-dom 8957 df-sdom 8958 df-fin 8959 df-dju 9909 df-card 9947 df-pnf 11272 df-mnf 11273 df-xr 11274 df-ltxr 11275 df-le 11276 df-sub 11470 df-neg 11471 df-nn 12261 df-2 12330 df-n0 12532 df-z 12619 df-uz 12891 df-fz 13565 df-hash 14398 df-edg 29508 df-uhgr 29518 df-upgr 29542 df-umgr 29543 df-uspgr 29613 df-usgr 29614 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |