| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > 0pthon | Structured version Visualization version GIF version | ||
| Description: A path of length 0 from a vertex to itself. (Contributed by Alexander van der Vekens, 3-Dec-2017.) (Revised by AV, 20-Jan-2021.) (Revised by AV, 30-Oct-2021.) |
| Ref | Expression |
|---|---|
| 0pthon.v | ⊢ 𝑉 = (Vtx‘𝐺) |
| Ref | Expression |
|---|---|
| 0pthon | ⊢ ((𝑃:(0...0)⟶𝑉 ∧ (𝑃‘0) = 𝑁) → ∅(𝑁(PathsOn‘𝐺)𝑁)𝑃) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | 0pthon.v | . . 3 ⊢ 𝑉 = (Vtx‘𝐺) | |
| 2 | 1 | 0trlon 30727 | . 2 ⊢ ((𝑃:(0...0)⟶𝑉 ∧ (𝑃‘0) = 𝑁) → ∅(𝑁(TrailsOn‘𝐺)𝑁)𝑃) |
| 3 | simpl 488 | . . 3 ⊢ ((𝑃:(0...0)⟶𝑉 ∧ (𝑃‘0) = 𝑁) → 𝑃:(0...0)⟶𝑉) | |
| 4 | id 23 | . . . . . . 7 ⊢ (𝑃:(0...0)⟶𝑉 → 𝑃:(0...0)⟶𝑉) | |
| 5 | 0z 12714 | . . . . . . . 8 ⊢ 0 ∈ ℤ | |
| 6 | elfz3 13677 | . . . . . . . 8 ⊢ (0 ∈ ℤ → 0 ∈ (0...0)) | |
| 7 | 5, 6 | mp1i 14 | . . . . . . 7 ⊢ (𝑃:(0...0)⟶𝑉 → 0 ∈ (0...0)) |
| 8 | 4, 7 | ffvelcdmd 7093 | . . . . . 6 ⊢ (𝑃:(0...0)⟶𝑉 → (𝑃‘0) ∈ 𝑉) |
| 9 | 8 | adantr 486 | . . . . 5 ⊢ ((𝑃:(0...0)⟶𝑉 ∧ (𝑃‘0) = 𝑁) → (𝑃‘0) ∈ 𝑉) |
| 10 | eleq1 2851 | . . . . . 6 ⊢ ((𝑃‘0) = 𝑁 → ((𝑃‘0) ∈ 𝑉 ↔ 𝑁 ∈ 𝑉)) | |
| 11 | 10 | adantl 487 | . . . . 5 ⊢ ((𝑃:(0...0)⟶𝑉 ∧ (𝑃‘0) = 𝑁) → ((𝑃‘0) ∈ 𝑉 ↔ 𝑁 ∈ 𝑉)) |
| 12 | 9, 11 | mpbid 235 | . . . 4 ⊢ ((𝑃:(0...0)⟶𝑉 ∧ (𝑃‘0) = 𝑁) → 𝑁 ∈ 𝑉) |
| 13 | 1 | 1vgrex 29592 | . . . 4 ⊢ (𝑁 ∈ 𝑉 → 𝐺 ∈ V) |
| 14 | 1 | 0pth 30728 | . . . 4 ⊢ (𝐺 ∈ V → (∅(Paths‘𝐺)𝑃 ↔ 𝑃:(0...0)⟶𝑉)) |
| 15 | 12, 13, 14 | 3syl 19 | . . 3 ⊢ ((𝑃:(0...0)⟶𝑉 ∧ (𝑃‘0) = 𝑁) → (∅(Paths‘𝐺)𝑃 ↔ 𝑃:(0...0)⟶𝑉)) |
| 16 | 3, 15 | mpbird 260 | . 2 ⊢ ((𝑃:(0...0)⟶𝑉 ∧ (𝑃‘0) = 𝑁) → ∅(Paths‘𝐺)𝑃) |
| 17 | 1 | 0wlkonlem1 30721 | . . 3 ⊢ ((𝑃:(0...0)⟶𝑉 ∧ (𝑃‘0) = 𝑁) → (𝑁 ∈ 𝑉 ∧ 𝑁 ∈ 𝑉)) |
| 18 | 1 | 0wlkonlem2 30722 | . . . 4 ⊢ ((𝑃:(0...0)⟶𝑉 ∧ (𝑃‘0) = 𝑁) → 𝑃 ∈ (𝑉 ↑pm (0...0))) |
| 19 | 0ex 5263 | . . . 4 ⊢ ∅ ∈ V | |
| 20 | 18, 19 | jctil 529 | . . 3 ⊢ ((𝑃:(0...0)⟶𝑉 ∧ (𝑃‘0) = 𝑁) → (∅ ∈ V ∧ 𝑃 ∈ (𝑉 ↑pm (0...0)))) |
| 21 | 1 | ispthson 30340 | . . 3 ⊢ (((𝑁 ∈ 𝑉 ∧ 𝑁 ∈ 𝑉) ∧ (∅ ∈ V ∧ 𝑃 ∈ (𝑉 ↑pm (0...0)))) → (∅(𝑁(PathsOn‘𝐺)𝑁)𝑃 ↔ (∅(𝑁(TrailsOn‘𝐺)𝑁)𝑃 ∧ ∅(Paths‘𝐺)𝑃))) |
| 22 | 17, 20, 21 | syl2anc 596 | . 2 ⊢ ((𝑃:(0...0)⟶𝑉 ∧ (𝑃‘0) = 𝑁) → (∅(𝑁(PathsOn‘𝐺)𝑁)𝑃 ↔ (∅(𝑁(TrailsOn‘𝐺)𝑁)𝑃 ∧ ∅(Paths‘𝐺)𝑃))) |
| 23 | 2, 16, 22 | mpbir2and 726 | 1 ⊢ ((𝑃:(0...0)⟶𝑉 ∧ (𝑃‘0) = 𝑁) → ∅(𝑁(PathsOn‘𝐺)𝑁)𝑃) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 = wceq 1569 ∈ wcel 2146 Vcvv 3453 ∅c0 4280 class class class wbr 5105 ⟶wf 6542 ‘cfv 6546 (class class class)co 7427 ↑pm cpm 8859 0cc0 11210 ℤcz 12703 ...cfz 13649 Vtxcvtx 29586 TrailsOnctrlson 30286 Pathscpths 30307 PathsOncpthson 30309 |
| 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 1944 ax-6 2001 ax-7 2042 ax-8 2148 ax-9 2156 ax-10 2179 ax-11 2196 ax-12 2215 ax-ext 2735 ax-rep 5234 ax-sep 5251 ax-nul 5262 ax-pow 5330 ax-pr 5394 ax-un 7758 ax-cnex 11266 ax-resscn 11267 ax-1cn 11268 ax-icn 11269 ax-addcl 11270 ax-addrcl 11271 ax-mulcl 11272 ax-mulrcl 11273 ax-mulcom 11274 ax-addass 11275 ax-mulass 11276 ax-distr 11277 ax-i2m1 11278 ax-1ne0 11279 ax-1rid 11280 ax-rnegex 11281 ax-rrecex 11282 ax-cnre 11283 ax-pre-lttri 11284 ax-pre-lttrn 11285 ax-pre-ltadd 11286 ax-pre-mulgt0 11287 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-ifp 1079 df-3or 1104 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2101 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2838 df-nfc 2912 df-ne 2959 df-nel 3065 df-ral 3080 df-rex 3090 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 4838 df-uni 4870 df-int 4910 df-iun 4955 df-br 5106 df-opab 5170 df-mpt 5189 df-tr 5215 df-id 5549 df-eprel 5554 df-po 5562 df-so 5563 df-fr 5607 df-we 5609 df-xp 5660 df-rel 5661 df-cnv 5662 df-co 5663 df-dm 5664 df-rn 5665 df-res 5666 df-ima 5667 df-pred 6310 df-ord 6371 df-on 6372 df-lim 6373 df-suc 6374 df-iota 6500 df-fun 6548 df-fn 6549 df-f 6550 df-f1 6551 df-fo 6552 df-f1o 6553 df-fv 6554 df-riota 7384 df-ov 7430 df-oprab 7431 df-mpo 7432 df-om 7885 df-1st 8008 df-2nd 8009 df-frecs 8310 df-wrecs 8341 df-recs 8390 df-rdg 8429 df-1o 8487 df-er 8728 df-map 8860 df-pm 8861 df-en 8985 df-dom 8986 df-sdom 8987 df-fin 8988 df-card 10030 df-pnf 11355 df-mnf 11356 df-xr 11357 df-ltxr 11358 df-le 11359 df-sub 11553 df-neg 11554 df-nn 12346 df-n0 12617 df-z 12704 df-uz 12976 df-fz 13650 df-fzo 13799 df-hash 14485 df-word 14669 df-wlks 30192 df-wlkson 30193 df-trls 30287 df-trlson 30288 df-pths 30311 df-pthson 30313 |
| This theorem is used by: 0pthon1 30731 |
| Copyright terms: Public domain | W3C validator |