| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > fusgrfisbase | Structured version Visualization version GIF version | ||
| Description: Induction base for fusgrfis 29264. Main work is done in uhgr0v0e 29172. (Contributed by Alexander van der Vekens, 5-Jan-2018.) (Revised by AV, 23-Oct-2020.) |
| Ref | Expression |
|---|---|
| fusgrfisbase | ⊢ (((𝑉 ∈ 𝑋 ∧ 𝐸 ∈ 𝑌) ∧ 〈𝑉, 𝐸〉 ∈ USGraph ∧ (♯‘𝑉) = 0) → 𝐸 ∈ Fin) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | usgruhgr 29120 | . . . . 5 ⊢ (〈𝑉, 𝐸〉 ∈ USGraph → 〈𝑉, 𝐸〉 ∈ UHGraph) | |
| 2 | 1 | 3ad2ant2 1134 | . . . 4 ⊢ (((𝑉 ∈ 𝑋 ∧ 𝐸 ∈ 𝑌) ∧ 〈𝑉, 𝐸〉 ∈ USGraph ∧ (♯‘𝑉) = 0) → 〈𝑉, 𝐸〉 ∈ UHGraph) |
| 3 | opvtxfv 28938 | . . . . . 6 ⊢ ((𝑉 ∈ 𝑋 ∧ 𝐸 ∈ 𝑌) → (Vtx‘〈𝑉, 𝐸〉) = 𝑉) | |
| 4 | 3 | 3ad2ant1 1133 | . . . . 5 ⊢ (((𝑉 ∈ 𝑋 ∧ 𝐸 ∈ 𝑌) ∧ 〈𝑉, 𝐸〉 ∈ USGraph ∧ (♯‘𝑉) = 0) → (Vtx‘〈𝑉, 𝐸〉) = 𝑉) |
| 5 | hasheq0 14335 | . . . . . . . . 9 ⊢ (𝑉 ∈ 𝑋 → ((♯‘𝑉) = 0 ↔ 𝑉 = ∅)) | |
| 6 | 5 | biimpd 229 | . . . . . . . 8 ⊢ (𝑉 ∈ 𝑋 → ((♯‘𝑉) = 0 → 𝑉 = ∅)) |
| 7 | 6 | adantr 480 | . . . . . . 7 ⊢ ((𝑉 ∈ 𝑋 ∧ 𝐸 ∈ 𝑌) → ((♯‘𝑉) = 0 → 𝑉 = ∅)) |
| 8 | 7 | a1d 25 | . . . . . 6 ⊢ ((𝑉 ∈ 𝑋 ∧ 𝐸 ∈ 𝑌) → (〈𝑉, 𝐸〉 ∈ USGraph → ((♯‘𝑉) = 0 → 𝑉 = ∅))) |
| 9 | 8 | 3imp 1110 | . . . . 5 ⊢ (((𝑉 ∈ 𝑋 ∧ 𝐸 ∈ 𝑌) ∧ 〈𝑉, 𝐸〉 ∈ USGraph ∧ (♯‘𝑉) = 0) → 𝑉 = ∅) |
| 10 | 4, 9 | eqtrd 2765 | . . . 4 ⊢ (((𝑉 ∈ 𝑋 ∧ 𝐸 ∈ 𝑌) ∧ 〈𝑉, 𝐸〉 ∈ USGraph ∧ (♯‘𝑉) = 0) → (Vtx‘〈𝑉, 𝐸〉) = ∅) |
| 11 | eqid 2730 | . . . . 5 ⊢ (Vtx‘〈𝑉, 𝐸〉) = (Vtx‘〈𝑉, 𝐸〉) | |
| 12 | eqid 2730 | . . . . 5 ⊢ (Edg‘〈𝑉, 𝐸〉) = (Edg‘〈𝑉, 𝐸〉) | |
| 13 | 11, 12 | uhgr0v0e 29172 | . . . 4 ⊢ ((〈𝑉, 𝐸〉 ∈ UHGraph ∧ (Vtx‘〈𝑉, 𝐸〉) = ∅) → (Edg‘〈𝑉, 𝐸〉) = ∅) |
| 14 | 2, 10, 13 | syl2anc 584 | . . 3 ⊢ (((𝑉 ∈ 𝑋 ∧ 𝐸 ∈ 𝑌) ∧ 〈𝑉, 𝐸〉 ∈ USGraph ∧ (♯‘𝑉) = 0) → (Edg‘〈𝑉, 𝐸〉) = ∅) |
| 15 | 0fi 9016 | . . 3 ⊢ ∅ ∈ Fin | |
| 16 | 14, 15 | eqeltrdi 2837 | . 2 ⊢ (((𝑉 ∈ 𝑋 ∧ 𝐸 ∈ 𝑌) ∧ 〈𝑉, 𝐸〉 ∈ USGraph ∧ (♯‘𝑉) = 0) → (Edg‘〈𝑉, 𝐸〉) ∈ Fin) |
| 17 | eqid 2730 | . . . . 5 ⊢ (iEdg‘〈𝑉, 𝐸〉) = (iEdg‘〈𝑉, 𝐸〉) | |
| 18 | 17, 12 | usgredgffibi 29258 | . . . 4 ⊢ (〈𝑉, 𝐸〉 ∈ USGraph → ((Edg‘〈𝑉, 𝐸〉) ∈ Fin ↔ (iEdg‘〈𝑉, 𝐸〉) ∈ Fin)) |
| 19 | 18 | 3ad2ant2 1134 | . . 3 ⊢ (((𝑉 ∈ 𝑋 ∧ 𝐸 ∈ 𝑌) ∧ 〈𝑉, 𝐸〉 ∈ USGraph ∧ (♯‘𝑉) = 0) → ((Edg‘〈𝑉, 𝐸〉) ∈ Fin ↔ (iEdg‘〈𝑉, 𝐸〉) ∈ Fin)) |
| 20 | opiedgfv 28941 | . . . . 5 ⊢ ((𝑉 ∈ 𝑋 ∧ 𝐸 ∈ 𝑌) → (iEdg‘〈𝑉, 𝐸〉) = 𝐸) | |
| 21 | 20 | 3ad2ant1 1133 | . . . 4 ⊢ (((𝑉 ∈ 𝑋 ∧ 𝐸 ∈ 𝑌) ∧ 〈𝑉, 𝐸〉 ∈ USGraph ∧ (♯‘𝑉) = 0) → (iEdg‘〈𝑉, 𝐸〉) = 𝐸) |
| 22 | 21 | eleq1d 2814 | . . 3 ⊢ (((𝑉 ∈ 𝑋 ∧ 𝐸 ∈ 𝑌) ∧ 〈𝑉, 𝐸〉 ∈ USGraph ∧ (♯‘𝑉) = 0) → ((iEdg‘〈𝑉, 𝐸〉) ∈ Fin ↔ 𝐸 ∈ Fin)) |
| 23 | 19, 22 | bitrd 279 | . 2 ⊢ (((𝑉 ∈ 𝑋 ∧ 𝐸 ∈ 𝑌) ∧ 〈𝑉, 𝐸〉 ∈ USGraph ∧ (♯‘𝑉) = 0) → ((Edg‘〈𝑉, 𝐸〉) ∈ Fin ↔ 𝐸 ∈ Fin)) |
| 24 | 16, 23 | mpbid 232 | 1 ⊢ (((𝑉 ∈ 𝑋 ∧ 𝐸 ∈ 𝑌) ∧ 〈𝑉, 𝐸〉 ∈ USGraph ∧ (♯‘𝑉) = 0) → 𝐸 ∈ Fin) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 ∧ w3a 1086 = wceq 1540 ∈ wcel 2109 ∅c0 4299 〈cop 4598 ‘cfv 6514 Fincfn 8921 0cc0 11075 ♯chash 14302 Vtxcvtx 28930 iEdgciedg 28931 Edgcedg 28981 UHGraphcuhgr 28990 USGraphcusgr 29083 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2702 ax-rep 5237 ax-sep 5254 ax-nul 5264 ax-pow 5323 ax-pr 5390 ax-un 7714 ax-cnex 11131 ax-resscn 11132 ax-1cn 11133 ax-icn 11134 ax-addcl 11135 ax-addrcl 11136 ax-mulcl 11137 ax-mulrcl 11138 ax-mulcom 11139 ax-addass 11140 ax-mulass 11141 ax-distr 11142 ax-i2m1 11143 ax-1ne0 11144 ax-1rid 11145 ax-rnegex 11146 ax-rrecex 11147 ax-cnre 11148 ax-pre-lttri 11149 ax-pre-lttrn 11150 ax-pre-ltadd 11151 ax-pre-mulgt0 11152 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2534 df-eu 2563 df-clab 2709 df-cleq 2722 df-clel 2804 df-nfc 2879 df-ne 2927 df-nel 3031 df-ral 3046 df-rex 3055 df-reu 3357 df-rab 3409 df-v 3452 df-sbc 3757 df-csb 3866 df-dif 3920 df-un 3922 df-in 3924 df-ss 3934 df-pss 3937 df-nul 4300 df-if 4492 df-pw 4568 df-sn 4593 df-pr 4595 df-op 4599 df-uni 4875 df-int 4914 df-iun 4960 df-br 5111 df-opab 5173 df-mpt 5192 df-tr 5218 df-id 5536 df-eprel 5541 df-po 5549 df-so 5550 df-fr 5594 df-we 5596 df-xp 5647 df-rel 5648 df-cnv 5649 df-co 5650 df-dm 5651 df-rn 5652 df-res 5653 df-ima 5654 df-pred 6277 df-ord 6338 df-on 6339 df-lim 6340 df-suc 6341 df-iota 6467 df-fun 6516 df-fn 6517 df-f 6518 df-f1 6519 df-fo 6520 df-f1o 6521 df-fv 6522 df-riota 7347 df-ov 7393 df-oprab 7394 df-mpo 7395 df-om 7846 df-1st 7971 df-2nd 7972 df-frecs 8263 df-wrecs 8294 df-recs 8343 df-rdg 8381 df-1o 8437 df-er 8674 df-en 8922 df-dom 8923 df-sdom 8924 df-fin 8925 df-card 9899 df-pnf 11217 df-mnf 11218 df-xr 11219 df-ltxr 11220 df-le 11221 df-sub 11414 df-neg 11415 df-nn 12194 df-2 12256 df-n0 12450 df-z 12537 df-uz 12801 df-fz 13476 df-hash 14303 df-vtx 28932 df-iedg 28933 df-edg 28982 df-uhgr 28992 df-upgr 29016 df-uspgr 29084 df-usgr 29085 |
| This theorem is referenced by: fusgrfis 29264 |
| Copyright terms: Public domain | W3C validator |