Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > 2wlkdlem4 | Structured version Visualization version GIF version |
Description: Lemma 4 for 2wlkd 28017. (Contributed by AV, 14-Feb-2021.) |
Ref | Expression |
---|---|
2wlkd.p | ⊢ 𝑃 = 〈“𝐴𝐵𝐶”〉 |
2wlkd.f | ⊢ 𝐹 = 〈“𝐽𝐾”〉 |
2wlkd.s | ⊢ (𝜑 → (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) |
Ref | Expression |
---|---|
2wlkdlem4 | ⊢ (𝜑 → ∀𝑘 ∈ (0...(♯‘𝐹))(𝑃‘𝑘) ∈ 𝑉) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | 2wlkd.s | . . 3 ⊢ (𝜑 → (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) | |
2 | 2wlkd.p | . . . . 5 ⊢ 𝑃 = 〈“𝐴𝐵𝐶”〉 | |
3 | 2wlkd.f | . . . . 5 ⊢ 𝐹 = 〈“𝐽𝐾”〉 | |
4 | 2, 3, 1 | 2wlkdlem3 28008 | . . . 4 ⊢ (𝜑 → ((𝑃‘0) = 𝐴 ∧ (𝑃‘1) = 𝐵 ∧ (𝑃‘2) = 𝐶)) |
5 | simp1 1138 | . . . . . . 7 ⊢ (((𝑃‘0) = 𝐴 ∧ (𝑃‘1) = 𝐵 ∧ (𝑃‘2) = 𝐶) → (𝑃‘0) = 𝐴) | |
6 | 5 | eleq1d 2822 | . . . . . 6 ⊢ (((𝑃‘0) = 𝐴 ∧ (𝑃‘1) = 𝐵 ∧ (𝑃‘2) = 𝐶) → ((𝑃‘0) ∈ 𝑉 ↔ 𝐴 ∈ 𝑉)) |
7 | simp2 1139 | . . . . . . 7 ⊢ (((𝑃‘0) = 𝐴 ∧ (𝑃‘1) = 𝐵 ∧ (𝑃‘2) = 𝐶) → (𝑃‘1) = 𝐵) | |
8 | 7 | eleq1d 2822 | . . . . . 6 ⊢ (((𝑃‘0) = 𝐴 ∧ (𝑃‘1) = 𝐵 ∧ (𝑃‘2) = 𝐶) → ((𝑃‘1) ∈ 𝑉 ↔ 𝐵 ∈ 𝑉)) |
9 | simp3 1140 | . . . . . . 7 ⊢ (((𝑃‘0) = 𝐴 ∧ (𝑃‘1) = 𝐵 ∧ (𝑃‘2) = 𝐶) → (𝑃‘2) = 𝐶) | |
10 | 9 | eleq1d 2822 | . . . . . 6 ⊢ (((𝑃‘0) = 𝐴 ∧ (𝑃‘1) = 𝐵 ∧ (𝑃‘2) = 𝐶) → ((𝑃‘2) ∈ 𝑉 ↔ 𝐶 ∈ 𝑉)) |
11 | 6, 8, 10 | 3anbi123d 1438 | . . . . 5 ⊢ (((𝑃‘0) = 𝐴 ∧ (𝑃‘1) = 𝐵 ∧ (𝑃‘2) = 𝐶) → (((𝑃‘0) ∈ 𝑉 ∧ (𝑃‘1) ∈ 𝑉 ∧ (𝑃‘2) ∈ 𝑉) ↔ (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉))) |
12 | 11 | bicomd 226 | . . . 4 ⊢ (((𝑃‘0) = 𝐴 ∧ (𝑃‘1) = 𝐵 ∧ (𝑃‘2) = 𝐶) → ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉) ↔ ((𝑃‘0) ∈ 𝑉 ∧ (𝑃‘1) ∈ 𝑉 ∧ (𝑃‘2) ∈ 𝑉))) |
13 | 4, 12 | syl 17 | . . 3 ⊢ (𝜑 → ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉) ↔ ((𝑃‘0) ∈ 𝑉 ∧ (𝑃‘1) ∈ 𝑉 ∧ (𝑃‘2) ∈ 𝑉))) |
14 | 1, 13 | mpbid 235 | . 2 ⊢ (𝜑 → ((𝑃‘0) ∈ 𝑉 ∧ (𝑃‘1) ∈ 𝑉 ∧ (𝑃‘2) ∈ 𝑉)) |
15 | 3 | fveq2i 6717 | . . . . . . 7 ⊢ (♯‘𝐹) = (♯‘〈“𝐽𝐾”〉) |
16 | s2len 14451 | . . . . . . 7 ⊢ (♯‘〈“𝐽𝐾”〉) = 2 | |
17 | 15, 16 | eqtri 2765 | . . . . . 6 ⊢ (♯‘𝐹) = 2 |
18 | 17 | oveq2i 7221 | . . . . 5 ⊢ (0...(♯‘𝐹)) = (0...2) |
19 | fz0tp 13210 | . . . . 5 ⊢ (0...2) = {0, 1, 2} | |
20 | 18, 19 | eqtri 2765 | . . . 4 ⊢ (0...(♯‘𝐹)) = {0, 1, 2} |
21 | 20 | raleqi 3320 | . . 3 ⊢ (∀𝑘 ∈ (0...(♯‘𝐹))(𝑃‘𝑘) ∈ 𝑉 ↔ ∀𝑘 ∈ {0, 1, 2} (𝑃‘𝑘) ∈ 𝑉) |
22 | c0ex 10824 | . . . 4 ⊢ 0 ∈ V | |
23 | 1ex 10826 | . . . 4 ⊢ 1 ∈ V | |
24 | 2ex 11904 | . . . 4 ⊢ 2 ∈ V | |
25 | fveq2 6714 | . . . . 5 ⊢ (𝑘 = 0 → (𝑃‘𝑘) = (𝑃‘0)) | |
26 | 25 | eleq1d 2822 | . . . 4 ⊢ (𝑘 = 0 → ((𝑃‘𝑘) ∈ 𝑉 ↔ (𝑃‘0) ∈ 𝑉)) |
27 | fveq2 6714 | . . . . 5 ⊢ (𝑘 = 1 → (𝑃‘𝑘) = (𝑃‘1)) | |
28 | 27 | eleq1d 2822 | . . . 4 ⊢ (𝑘 = 1 → ((𝑃‘𝑘) ∈ 𝑉 ↔ (𝑃‘1) ∈ 𝑉)) |
29 | fveq2 6714 | . . . . 5 ⊢ (𝑘 = 2 → (𝑃‘𝑘) = (𝑃‘2)) | |
30 | 29 | eleq1d 2822 | . . . 4 ⊢ (𝑘 = 2 → ((𝑃‘𝑘) ∈ 𝑉 ↔ (𝑃‘2) ∈ 𝑉)) |
31 | 22, 23, 24, 26, 28, 30 | raltp 4618 | . . 3 ⊢ (∀𝑘 ∈ {0, 1, 2} (𝑃‘𝑘) ∈ 𝑉 ↔ ((𝑃‘0) ∈ 𝑉 ∧ (𝑃‘1) ∈ 𝑉 ∧ (𝑃‘2) ∈ 𝑉)) |
32 | 21, 31 | bitri 278 | . 2 ⊢ (∀𝑘 ∈ (0...(♯‘𝐹))(𝑃‘𝑘) ∈ 𝑉 ↔ ((𝑃‘0) ∈ 𝑉 ∧ (𝑃‘1) ∈ 𝑉 ∧ (𝑃‘2) ∈ 𝑉)) |
33 | 14, 32 | sylibr 237 | 1 ⊢ (𝜑 → ∀𝑘 ∈ (0...(♯‘𝐹))(𝑃‘𝑘) ∈ 𝑉) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 209 ∧ w3a 1089 = wceq 1543 ∈ wcel 2110 ∀wral 3058 {ctp 4542 ‘cfv 6377 (class class class)co 7210 0cc0 10726 1c1 10727 2c2 11882 ...cfz 13092 ♯chash 13893 〈“cs2 14403 〈“cs3 14404 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1803 ax-4 1817 ax-5 1918 ax-6 1976 ax-7 2016 ax-8 2112 ax-9 2120 ax-10 2141 ax-11 2158 ax-12 2175 ax-ext 2708 ax-rep 5176 ax-sep 5189 ax-nul 5196 ax-pow 5255 ax-pr 5319 ax-un 7520 ax-cnex 10782 ax-resscn 10783 ax-1cn 10784 ax-icn 10785 ax-addcl 10786 ax-addrcl 10787 ax-mulcl 10788 ax-mulrcl 10789 ax-mulcom 10790 ax-addass 10791 ax-mulass 10792 ax-distr 10793 ax-i2m1 10794 ax-1ne0 10795 ax-1rid 10796 ax-rnegex 10797 ax-rrecex 10798 ax-cnre 10799 ax-pre-lttri 10800 ax-pre-lttrn 10801 ax-pre-ltadd 10802 ax-pre-mulgt0 10803 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 848 df-3or 1090 df-3an 1091 df-tru 1546 df-fal 1556 df-ex 1788 df-nf 1792 df-sb 2071 df-mo 2539 df-eu 2568 df-clab 2715 df-cleq 2729 df-clel 2816 df-nfc 2886 df-ne 2940 df-nel 3044 df-ral 3063 df-rex 3064 df-reu 3065 df-rab 3067 df-v 3407 df-sbc 3692 df-csb 3809 df-dif 3866 df-un 3868 df-in 3870 df-ss 3880 df-pss 3882 df-nul 4235 df-if 4437 df-pw 4512 df-sn 4539 df-pr 4541 df-tp 4543 df-op 4545 df-uni 4817 df-int 4857 df-iun 4903 df-br 5051 df-opab 5113 df-mpt 5133 df-tr 5159 df-id 5452 df-eprel 5457 df-po 5465 df-so 5466 df-fr 5506 df-we 5508 df-xp 5554 df-rel 5555 df-cnv 5556 df-co 5557 df-dm 5558 df-rn 5559 df-res 5560 df-ima 5561 df-pred 6157 df-ord 6213 df-on 6214 df-lim 6215 df-suc 6216 df-iota 6335 df-fun 6379 df-fn 6380 df-f 6381 df-f1 6382 df-fo 6383 df-f1o 6384 df-fv 6385 df-riota 7167 df-ov 7213 df-oprab 7214 df-mpo 7215 df-om 7642 df-1st 7758 df-2nd 7759 df-wrecs 8044 df-recs 8105 df-rdg 8143 df-1o 8199 df-er 8388 df-en 8624 df-dom 8625 df-sdom 8626 df-fin 8627 df-card 9552 df-pnf 10866 df-mnf 10867 df-xr 10868 df-ltxr 10869 df-le 10870 df-sub 11061 df-neg 11062 df-nn 11828 df-2 11890 df-n0 12088 df-z 12174 df-uz 12436 df-fz 13093 df-fzo 13236 df-hash 13894 df-word 14067 df-concat 14123 df-s1 14150 df-s2 14410 df-s3 14411 |
This theorem is referenced by: 2wlkd 28017 |
Copyright terms: Public domain | W3C validator |