| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > usgredg2ALT | Structured version Visualization version GIF version | ||
| Description: Alternate proof of usgredg2 29830, not using umgredg2 29735. (Contributed by Alexander van der Vekens, 11-Aug-2017.) (Revised by AV, 16-Oct-2020.) (New usage is discouraged.) (Proof modification is discouraged.) |
| Ref | Expression |
|---|---|
| usgredg2.e | ⊢ 𝐸 = (iEdg‘𝐺) |
| Ref | Expression |
|---|---|
| usgredg2ALT | ⊢ ((𝐺 ∈ USGraph ∧ 𝑋 ∈ dom 𝐸) → (♯‘(𝐸‘𝑋)) = 2) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eqid 2763 | . . . . 5 ⊢ (Vtx‘𝐺) = (Vtx‘𝐺) | |
| 2 | usgredg2.e | . . . . 5 ⊢ 𝐸 = (iEdg‘𝐺) | |
| 3 | 1, 2 | usgrf 29793 | . . . 4 ⊢ (𝐺 ∈ USGraph → 𝐸:dom 𝐸⟶1-1{𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) = 2}) |
| 4 | f1f 6808 | . . . 4 ⊢ (𝐸:dom 𝐸⟶1-1{𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) = 2} → 𝐸:dom 𝐸⟶{𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) = 2}) | |
| 5 | 3, 4 | syl 18 | . . 3 ⊢ (𝐺 ∈ USGraph → 𝐸:dom 𝐸⟶{𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) = 2}) |
| 6 | 5 | ffvelcdmda 7116 | . 2 ⊢ ((𝐺 ∈ USGraph ∧ 𝑋 ∈ dom 𝐸) → (𝐸‘𝑋) ∈ {𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) = 2}) |
| 7 | fveq2 6916 | . . . . 5 ⊢ (𝑥 = (𝐸‘𝑋) → (♯‘𝑥) = (♯‘(𝐸‘𝑋))) | |
| 8 | 7 | eqeq1d 2765 | . . . 4 ⊢ (𝑥 = (𝐸‘𝑋) → ((♯‘𝑥) = 2 ↔ (♯‘(𝐸‘𝑋)) = 2)) |
| 9 | 8 | elrab 3648 | . . 3 ⊢ ((𝐸‘𝑋) ∈ {𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) = 2} ↔ ((𝐸‘𝑋) ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∧ (♯‘(𝐸‘𝑋)) = 2)) |
| 10 | 9 | simprbi 503 | . 2 ⊢ ((𝐸‘𝑋) ∈ {𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) = 2} → (♯‘(𝐸‘𝑋)) = 2) |
| 11 | 6, 10 | syl 18 | 1 ⊢ ((𝐺 ∈ USGraph ∧ 𝑋 ∈ dom 𝐸) → (♯‘(𝐸‘𝑋)) = 2) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1570 ∈ wcel 2147 {crab 3416 ∖ cdif 4048 ∅c0 4281 𝒫 cpw 4560 {csn 4588 dom cdm 5658 ⟶wf 6562 ⟶1-1wf1 6563 ‘cfv 6566 2c2 12437 ♯chash 14515 Vtxcvtx 29631 iEdgciedg 29632 USGraphcusgr 29787 |
| 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 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-12 2216 ax-ext 2735 ax-sep 5255 ax-nul 5266 ax-pr 5398 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-ne 2960 df-ral 3081 df-rex 3091 df-rab 3417 df-v 3456 df-sbc 3743 df-ss 3901 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4841 df-uni 4873 df-br 5109 df-opab 5174 df-id 5553 df-xp 5664 df-rel 5665 df-cnv 5666 df-co 5667 df-dm 5668 df-rn 5669 df-iota 6520 df-fun 6568 df-fn 6569 df-f 6570 df-f1 6571 df-fv 6574 df-usgr 29789 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |