![]() |
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 27496 | . 2 ⊢ ((𝑃:(0...0)⟶𝑉 ∧ (𝑃‘0) = 𝑁) → ∅(𝑁(TrailsOn‘𝐺)𝑁)𝑃) |
3 | simpl 476 | . . 3 ⊢ ((𝑃:(0...0)⟶𝑉 ∧ (𝑃‘0) = 𝑁) → 𝑃:(0...0)⟶𝑉) | |
4 | id 22 | . . . . . . 7 ⊢ (𝑃:(0...0)⟶𝑉 → 𝑃:(0...0)⟶𝑉) | |
5 | 0z 11722 | . . . . . . . 8 ⊢ 0 ∈ ℤ | |
6 | elfz3 12651 | . . . . . . . 8 ⊢ (0 ∈ ℤ → 0 ∈ (0...0)) | |
7 | 5, 6 | mp1i 13 | . . . . . . 7 ⊢ (𝑃:(0...0)⟶𝑉 → 0 ∈ (0...0)) |
8 | 4, 7 | ffvelrnd 6614 | . . . . . 6 ⊢ (𝑃:(0...0)⟶𝑉 → (𝑃‘0) ∈ 𝑉) |
9 | 8 | adantr 474 | . . . . 5 ⊢ ((𝑃:(0...0)⟶𝑉 ∧ (𝑃‘0) = 𝑁) → (𝑃‘0) ∈ 𝑉) |
10 | eleq1 2894 | . . . . . 6 ⊢ ((𝑃‘0) = 𝑁 → ((𝑃‘0) ∈ 𝑉 ↔ 𝑁 ∈ 𝑉)) | |
11 | 10 | adantl 475 | . . . . 5 ⊢ ((𝑃:(0...0)⟶𝑉 ∧ (𝑃‘0) = 𝑁) → ((𝑃‘0) ∈ 𝑉 ↔ 𝑁 ∈ 𝑉)) |
12 | 9, 11 | mpbid 224 | . . . 4 ⊢ ((𝑃:(0...0)⟶𝑉 ∧ (𝑃‘0) = 𝑁) → 𝑁 ∈ 𝑉) |
13 | 1 | 1vgrex 26307 | . . . 4 ⊢ (𝑁 ∈ 𝑉 → 𝐺 ∈ V) |
14 | 1 | 0pth 27497 | . . . 4 ⊢ (𝐺 ∈ V → (∅(Paths‘𝐺)𝑃 ↔ 𝑃:(0...0)⟶𝑉)) |
15 | 12, 13, 14 | 3syl 18 | . . 3 ⊢ ((𝑃:(0...0)⟶𝑉 ∧ (𝑃‘0) = 𝑁) → (∅(Paths‘𝐺)𝑃 ↔ 𝑃:(0...0)⟶𝑉)) |
16 | 3, 15 | mpbird 249 | . 2 ⊢ ((𝑃:(0...0)⟶𝑉 ∧ (𝑃‘0) = 𝑁) → ∅(Paths‘𝐺)𝑃) |
17 | 1 | 0wlkonlem1 27490 | . . 3 ⊢ ((𝑃:(0...0)⟶𝑉 ∧ (𝑃‘0) = 𝑁) → (𝑁 ∈ 𝑉 ∧ 𝑁 ∈ 𝑉)) |
18 | 1 | 0wlkonlem2 27491 | . . . 4 ⊢ ((𝑃:(0...0)⟶𝑉 ∧ (𝑃‘0) = 𝑁) → 𝑃 ∈ (𝑉 ↑pm (0...0))) |
19 | 0ex 5016 | . . . 4 ⊢ ∅ ∈ V | |
20 | 18, 19 | jctil 515 | . . 3 ⊢ ((𝑃:(0...0)⟶𝑉 ∧ (𝑃‘0) = 𝑁) → (∅ ∈ V ∧ 𝑃 ∈ (𝑉 ↑pm (0...0)))) |
21 | 1 | ispthson 27051 | . . 3 ⊢ (((𝑁 ∈ 𝑉 ∧ 𝑁 ∈ 𝑉) ∧ (∅ ∈ V ∧ 𝑃 ∈ (𝑉 ↑pm (0...0)))) → (∅(𝑁(PathsOn‘𝐺)𝑁)𝑃 ↔ (∅(𝑁(TrailsOn‘𝐺)𝑁)𝑃 ∧ ∅(Paths‘𝐺)𝑃))) |
22 | 17, 20, 21 | syl2anc 579 | . 2 ⊢ ((𝑃:(0...0)⟶𝑉 ∧ (𝑃‘0) = 𝑁) → (∅(𝑁(PathsOn‘𝐺)𝑁)𝑃 ↔ (∅(𝑁(TrailsOn‘𝐺)𝑁)𝑃 ∧ ∅(Paths‘𝐺)𝑃))) |
23 | 2, 16, 22 | mpbir2and 704 | 1 ⊢ ((𝑃:(0...0)⟶𝑉 ∧ (𝑃‘0) = 𝑁) → ∅(𝑁(PathsOn‘𝐺)𝑁)𝑃) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 198 ∧ wa 386 = wceq 1656 ∈ wcel 2164 Vcvv 3414 ∅c0 4146 class class class wbr 4875 ⟶wf 6123 ‘cfv 6127 (class class class)co 6910 ↑pm cpm 8128 0cc0 10259 ℤcz 11711 ...cfz 12626 Vtxcvtx 26301 TrailsOnctrlson 26999 Pathscpths 27021 PathsOncpthson 27023 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1894 ax-4 1908 ax-5 2009 ax-6 2075 ax-7 2112 ax-8 2166 ax-9 2173 ax-10 2192 ax-11 2207 ax-12 2220 ax-13 2389 ax-ext 2803 ax-rep 4996 ax-sep 5007 ax-nul 5015 ax-pow 5067 ax-pr 5129 ax-un 7214 ax-cnex 10315 ax-resscn 10316 ax-1cn 10317 ax-icn 10318 ax-addcl 10319 ax-addrcl 10320 ax-mulcl 10321 ax-mulrcl 10322 ax-mulcom 10323 ax-addass 10324 ax-mulass 10325 ax-distr 10326 ax-i2m1 10327 ax-1ne0 10328 ax-1rid 10329 ax-rnegex 10330 ax-rrecex 10331 ax-cnre 10332 ax-pre-lttri 10333 ax-pre-lttrn 10334 ax-pre-ltadd 10335 ax-pre-mulgt0 10336 |
This theorem depends on definitions: df-bi 199 df-an 387 df-or 879 df-ifp 1090 df-3or 1112 df-3an 1113 df-tru 1660 df-ex 1879 df-nf 1883 df-sb 2068 df-mo 2605 df-eu 2640 df-clab 2812 df-cleq 2818 df-clel 2821 df-nfc 2958 df-ne 3000 df-nel 3103 df-ral 3122 df-rex 3123 df-reu 3124 df-rab 3126 df-v 3416 df-sbc 3663 df-csb 3758 df-dif 3801 df-un 3803 df-in 3805 df-ss 3812 df-pss 3814 df-nul 4147 df-if 4309 df-pw 4382 df-sn 4400 df-pr 4402 df-tp 4404 df-op 4406 df-uni 4661 df-int 4700 df-iun 4744 df-br 4876 df-opab 4938 df-mpt 4955 df-tr 4978 df-id 5252 df-eprel 5257 df-po 5265 df-so 5266 df-fr 5305 df-we 5307 df-xp 5352 df-rel 5353 df-cnv 5354 df-co 5355 df-dm 5356 df-rn 5357 df-res 5358 df-ima 5359 df-pred 5924 df-ord 5970 df-on 5971 df-lim 5972 df-suc 5973 df-iota 6090 df-fun 6129 df-fn 6130 df-f 6131 df-f1 6132 df-fo 6133 df-f1o 6134 df-fv 6135 df-riota 6871 df-ov 6913 df-oprab 6914 df-mpt2 6915 df-om 7332 df-1st 7433 df-2nd 7434 df-wrecs 7677 df-recs 7739 df-rdg 7777 df-1o 7831 df-er 8014 df-map 8129 df-pm 8130 df-en 8229 df-dom 8230 df-sdom 8231 df-fin 8232 df-card 9085 df-pnf 10400 df-mnf 10401 df-xr 10402 df-ltxr 10403 df-le 10404 df-sub 10594 df-neg 10595 df-nn 11358 df-n0 11626 df-z 11712 df-uz 11976 df-fz 12627 df-fzo 12768 df-hash 13418 df-word 13582 df-wlks 26904 df-wlkson 26905 df-trls 27000 df-trlson 27001 df-pths 27025 df-pthson 27027 |
This theorem is referenced by: 0pthon1 27500 |
Copyright terms: Public domain | W3C validator |