| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > usgredg2vlem1 | Structured version Visualization version GIF version | ||
| Description: Lemma 1 for usgredg2v 29317. (Contributed by Alexander van der Vekens, 4-Jan-2018.) (Revised by AV, 18-Oct-2020.) |
| Ref | Expression |
|---|---|
| usgredg2v.v | ⊢ 𝑉 = (Vtx‘𝐺) |
| usgredg2v.e | ⊢ 𝐸 = (iEdg‘𝐺) |
| usgredg2v.a | ⊢ 𝐴 = {𝑥 ∈ dom 𝐸 ∣ 𝑁 ∈ (𝐸‘𝑥)} |
| Ref | Expression |
|---|---|
| usgredg2vlem1 | ⊢ ((𝐺 ∈ USGraph ∧ 𝑌 ∈ 𝐴) → (℩𝑧 ∈ 𝑉 (𝐸‘𝑌) = {𝑧, 𝑁}) ∈ 𝑉) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | fveq2 6830 | . . . 4 ⊢ (𝑥 = 𝑌 → (𝐸‘𝑥) = (𝐸‘𝑌)) | |
| 2 | 1 | eleq2d 2822 | . . 3 ⊢ (𝑥 = 𝑌 → (𝑁 ∈ (𝐸‘𝑥) ↔ 𝑁 ∈ (𝐸‘𝑌))) |
| 3 | usgredg2v.a | . . 3 ⊢ 𝐴 = {𝑥 ∈ dom 𝐸 ∣ 𝑁 ∈ (𝐸‘𝑥)} | |
| 4 | 2, 3 | elrab2 3635 | . 2 ⊢ (𝑌 ∈ 𝐴 ↔ (𝑌 ∈ dom 𝐸 ∧ 𝑁 ∈ (𝐸‘𝑌))) |
| 5 | usgredg2v.v | . . . . . 6 ⊢ 𝑉 = (Vtx‘𝐺) | |
| 6 | usgredg2v.e | . . . . . 6 ⊢ 𝐸 = (iEdg‘𝐺) | |
| 7 | 5, 6 | usgredgreu 29308 | . . . . 5 ⊢ ((𝐺 ∈ USGraph ∧ 𝑌 ∈ dom 𝐸 ∧ 𝑁 ∈ (𝐸‘𝑌)) → ∃!𝑧 ∈ 𝑉 (𝐸‘𝑌) = {𝑁, 𝑧}) |
| 8 | prcom 4667 | . . . . . . 7 ⊢ {𝑁, 𝑧} = {𝑧, 𝑁} | |
| 9 | 8 | eqeq2i 2749 | . . . . . 6 ⊢ ((𝐸‘𝑌) = {𝑁, 𝑧} ↔ (𝐸‘𝑌) = {𝑧, 𝑁}) |
| 10 | 9 | reubii 3350 | . . . . 5 ⊢ (∃!𝑧 ∈ 𝑉 (𝐸‘𝑌) = {𝑁, 𝑧} ↔ ∃!𝑧 ∈ 𝑉 (𝐸‘𝑌) = {𝑧, 𝑁}) |
| 11 | 7, 10 | sylib 219 | . . . 4 ⊢ ((𝐺 ∈ USGraph ∧ 𝑌 ∈ dom 𝐸 ∧ 𝑁 ∈ (𝐸‘𝑌)) → ∃!𝑧 ∈ 𝑉 (𝐸‘𝑌) = {𝑧, 𝑁}) |
| 12 | 11 | 3expb 1122 | . . 3 ⊢ ((𝐺 ∈ USGraph ∧ (𝑌 ∈ dom 𝐸 ∧ 𝑁 ∈ (𝐸‘𝑌))) → ∃!𝑧 ∈ 𝑉 (𝐸‘𝑌) = {𝑧, 𝑁}) |
| 13 | riotacl 7333 | . . 3 ⊢ (∃!𝑧 ∈ 𝑉 (𝐸‘𝑌) = {𝑧, 𝑁} → (℩𝑧 ∈ 𝑉 (𝐸‘𝑌) = {𝑧, 𝑁}) ∈ 𝑉) | |
| 14 | 12, 13 | syl 17 | . 2 ⊢ ((𝐺 ∈ USGraph ∧ (𝑌 ∈ dom 𝐸 ∧ 𝑁 ∈ (𝐸‘𝑌))) → (℩𝑧 ∈ 𝑉 (𝐸‘𝑌) = {𝑧, 𝑁}) ∈ 𝑉) |
| 15 | 4, 14 | sylan2b 596 | 1 ⊢ ((𝐺 ∈ USGraph ∧ 𝑌 ∈ 𝐴) → (℩𝑧 ∈ 𝑉 (𝐸‘𝑌) = {𝑧, 𝑁}) ∈ 𝑉) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 396 ∧ w3a 1088 = wceq 1543 ∈ wcel 2115 ∃!wreu 3339 {crab 3388 {cpr 4560 dom cdm 5621 ‘cfv 6488 ℩crio 7315 Vtxcvtx 29086 iEdgciedg 29087 USGraphcusgr 29239 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1913 ax-6 1970 ax-7 2011 ax-8 2117 ax-9 2125 ax-10 2148 ax-11 2164 ax-12 2185 ax-ext 2708 ax-sep 5221 ax-nul 5231 ax-pow 5297 ax-pr 5365 ax-un 7681 ax-cnex 11088 ax-resscn 11089 ax-1cn 11090 ax-icn 11091 ax-addcl 11092 ax-addrcl 11093 ax-mulcl 11094 ax-mulrcl 11095 ax-mulcom 11096 ax-addass 11097 ax-mulass 11098 ax-distr 11099 ax-i2m1 11100 ax-1ne0 11101 ax-1rid 11102 ax-rnegex 11103 ax-rrecex 11104 ax-cnre 11105 ax-pre-lttri 11106 ax-pre-lttrn 11107 ax-pre-ltadd 11108 ax-pre-mulgt0 11109 |
| This theorem depends on definitions: df-bi 208 df-an 397 df-or 850 df-3or 1089 df-3an 1090 df-tru 1546 df-fal 1556 df-ex 1783 df-nf 1787 df-sb 2070 df-mo 2539 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2811 df-nfc 2885 df-ne 2932 df-nel 3036 df-ral 3051 df-rex 3061 df-rmo 3341 df-reu 3342 df-rab 3389 df-v 3430 df-sbc 3727 df-csb 3835 df-dif 3889 df-un 3891 df-in 3893 df-ss 3903 df-pss 3906 df-nul 4265 df-if 4458 df-pw 4534 df-sn 4559 df-pr 4561 df-op 4565 df-uni 4842 df-int 4881 df-iun 4926 df-br 5076 df-opab 5138 df-mpt 5157 df-tr 5183 df-id 5516 df-eprel 5521 df-po 5529 df-so 5530 df-fr 5574 df-we 5576 df-xp 5627 df-rel 5628 df-cnv 5629 df-co 5630 df-dm 5631 df-rn 5632 df-res 5633 df-ima 5634 df-pred 6255 df-ord 6316 df-on 6317 df-lim 6318 df-suc 6319 df-iota 6444 df-fun 6490 df-fn 6491 df-f 6492 df-f1 6493 df-fo 6494 df-f1o 6495 df-fv 6496 df-riota 7316 df-ov 7362 df-oprab 7363 df-mpo 7364 df-om 7810 df-1st 7934 df-2nd 7935 df-frecs 8224 df-wrecs 8255 df-recs 8304 df-rdg 8342 df-1o 8398 df-2o 8399 df-oadd 8402 df-er 8636 df-en 8887 df-dom 8888 df-sdom 8889 df-fin 8890 df-dju 9819 df-card 9857 df-pnf 11175 df-mnf 11176 df-xr 11177 df-ltxr 11178 df-le 11179 df-sub 11373 df-neg 11374 df-nn 12169 df-2 12238 df-n0 12432 df-z 12519 df-uz 12783 df-fz 13456 df-hash 14287 df-edg 29138 df-umgr 29173 df-usgr 29241 |
| This theorem is referenced by: usgredg2vlem2 29316 usgredg2v 29317 |
| Copyright terms: Public domain | W3C validator |