| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > frrusgrord0lem | Structured version Visualization version GIF version | ||
| Description: Lemma for frrusgrord0 31000. (Contributed by AV, 12-Jan-2022.) |
| Ref | Expression |
|---|---|
| frrusgrord0.v | ⊢ 𝑉 = (Vtx‘𝐺) |
| Ref | Expression |
|---|---|
| frrusgrord0lem | ⊢ (((𝐺 ∈ FriendGraph ∧ 𝑉 ∈ Fin ∧ 𝑉 ≠ ∅) ∧ ∀𝑣 ∈ 𝑉 ((VtxDeg‘𝐺)‘𝑣) = 𝐾) → (𝐾 ∈ ℂ ∧ (♯‘𝑉) ∈ ℂ ∧ (♯‘𝑉) ≠ 0)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | frgrusgr 30921 | . . . . . . 7 ⊢ (𝐺 ∈ FriendGraph → 𝐺 ∈ USGraph) | |
| 2 | 1 | anim1i 627 | . . . . . 6 ⊢ ((𝐺 ∈ FriendGraph ∧ 𝑉 ∈ Fin) → (𝐺 ∈ USGraph ∧ 𝑉 ∈ Fin)) |
| 3 | frrusgrord0.v | . . . . . . 7 ⊢ 𝑉 = (Vtx‘𝐺) | |
| 4 | 3 | isfusgr 29958 | . . . . . 6 ⊢ (𝐺 ∈ FinUSGraph ↔ (𝐺 ∈ USGraph ∧ 𝑉 ∈ Fin)) |
| 5 | 2, 4 | sylibr 237 | . . . . 5 ⊢ ((𝐺 ∈ FriendGraph ∧ 𝑉 ∈ Fin) → 𝐺 ∈ FinUSGraph) |
| 6 | eqid 2766 | . . . . . 6 ⊢ (VtxDeg‘𝐺) = (VtxDeg‘𝐺) | |
| 7 | 3, 6 | fusgrregdegfi 30209 | . . . . 5 ⊢ ((𝐺 ∈ FinUSGraph ∧ 𝑉 ≠ ∅) → (∀𝑣 ∈ 𝑉 ((VtxDeg‘𝐺)‘𝑣) = 𝐾 → 𝐾 ∈ ℕ0)) |
| 8 | 5, 7 | stoic3 1811 | . . . 4 ⊢ ((𝐺 ∈ FriendGraph ∧ 𝑉 ∈ Fin ∧ 𝑉 ≠ ∅) → (∀𝑣 ∈ 𝑉 ((VtxDeg‘𝐺)‘𝑣) = 𝐾 → 𝐾 ∈ ℕ0)) |
| 9 | 8 | imp 412 | . . 3 ⊢ (((𝐺 ∈ FriendGraph ∧ 𝑉 ∈ Fin ∧ 𝑉 ≠ ∅) ∧ ∀𝑣 ∈ 𝑉 ((VtxDeg‘𝐺)‘𝑣) = 𝐾) → 𝐾 ∈ ℕ0) |
| 10 | 9 | nn0cnd 12708 | . 2 ⊢ (((𝐺 ∈ FriendGraph ∧ 𝑉 ∈ Fin ∧ 𝑉 ≠ ∅) ∧ ∀𝑣 ∈ 𝑉 ((VtxDeg‘𝐺)‘𝑣) = 𝐾) → 𝐾 ∈ ℂ) |
| 11 | hashcl 14540 | . . . . 5 ⊢ (𝑉 ∈ Fin → (♯‘𝑉) ∈ ℕ0) | |
| 12 | 11 | nn0cnd 12708 | . . . 4 ⊢ (𝑉 ∈ Fin → (♯‘𝑉) ∈ ℂ) |
| 13 | 12 | 3ad2ant2 1153 | . . 3 ⊢ ((𝐺 ∈ FriendGraph ∧ 𝑉 ∈ Fin ∧ 𝑉 ≠ ∅) → (♯‘𝑉) ∈ ℂ) |
| 14 | 13 | adantr 486 | . 2 ⊢ (((𝐺 ∈ FriendGraph ∧ 𝑉 ∈ Fin ∧ 𝑉 ≠ ∅) ∧ ∀𝑣 ∈ 𝑉 ((VtxDeg‘𝐺)‘𝑣) = 𝐾) → (♯‘𝑉) ∈ ℂ) |
| 15 | hasheq0 14547 | . . . . . . 7 ⊢ (𝑉 ∈ Fin → ((♯‘𝑉) = 0 ↔ 𝑉 = ∅)) | |
| 16 | 15 | biimpd 232 | . . . . . 6 ⊢ (𝑉 ∈ Fin → ((♯‘𝑉) = 0 → 𝑉 = ∅)) |
| 17 | 16 | necon3d 2983 | . . . . 5 ⊢ (𝑉 ∈ Fin → (𝑉 ≠ ∅ → (♯‘𝑉) ≠ 0)) |
| 18 | 17 | imp 412 | . . . 4 ⊢ ((𝑉 ∈ Fin ∧ 𝑉 ≠ ∅) → (♯‘𝑉) ≠ 0) |
| 19 | 18 | 3adant1 1149 | . . 3 ⊢ ((𝐺 ∈ FriendGraph ∧ 𝑉 ∈ Fin ∧ 𝑉 ≠ ∅) → (♯‘𝑉) ≠ 0) |
| 20 | 19 | adantr 486 | . 2 ⊢ (((𝐺 ∈ FriendGraph ∧ 𝑉 ∈ Fin ∧ 𝑉 ≠ ∅) ∧ ∀𝑣 ∈ 𝑉 ((VtxDeg‘𝐺)‘𝑣) = 𝐾) → (♯‘𝑉) ≠ 0) |
| 21 | 10, 14, 20 | 3jca 1147 | 1 ⊢ (((𝐺 ∈ FriendGraph ∧ 𝑉 ∈ Fin ∧ 𝑉 ≠ ∅) ∧ ∀𝑣 ∈ 𝑉 ((VtxDeg‘𝐺)‘𝑣) = 𝐾) → (𝐾 ∈ ℂ ∧ (♯‘𝑉) ∈ ℂ ∧ (♯‘𝑉) ≠ 0)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 ∧ w3a 1104 = wceq 1572 ∈ wcel 2150 ≠ wne 2962 ∀wral 3083 ∅c0 4280 ‘cfv 6565 Fincfn 9010 ℂcc 11236 0cc0 11238 ℕ0cn0 12645 ♯chash 14514 Vtxcvtx 29633 USGraphcusgr 29789 FinUSGraphcfusgr 29956 VtxDegcvtxdg 30105 FriendGraph cfrgr 30918 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1830 ax-4 1844 ax-5 1947 ax-6 2004 ax-7 2045 ax-8 2152 ax-9 2160 ax-10 2183 ax-11 2200 ax-12 2219 ax-ext 2738 ax-rep 5237 ax-sep 5254 ax-nul 5265 ax-pow 5333 ax-pr 5397 ax-un 7782 ax-cnex 11294 ax-resscn 11295 ax-1cn 11296 ax-icn 11297 ax-addcl 11298 ax-addrcl 11299 ax-mulcl 11300 ax-mulrcl 11301 ax-mulcom 11302 ax-addass 11303 ax-mulass 11304 ax-distr 11305 ax-i2m1 11306 ax-1ne0 11307 ax-1rid 11308 ax-rnegex 11309 ax-rrecex 11310 ax-cnre 11311 ax-pre-lttri 11312 ax-pre-lttrn 11313 ax-pre-ltadd 11314 ax-pre-mulgt0 11315 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1105 df-3an 1106 df-tru 1575 df-fal 1585 df-ex 1815 df-nf 1819 df-sb 2104 df-mo 2570 df-eu 2600 df-clab 2745 df-cleq 2758 df-clel 2842 df-nfc 2916 df-ne 2963 df-nel 3069 df-ral 3084 df-rex 3094 df-rmo 3368 df-reu 3369 df-rab 3416 df-v 3455 df-sbc 3742 df-csb 3851 df-ss 3900 df-pss 4016 df-dif 4049 df-in 4093 df-un 4153 df-nul 4281 df-if 4485 df-pw 4561 df-sn 4588 df-pr 4590 df-op 4840 df-uni 4872 df-int 4912 df-iun 4957 df-br 5108 df-opab 5173 df-mpt 5192 df-tr 5218 df-id 5552 df-eprel 5557 df-po 5565 df-so 5566 df-fr 5610 df-we 5612 df-xp 5663 df-rel 5664 df-cnv 5665 df-co 5666 df-dm 5667 df-rn 5668 df-res 5669 df-ima 5670 df-pred 6329 df-ord 6390 df-on 6391 df-lim 6392 df-suc 6393 df-iota 6519 df-fun 6567 df-fn 6568 df-f 6569 df-f1 6570 df-fo 6571 df-f1o 6572 df-fv 6573 df-riota 7407 df-ov 7453 df-oprab 7454 df-mpo 7455 df-om 7911 df-1st 8034 df-2nd 8035 df-frecs 8336 df-wrecs 8367 df-recs 8416 df-rdg 8455 df-1o 8513 df-2o 8514 df-oadd 8517 df-er 8754 df-en 9011 df-dom 9012 df-sdom 9013 df-fin 9014 df-dju 10018 df-card 10056 df-pnf 11383 df-mnf 11384 df-xr 11385 df-ltxr 11386 df-le 11387 df-sub 11581 df-neg 11582 df-nn 12375 df-2 12444 df-n0 12646 df-xnn0 12719 df-z 12733 df-uz 13005 df-xadd 13281 df-fz 13679 df-hash 14515 df-vtx 29635 df-iedg 29636 df-edg 29685 df-uhgr 29695 df-upgr 29719 df-umgr 29720 df-uspgr 29790 df-usgr 29791 df-fusgr 29957 df-vtxdg 30106 df-frgr 30919 |
| This theorem is used by: frrusgrord0 31000 |
| Copyright terms: Public domain | W3C validator |