| 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 29477. Main work is done in uhgr0v0e 29385. (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 29333 | . . . . 5 ⊢ (〈𝑉, 𝐸〉 ∈ USGraph → 〈𝑉, 𝐸〉 ∈ UHGraph) | |
| 2 | 1 | 3ad2ant2 1146 | . . . 4 ⊢ (((𝑉 ∈ 𝑋 ∧ 𝐸 ∈ 𝑌) ∧ 〈𝑉, 𝐸〉 ∈ USGraph ∧ (♯‘𝑉) = 0) → 〈𝑉, 𝐸〉 ∈ UHGraph) |
| 3 | opvtxfv 29151 | . . . . . 6 ⊢ ((𝑉 ∈ 𝑋 ∧ 𝐸 ∈ 𝑌) → (Vtx‘〈𝑉, 𝐸〉) = 𝑉) | |
| 4 | 3 | 3ad2ant1 1145 | . . . . 5 ⊢ (((𝑉 ∈ 𝑋 ∧ 𝐸 ∈ 𝑌) ∧ 〈𝑉, 𝐸〉 ∈ USGraph ∧ (♯‘𝑉) = 0) → (Vtx‘〈𝑉, 𝐸〉) = 𝑉) |
| 5 | hasheq0 14373 | . . . . . . . . 9 ⊢ (𝑉 ∈ 𝑋 → ((♯‘𝑉) = 0 ↔ 𝑉 = ∅)) | |
| 6 | 5 | biimpd 231 | . . . . . . . 8 ⊢ (𝑉 ∈ 𝑋 → ((♯‘𝑉) = 0 → 𝑉 = ∅)) |
| 7 | 6 | adantr 484 | . . . . . . 7 ⊢ ((𝑉 ∈ 𝑋 ∧ 𝐸 ∈ 𝑌) → ((♯‘𝑉) = 0 → 𝑉 = ∅)) |
| 8 | 7 | a1d 25 | . . . . . 6 ⊢ ((𝑉 ∈ 𝑋 ∧ 𝐸 ∈ 𝑌) → (〈𝑉, 𝐸〉 ∈ USGraph → ((♯‘𝑉) = 0 → 𝑉 = ∅))) |
| 9 | 8 | 3imp 1122 | . . . . 5 ⊢ (((𝑉 ∈ 𝑋 ∧ 𝐸 ∈ 𝑌) ∧ 〈𝑉, 𝐸〉 ∈ USGraph ∧ (♯‘𝑉) = 0) → 𝑉 = ∅) |
| 10 | 4, 9 | eqtrd 2796 | . . . 4 ⊢ (((𝑉 ∈ 𝑋 ∧ 𝐸 ∈ 𝑌) ∧ 〈𝑉, 𝐸〉 ∈ USGraph ∧ (♯‘𝑉) = 0) → (Vtx‘〈𝑉, 𝐸〉) = ∅) |
| 11 | eqid 2761 | . . . . 5 ⊢ (Vtx‘〈𝑉, 𝐸〉) = (Vtx‘〈𝑉, 𝐸〉) | |
| 12 | eqid 2761 | . . . . 5 ⊢ (Edg‘〈𝑉, 𝐸〉) = (Edg‘〈𝑉, 𝐸〉) | |
| 13 | 11, 12 | uhgr0v0e 29385 | . . . 4 ⊢ ((〈𝑉, 𝐸〉 ∈ UHGraph ∧ (Vtx‘〈𝑉, 𝐸〉) = ∅) → (Edg‘〈𝑉, 𝐸〉) = ∅) |
| 14 | 2, 10, 13 | syl2anc 593 | . . 3 ⊢ (((𝑉 ∈ 𝑋 ∧ 𝐸 ∈ 𝑌) ∧ 〈𝑉, 𝐸〉 ∈ USGraph ∧ (♯‘𝑉) = 0) → (Edg‘〈𝑉, 𝐸〉) = ∅) |
| 15 | 0fi 9019 | . . 3 ⊢ ∅ ∈ Fin | |
| 16 | 14, 15 | eqeltrdi 2869 | . 2 ⊢ (((𝑉 ∈ 𝑋 ∧ 𝐸 ∈ 𝑌) ∧ 〈𝑉, 𝐸〉 ∈ USGraph ∧ (♯‘𝑉) = 0) → (Edg‘〈𝑉, 𝐸〉) ∈ Fin) |
| 17 | eqid 2761 | . . . . 5 ⊢ (iEdg‘〈𝑉, 𝐸〉) = (iEdg‘〈𝑉, 𝐸〉) | |
| 18 | 17, 12 | usgredgffibi 29471 | . . . 4 ⊢ (〈𝑉, 𝐸〉 ∈ USGraph → ((Edg‘〈𝑉, 𝐸〉) ∈ Fin ↔ (iEdg‘〈𝑉, 𝐸〉) ∈ Fin)) |
| 19 | 18 | 3ad2ant2 1146 | . . 3 ⊢ (((𝑉 ∈ 𝑋 ∧ 𝐸 ∈ 𝑌) ∧ 〈𝑉, 𝐸〉 ∈ USGraph ∧ (♯‘𝑉) = 0) → ((Edg‘〈𝑉, 𝐸〉) ∈ Fin ↔ (iEdg‘〈𝑉, 𝐸〉) ∈ Fin)) |
| 20 | opiedgfv 29154 | . . . . 5 ⊢ ((𝑉 ∈ 𝑋 ∧ 𝐸 ∈ 𝑌) → (iEdg‘〈𝑉, 𝐸〉) = 𝐸) | |
| 21 | 20 | 3ad2ant1 1145 | . . . 4 ⊢ (((𝑉 ∈ 𝑋 ∧ 𝐸 ∈ 𝑌) ∧ 〈𝑉, 𝐸〉 ∈ USGraph ∧ (♯‘𝑉) = 0) → (iEdg‘〈𝑉, 𝐸〉) = 𝐸) |
| 22 | 21 | eleq1d 2846 | . . 3 ⊢ (((𝑉 ∈ 𝑋 ∧ 𝐸 ∈ 𝑌) ∧ 〈𝑉, 𝐸〉 ∈ USGraph ∧ (♯‘𝑉) = 0) → ((iEdg‘〈𝑉, 𝐸〉) ∈ Fin ↔ 𝐸 ∈ Fin)) |
| 23 | 19, 22 | bitrd 281 | . 2 ⊢ (((𝑉 ∈ 𝑋 ∧ 𝐸 ∈ 𝑌) ∧ 〈𝑉, 𝐸〉 ∈ USGraph ∧ (♯‘𝑉) = 0) → ((Edg‘〈𝑉, 𝐸〉) ∈ Fin ↔ 𝐸 ∈ Fin)) |
| 24 | 16, 23 | mpbid 234 | 1 ⊢ (((𝑉 ∈ 𝑋 ∧ 𝐸 ∈ 𝑌) ∧ 〈𝑉, 𝐸〉 ∈ USGraph ∧ (♯‘𝑉) = 0) → 𝐸 ∈ Fin) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 208 ∧ wa 399 ∧ w3a 1097 = wceq 1559 ∈ wcel 2141 ∅c0 4285 〈cop 4587 ‘cfv 6517 Fincfn 8923 0cc0 11070 ♯chash 14340 Vtxcvtx 29143 iEdgciedg 29144 Edgcedg 29194 UHGraphcuhgr 29203 USGraphcusgr 29296 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1814 ax-4 1828 ax-5 1929 ax-6 1986 ax-7 2027 ax-8 2143 ax-9 2151 ax-10 2174 ax-11 2190 ax-12 2211 ax-ext 2733 ax-rep 5226 ax-sep 5245 ax-nul 5255 ax-pow 5321 ax-pr 5389 ax-un 7714 ax-cnex 11126 ax-resscn 11127 ax-1cn 11128 ax-icn 11129 ax-addcl 11130 ax-addrcl 11131 ax-mulcl 11132 ax-mulrcl 11133 ax-mulcom 11134 ax-addass 11135 ax-mulass 11136 ax-distr 11137 ax-i2m1 11138 ax-1ne0 11139 ax-1rid 11140 ax-rnegex 11141 ax-rrecex 11142 ax-cnre 11143 ax-pre-lttri 11144 ax-pre-lttrn 11145 ax-pre-ltadd 11146 ax-pre-mulgt0 11147 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3or 1098 df-3an 1099 df-tru 1562 df-fal 1572 df-ex 1799 df-nf 1803 df-sb 2090 df-mo 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-nel 3061 df-ral 3076 df-rex 3086 df-reu 3367 df-rab 3414 df-v 3455 df-sbc 3745 df-csb 3853 df-dif 3907 df-un 3909 df-in 3911 df-ss 3921 df-pss 3924 df-nul 4286 df-if 4480 df-pw 4556 df-sn 4582 df-pr 4584 df-op 4588 df-uni 4865 df-int 4905 df-iun 4950 df-br 5100 df-opab 5162 df-mpt 5181 df-tr 5207 df-id 5540 df-eprel 5545 df-po 5553 df-so 5554 df-fr 5598 df-we 5600 df-xp 5651 df-rel 5652 df-cnv 5653 df-co 5654 df-dm 5655 df-rn 5656 df-res 5657 df-ima 5658 df-pred 6284 df-ord 6345 df-on 6346 df-lim 6347 df-suc 6348 df-iota 6473 df-fun 6519 df-fn 6520 df-f 6521 df-f1 6522 df-fo 6523 df-f1o 6524 df-fv 6525 df-riota 7349 df-ov 7395 df-oprab 7396 df-mpo 7397 df-om 7843 df-1st 7966 df-2nd 7967 df-frecs 8257 df-wrecs 8288 df-recs 8337 df-rdg 8376 df-1o 8432 df-er 8673 df-en 8924 df-dom 8925 df-sdom 8926 df-fin 8927 df-card 9894 df-pnf 11215 df-mnf 11216 df-xr 11217 df-ltxr 11218 df-le 11219 df-sub 11413 df-neg 11414 df-nn 12208 df-2 12277 df-n0 12479 df-z 12566 df-uz 12837 df-fz 13510 df-hash 14341 df-vtx 29145 df-iedg 29146 df-edg 29195 df-uhgr 29205 df-upgr 29229 df-uspgr 29297 df-usgr 29298 |
| This theorem is referenced by: fusgrfis 29477 |
| Copyright terms: Public domain | W3C validator |