| 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 29773, not using umgredg2 29678. (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 2761 | . . . . 5 ⊢ (Vtx‘𝐺) = (Vtx‘𝐺) | |
| 2 | usgredg2.e | . . . . 5 ⊢ 𝐸 = (iEdg‘𝐺) | |
| 3 | 1, 2 | usgrf 29736 | . . . 4 ⊢ (𝐺 ∈ USGraph → 𝐸:dom 𝐸–1-1→{𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) = 2}) |
| 4 | f1f 6778 | . . . 4 ⊢ (𝐸:dom 𝐸–1-1→{𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) = 2} → 𝐸:dom 𝐸⟶{𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) = 2}) | |
| 5 | 3, 4 | syl 18 | . . 3 ⊢ (𝐺 ∈ USGraph → 𝐸:dom 𝐸⟶{𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) = 2}) |
| 6 | 5 | ffvelcdmda 7084 | . 2 ⊢ ((𝐺 ∈ USGraph ∧ 𝑋 ∈ dom 𝐸) → (𝐸‘𝑋) ∈ {𝑥 ∈ (𝒫 (Vtx‘𝐺) ∖ {∅}) ∣ (♯‘𝑥) = 2}) |
| 7 | fveq2 6885 | . . . . 5 ⊢ (𝑥 = (𝐸‘𝑋) → (♯‘𝑥) = (♯‘(𝐸‘𝑋))) | |
| 8 | 7 | eqeq1d 2763 | . . . 4 ⊢ (𝑥 = (𝐸‘𝑋) → ((♯‘𝑥) = 2 ↔ (♯‘(𝐸‘𝑋)) = 2)) |
| 9 | 8 | elrab 3645 | . . 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 2145 {crab 3413 ∖ cdif 3896 ∅c0 4279 𝒫 cpw 4557 {csn 4584 dom cdm 5651 ⟶wf 6534 –1-1→wf1 6535 ‘cfv 6538 2c2 12397 ♯chash 14474 Vtxcvtx 29574 iEdgciedg 29575 USGraphcusgr 29730 |
| 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-12 2213 ax-ext 2733 ax-sep 5249 ax-nul 5260 ax-pr 5391 |
| 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 2100 df-mo 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-ne 2957 df-ral 3078 df-rex 3088 df-rab 3414 df-v 3453 df-sbc 3740 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-br 5104 df-opab 5168 df-id 5546 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-rn 5662 df-iota 6494 df-fun 6540 df-fn 6541 df-f 6542 df-f1 6543 df-fv 6546 df-usgr 29732 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |