| 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 29916. Main work is done in uhgr0v0e 29824. (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 29772 | . . . . 5 ⊢ (〈𝑉, 𝐸〉 ∈ USGraph → 〈𝑉, 𝐸〉 ∈ UHGraph) | |
| 2 | 1 | 3ad2ant2 1152 | . . . 4 ⊢ (((𝑉 ∈ 𝑋 ∧ 𝐸 ∈ 𝑌) ∧ 〈𝑉, 𝐸〉 ∈ USGraph ∧ (♯‘𝑉) = 0) → 〈𝑉, 𝐸〉 ∈ UHGraph) |
| 3 | opvtxfv 29587 | . . . . . 6 ⊢ ((𝑉 ∈ 𝑋 ∧ 𝐸 ∈ 𝑌) → (Vtx‘〈𝑉, 𝐸〉) = 𝑉) | |
| 4 | 3 | 3ad2ant1 1151 | . . . . 5 ⊢ (((𝑉 ∈ 𝑋 ∧ 𝐸 ∈ 𝑌) ∧ 〈𝑉, 𝐸〉 ∈ USGraph ∧ (♯‘𝑉) = 0) → (Vtx‘〈𝑉, 𝐸〉) = 𝑉) |
| 5 | hasheq0 14510 | . . . . . . . . 9 ⊢ (𝑉 ∈ 𝑋 → ((♯‘𝑉) = 0 ↔ 𝑉 = ∅)) | |
| 6 | 5 | biimpd 232 | . . . . . . . 8 ⊢ (𝑉 ∈ 𝑋 → ((♯‘𝑉) = 0 → 𝑉 = ∅)) |
| 7 | 6 | adantr 486 | . . . . . . 7 ⊢ ((𝑉 ∈ 𝑋 ∧ 𝐸 ∈ 𝑌) → ((♯‘𝑉) = 0 → 𝑉 = ∅)) |
| 8 | 7 | a1d 26 | . . . . . 6 ⊢ ((𝑉 ∈ 𝑋 ∧ 𝐸 ∈ 𝑌) → (〈𝑉, 𝐸〉 ∈ USGraph → ((♯‘𝑉) = 0 → 𝑉 = ∅))) |
| 9 | 8 | 3imp 1128 | . . . . 5 ⊢ (((𝑉 ∈ 𝑋 ∧ 𝐸 ∈ 𝑌) ∧ 〈𝑉, 𝐸〉 ∈ USGraph ∧ (♯‘𝑉) = 0) → 𝑉 = ∅) |
| 10 | 4, 9 | eqtrd 2795 | . . . 4 ⊢ (((𝑉 ∈ 𝑋 ∧ 𝐸 ∈ 𝑌) ∧ 〈𝑉, 𝐸〉 ∈ USGraph ∧ (♯‘𝑉) = 0) → (Vtx‘〈𝑉, 𝐸〉) = ∅) |
| 11 | eqid 2760 | . . . . 5 ⊢ (Vtx‘〈𝑉, 𝐸〉) = (Vtx‘〈𝑉, 𝐸〉) | |
| 12 | eqid 2760 | . . . . 5 ⊢ (Edg‘〈𝑉, 𝐸〉) = (Edg‘〈𝑉, 𝐸〉) | |
| 13 | 11, 12 | uhgr0v0e 29824 | . . . 4 ⊢ ((〈𝑉, 𝐸〉 ∈ UHGraph ∧ (Vtx‘〈𝑉, 𝐸〉) = ∅) → (Edg‘〈𝑉, 𝐸〉) = ∅) |
| 14 | 2, 10, 13 | syl2anc 596 | . . 3 ⊢ (((𝑉 ∈ 𝑋 ∧ 𝐸 ∈ 𝑌) ∧ 〈𝑉, 𝐸〉 ∈ USGraph ∧ (♯‘𝑉) = 0) → (Edg‘〈𝑉, 𝐸〉) = ∅) |
| 15 | 0fi 9073 | . . 3 ⊢ ∅ ∈ Fin | |
| 16 | 14, 15 | eqeltrdi 2868 | . 2 ⊢ (((𝑉 ∈ 𝑋 ∧ 𝐸 ∈ 𝑌) ∧ 〈𝑉, 𝐸〉 ∈ USGraph ∧ (♯‘𝑉) = 0) → (Edg‘〈𝑉, 𝐸〉) ∈ Fin) |
| 17 | eqid 2760 | . . . . 5 ⊢ (iEdg‘〈𝑉, 𝐸〉) = (iEdg‘〈𝑉, 𝐸〉) | |
| 18 | 17, 12 | usgredgffibi 29910 | . . . 4 ⊢ (〈𝑉, 𝐸〉 ∈ USGraph → ((Edg‘〈𝑉, 𝐸〉) ∈ Fin ↔ (iEdg‘〈𝑉, 𝐸〉) ∈ Fin)) |
| 19 | 18 | 3ad2ant2 1152 | . . 3 ⊢ (((𝑉 ∈ 𝑋 ∧ 𝐸 ∈ 𝑌) ∧ 〈𝑉, 𝐸〉 ∈ USGraph ∧ (♯‘𝑉) = 0) → ((Edg‘〈𝑉, 𝐸〉) ∈ Fin ↔ (iEdg‘〈𝑉, 𝐸〉) ∈ Fin)) |
| 20 | opiedgfv 29590 | . . . . 5 ⊢ ((𝑉 ∈ 𝑋 ∧ 𝐸 ∈ 𝑌) → (iEdg‘〈𝑉, 𝐸〉) = 𝐸) | |
| 21 | 20 | 3ad2ant1 1151 | . . . 4 ⊢ (((𝑉 ∈ 𝑋 ∧ 𝐸 ∈ 𝑌) ∧ 〈𝑉, 𝐸〉 ∈ USGraph ∧ (♯‘𝑉) = 0) → (iEdg‘〈𝑉, 𝐸〉) = 𝐸) |
| 22 | 21 | eleq1d 2845 | . . 3 ⊢ (((𝑉 ∈ 𝑋 ∧ 𝐸 ∈ 𝑌) ∧ 〈𝑉, 𝐸〉 ∈ USGraph ∧ (♯‘𝑉) = 0) → ((iEdg‘〈𝑉, 𝐸〉) ∈ Fin ↔ 𝐸 ∈ Fin)) |
| 23 | 19, 22 | bitrd 282 | . 2 ⊢ (((𝑉 ∈ 𝑋 ∧ 𝐸 ∈ 𝑌) ∧ 〈𝑉, 𝐸〉 ∈ USGraph ∧ (♯‘𝑉) = 0) → ((Edg‘〈𝑉, 𝐸〉) ∈ Fin ↔ 𝐸 ∈ Fin)) |
| 24 | 16, 23 | mpbid 235 | 1 ⊢ (((𝑉 ∈ 𝑋 ∧ 𝐸 ∈ 𝑌) ∧ 〈𝑉, 𝐸〉 ∈ USGraph ∧ (♯‘𝑉) = 0) → 𝐸 ∈ Fin) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 ∧ w3a 1103 = wceq 1569 ∈ wcel 2144 ∅c0 4278 〈cop 4834 ‘cfv 6538 Fincfn 8976 0cc0 11203 ♯chash 14477 Vtxcvtx 29579 iEdgciedg 29580 Edgcedg 29630 UHGraphcuhgr 29639 USGraphcusgr 29735 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-10 2177 ax-11 2193 ax-12 2212 ax-ext 2732 ax-rep 5231 ax-sep 5248 ax-nul 5259 ax-pow 5326 ax-pr 5390 ax-un 7751 ax-cnex 11259 ax-resscn 11260 ax-1cn 11261 ax-icn 11262 ax-addcl 11263 ax-addrcl 11264 ax-mulcl 11265 ax-mulrcl 11266 ax-mulcom 11267 ax-addass 11268 ax-mulass 11269 ax-distr 11270 ax-i2m1 11271 ax-1ne0 11272 ax-1rid 11273 ax-rnegex 11274 ax-rrecex 11275 ax-cnre 11276 ax-pre-lttri 11277 ax-pre-lttrn 11278 ax-pre-ltadd 11279 ax-pre-mulgt0 11280 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2099 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-reu 3366 df-rab 3413 df-v 3452 df-sbc 3739 df-csb 3847 df-ss 3896 df-pss 4014 df-dif 4047 df-in 4091 df-un 4151 df-nul 4279 df-if 4482 df-pw 4558 df-sn 4585 df-pr 4587 df-op 4835 df-uni 4867 df-int 4907 df-iun 4952 df-br 5103 df-opab 5167 df-mpt 5186 df-tr 5212 df-id 5545 df-eprel 5550 df-po 5558 df-so 5559 df-fr 5603 df-we 5605 df-xp 5656 df-rel 5657 df-cnv 5658 df-co 5659 df-dm 5660 df-rn 5661 df-res 5662 df-ima 5663 df-pred 6304 df-ord 6365 df-on 6366 df-lim 6367 df-suc 6368 df-iota 6494 df-fun 6540 df-fn 6541 df-f 6542 df-f1 6543 df-fo 6544 df-f1o 6545 df-fv 6546 df-riota 7377 df-ov 7423 df-oprab 7424 df-mpo 7425 df-om 7878 df-1st 8001 df-2nd 8002 df-frecs 8302 df-wrecs 8333 df-recs 8382 df-rdg 8421 df-1o 8479 df-er 8720 df-en 8977 df-dom 8978 df-sdom 8979 df-fin 8980 df-card 10023 df-pnf 11348 df-mnf 11349 df-xr 11350 df-ltxr 11351 df-le 11352 df-sub 11546 df-neg 11547 df-nn 12339 df-2 12408 df-n0 12610 df-z 12697 df-uz 12969 df-fz 13643 df-hash 14478 df-vtx 29581 df-iedg 29582 df-edg 29631 df-uhgr 29641 df-upgr 29665 df-uspgr 29736 df-usgr 29737 |
| This theorem is used by: fusgrfis 29916 |
| Copyright terms: Public domain | W3C validator |