| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > 0wlkonlem1 | Structured version Visualization version GIF version | ||
| Description: Lemma 1 for 0wlkon 30022 and 0trlon 30026. (Contributed by AV, 3-Jan-2021.) (Revised by AV, 23-Mar-2021.) |
| Ref | Expression |
|---|---|
| 0wlk.v | ⊢ 𝑉 = (Vtx‘𝐺) |
| Ref | Expression |
|---|---|
| 0wlkonlem1 | ⊢ ((𝑃:(0...0)⟶𝑉 ∧ (𝑃‘0) = 𝑁) → (𝑁 ∈ 𝑉 ∧ 𝑁 ∈ 𝑉)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | id 22 | . . . . 5 ⊢ (𝑃:(0...0)⟶𝑉 → 𝑃:(0...0)⟶𝑉) | |
| 2 | 0nn0 12433 | . . . . . 6 ⊢ 0 ∈ ℕ0 | |
| 3 | 0elfz 13561 | . . . . . 6 ⊢ (0 ∈ ℕ0 → 0 ∈ (0...0)) | |
| 4 | 2, 3 | mp1i 13 | . . . . 5 ⊢ (𝑃:(0...0)⟶𝑉 → 0 ∈ (0...0)) |
| 5 | 1, 4 | ffvelcdmd 7039 | . . . 4 ⊢ (𝑃:(0...0)⟶𝑉 → (𝑃‘0) ∈ 𝑉) |
| 6 | 5 | adantr 480 | . . 3 ⊢ ((𝑃:(0...0)⟶𝑉 ∧ (𝑃‘0) = 𝑁) → (𝑃‘0) ∈ 𝑉) |
| 7 | eleq1 2816 | . . . . 5 ⊢ (𝑁 = (𝑃‘0) → (𝑁 ∈ 𝑉 ↔ (𝑃‘0) ∈ 𝑉)) | |
| 8 | 7 | eqcoms 2737 | . . . 4 ⊢ ((𝑃‘0) = 𝑁 → (𝑁 ∈ 𝑉 ↔ (𝑃‘0) ∈ 𝑉)) |
| 9 | 8 | adantl 481 | . . 3 ⊢ ((𝑃:(0...0)⟶𝑉 ∧ (𝑃‘0) = 𝑁) → (𝑁 ∈ 𝑉 ↔ (𝑃‘0) ∈ 𝑉)) |
| 10 | 6, 9 | mpbird 257 | . 2 ⊢ ((𝑃:(0...0)⟶𝑉 ∧ (𝑃‘0) = 𝑁) → 𝑁 ∈ 𝑉) |
| 11 | id 22 | . 2 ⊢ (𝑁 ∈ 𝑉 → 𝑁 ∈ 𝑉) | |
| 12 | 10, 11 | jccir 521 | 1 ⊢ ((𝑃:(0...0)⟶𝑉 ∧ (𝑃‘0) = 𝑁) → (𝑁 ∈ 𝑉 ∧ 𝑁 ∈ 𝑉)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 = wceq 1540 ∈ wcel 2109 ⟶wf 6495 ‘cfv 6499 (class class class)co 7369 0cc0 11044 ℕ0cn0 12418 ...cfz 13444 Vtxcvtx 28899 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2701 ax-sep 5246 ax-nul 5256 ax-pow 5315 ax-pr 5382 ax-un 7691 ax-cnex 11100 ax-resscn 11101 ax-1cn 11102 ax-icn 11103 ax-addcl 11104 ax-addrcl 11105 ax-mulcl 11106 ax-mulrcl 11107 ax-mulcom 11108 ax-addass 11109 ax-mulass 11110 ax-distr 11111 ax-i2m1 11112 ax-1ne0 11113 ax-1rid 11114 ax-rnegex 11115 ax-rrecex 11116 ax-cnre 11117 ax-pre-lttri 11118 ax-pre-lttrn 11119 ax-pre-ltadd 11120 ax-pre-mulgt0 11121 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2533 df-eu 2562 df-clab 2708 df-cleq 2721 df-clel 2803 df-nfc 2878 df-ne 2926 df-nel 3030 df-ral 3045 df-rex 3054 df-reu 3352 df-rab 3403 df-v 3446 df-sbc 3751 df-csb 3860 df-dif 3914 df-un 3916 df-in 3918 df-ss 3928 df-pss 3931 df-nul 4293 df-if 4485 df-pw 4561 df-sn 4586 df-pr 4588 df-op 4592 df-uni 4868 df-iun 4953 df-br 5103 df-opab 5165 df-mpt 5184 df-tr 5210 df-id 5526 df-eprel 5531 df-po 5539 df-so 5540 df-fr 5584 df-we 5586 df-xp 5637 df-rel 5638 df-cnv 5639 df-co 5640 df-dm 5641 df-rn 5642 df-res 5643 df-ima 5644 df-pred 6262 df-ord 6323 df-on 6324 df-lim 6325 df-suc 6326 df-iota 6452 df-fun 6501 df-fn 6502 df-f 6503 df-f1 6504 df-fo 6505 df-f1o 6506 df-fv 6507 df-riota 7326 df-ov 7372 df-oprab 7373 df-mpo 7374 df-om 7823 df-1st 7947 df-2nd 7948 df-frecs 8237 df-wrecs 8268 df-recs 8317 df-rdg 8355 df-er 8648 df-en 8896 df-dom 8897 df-sdom 8898 df-pnf 11186 df-mnf 11187 df-xr 11188 df-ltxr 11189 df-le 11190 df-sub 11383 df-neg 11384 df-nn 12163 df-n0 12419 df-z 12506 df-uz 12770 df-fz 13445 |
| This theorem is referenced by: 0wlkon 30022 0trlon 30026 0pthon 30029 |
| Copyright terms: Public domain | W3C validator |