![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > 2wlkdlem5 | Structured version Visualization version GIF version |
Description: Lemma 5 for 2wlkd 29699. (Contributed by AV, 14-Feb-2021.) |
Ref | Expression |
---|---|
2wlkd.p | ⊢ 𝑃 = ⟨“𝐴𝐵𝐶”⟩ |
2wlkd.f | ⊢ 𝐹 = ⟨“𝐽𝐾”⟩ |
2wlkd.s | ⊢ (𝜑 → (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) |
2wlkd.n | ⊢ (𝜑 → (𝐴 ≠ 𝐵 ∧ 𝐵 ≠ 𝐶)) |
Ref | Expression |
---|---|
2wlkdlem5 | ⊢ (𝜑 → ∀𝑘 ∈ (0..^(♯‘𝐹))(𝑃‘𝑘) ≠ (𝑃‘(𝑘 + 1))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | 2wlkd.n | . . 3 ⊢ (𝜑 → (𝐴 ≠ 𝐵 ∧ 𝐵 ≠ 𝐶)) | |
2 | 2wlkd.p | . . . . 5 ⊢ 𝑃 = ⟨“𝐴𝐵𝐶”⟩ | |
3 | 2wlkd.f | . . . . 5 ⊢ 𝐹 = ⟨“𝐽𝐾”⟩ | |
4 | 2wlkd.s | . . . . 5 ⊢ (𝜑 → (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) | |
5 | 2, 3, 4 | 2wlkdlem3 29690 | . . . 4 ⊢ (𝜑 → ((𝑃‘0) = 𝐴 ∧ (𝑃‘1) = 𝐵 ∧ (𝑃‘2) = 𝐶)) |
6 | simp1 1133 | . . . . . . 7 ⊢ (((𝑃‘0) = 𝐴 ∧ (𝑃‘1) = 𝐵 ∧ (𝑃‘2) = 𝐶) → (𝑃‘0) = 𝐴) | |
7 | simp2 1134 | . . . . . . 7 ⊢ (((𝑃‘0) = 𝐴 ∧ (𝑃‘1) = 𝐵 ∧ (𝑃‘2) = 𝐶) → (𝑃‘1) = 𝐵) | |
8 | 6, 7 | neeq12d 2996 | . . . . . 6 ⊢ (((𝑃‘0) = 𝐴 ∧ (𝑃‘1) = 𝐵 ∧ (𝑃‘2) = 𝐶) → ((𝑃‘0) ≠ (𝑃‘1) ↔ 𝐴 ≠ 𝐵)) |
9 | simp3 1135 | . . . . . . 7 ⊢ (((𝑃‘0) = 𝐴 ∧ (𝑃‘1) = 𝐵 ∧ (𝑃‘2) = 𝐶) → (𝑃‘2) = 𝐶) | |
10 | 7, 9 | neeq12d 2996 | . . . . . 6 ⊢ (((𝑃‘0) = 𝐴 ∧ (𝑃‘1) = 𝐵 ∧ (𝑃‘2) = 𝐶) → ((𝑃‘1) ≠ (𝑃‘2) ↔ 𝐵 ≠ 𝐶)) |
11 | 8, 10 | anbi12d 630 | . . . . 5 ⊢ (((𝑃‘0) = 𝐴 ∧ (𝑃‘1) = 𝐵 ∧ (𝑃‘2) = 𝐶) → (((𝑃‘0) ≠ (𝑃‘1) ∧ (𝑃‘1) ≠ (𝑃‘2)) ↔ (𝐴 ≠ 𝐵 ∧ 𝐵 ≠ 𝐶))) |
12 | 11 | bicomd 222 | . . . 4 ⊢ (((𝑃‘0) = 𝐴 ∧ (𝑃‘1) = 𝐵 ∧ (𝑃‘2) = 𝐶) → ((𝐴 ≠ 𝐵 ∧ 𝐵 ≠ 𝐶) ↔ ((𝑃‘0) ≠ (𝑃‘1) ∧ (𝑃‘1) ≠ (𝑃‘2)))) |
13 | 5, 12 | syl 17 | . . 3 ⊢ (𝜑 → ((𝐴 ≠ 𝐵 ∧ 𝐵 ≠ 𝐶) ↔ ((𝑃‘0) ≠ (𝑃‘1) ∧ (𝑃‘1) ≠ (𝑃‘2)))) |
14 | 1, 13 | mpbid 231 | . 2 ⊢ (𝜑 → ((𝑃‘0) ≠ (𝑃‘1) ∧ (𝑃‘1) ≠ (𝑃‘2))) |
15 | 2, 3 | 2wlkdlem2 29689 | . . . 4 ⊢ (0..^(♯‘𝐹)) = {0, 1} |
16 | 15 | raleqi 3317 | . . 3 ⊢ (∀𝑘 ∈ (0..^(♯‘𝐹))(𝑃‘𝑘) ≠ (𝑃‘(𝑘 + 1)) ↔ ∀𝑘 ∈ {0, 1} (𝑃‘𝑘) ≠ (𝑃‘(𝑘 + 1))) |
17 | c0ex 11212 | . . . 4 ⊢ 0 ∈ V | |
18 | 1ex 11214 | . . . 4 ⊢ 1 ∈ V | |
19 | fveq2 6885 | . . . . 5 ⊢ (𝑘 = 0 → (𝑃‘𝑘) = (𝑃‘0)) | |
20 | fv0p1e1 12339 | . . . . 5 ⊢ (𝑘 = 0 → (𝑃‘(𝑘 + 1)) = (𝑃‘1)) | |
21 | 19, 20 | neeq12d 2996 | . . . 4 ⊢ (𝑘 = 0 → ((𝑃‘𝑘) ≠ (𝑃‘(𝑘 + 1)) ↔ (𝑃‘0) ≠ (𝑃‘1))) |
22 | fveq2 6885 | . . . . 5 ⊢ (𝑘 = 1 → (𝑃‘𝑘) = (𝑃‘1)) | |
23 | oveq1 7412 | . . . . . . 7 ⊢ (𝑘 = 1 → (𝑘 + 1) = (1 + 1)) | |
24 | 1p1e2 12341 | . . . . . . 7 ⊢ (1 + 1) = 2 | |
25 | 23, 24 | eqtrdi 2782 | . . . . . 6 ⊢ (𝑘 = 1 → (𝑘 + 1) = 2) |
26 | 25 | fveq2d 6889 | . . . . 5 ⊢ (𝑘 = 1 → (𝑃‘(𝑘 + 1)) = (𝑃‘2)) |
27 | 22, 26 | neeq12d 2996 | . . . 4 ⊢ (𝑘 = 1 → ((𝑃‘𝑘) ≠ (𝑃‘(𝑘 + 1)) ↔ (𝑃‘1) ≠ (𝑃‘2))) |
28 | 17, 18, 21, 27 | ralpr 4699 | . . 3 ⊢ (∀𝑘 ∈ {0, 1} (𝑃‘𝑘) ≠ (𝑃‘(𝑘 + 1)) ↔ ((𝑃‘0) ≠ (𝑃‘1) ∧ (𝑃‘1) ≠ (𝑃‘2))) |
29 | 16, 28 | bitri 275 | . 2 ⊢ (∀𝑘 ∈ (0..^(♯‘𝐹))(𝑃‘𝑘) ≠ (𝑃‘(𝑘 + 1)) ↔ ((𝑃‘0) ≠ (𝑃‘1) ∧ (𝑃‘1) ≠ (𝑃‘2))) |
30 | 14, 29 | sylibr 233 | 1 ⊢ (𝜑 → ∀𝑘 ∈ (0..^(♯‘𝐹))(𝑃‘𝑘) ≠ (𝑃‘(𝑘 + 1))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 205 ∧ wa 395 ∧ w3a 1084 = wceq 1533 ∈ wcel 2098 ≠ wne 2934 ∀wral 3055 {cpr 4625 ‘cfv 6537 (class class class)co 7405 0cc0 11112 1c1 11113 + caddc 11115 2c2 12271 ..^cfzo 13633 ♯chash 14295 ⟨“cs2 14798 ⟨“cs3 14799 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1789 ax-4 1803 ax-5 1905 ax-6 1963 ax-7 2003 ax-8 2100 ax-9 2108 ax-10 2129 ax-11 2146 ax-12 2163 ax-ext 2697 ax-rep 5278 ax-sep 5292 ax-nul 5299 ax-pow 5356 ax-pr 5420 ax-un 7722 ax-cnex 11168 ax-resscn 11169 ax-1cn 11170 ax-icn 11171 ax-addcl 11172 ax-addrcl 11173 ax-mulcl 11174 ax-mulrcl 11175 ax-mulcom 11176 ax-addass 11177 ax-mulass 11178 ax-distr 11179 ax-i2m1 11180 ax-1ne0 11181 ax-1rid 11182 ax-rnegex 11183 ax-rrecex 11184 ax-cnre 11185 ax-pre-lttri 11186 ax-pre-lttrn 11187 ax-pre-ltadd 11188 ax-pre-mulgt0 11189 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 845 df-3or 1085 df-3an 1086 df-tru 1536 df-fal 1546 df-ex 1774 df-nf 1778 df-sb 2060 df-mo 2528 df-eu 2557 df-clab 2704 df-cleq 2718 df-clel 2804 df-nfc 2879 df-ne 2935 df-nel 3041 df-ral 3056 df-rex 3065 df-reu 3371 df-rab 3427 df-v 3470 df-sbc 3773 df-csb 3889 df-dif 3946 df-un 3948 df-in 3950 df-ss 3960 df-pss 3962 df-nul 4318 df-if 4524 df-pw 4599 df-sn 4624 df-pr 4626 df-op 4630 df-uni 4903 df-int 4944 df-iun 4992 df-br 5142 df-opab 5204 df-mpt 5225 df-tr 5259 df-id 5567 df-eprel 5573 df-po 5581 df-so 5582 df-fr 5624 df-we 5626 df-xp 5675 df-rel 5676 df-cnv 5677 df-co 5678 df-dm 5679 df-rn 5680 df-res 5681 df-ima 5682 df-pred 6294 df-ord 6361 df-on 6362 df-lim 6363 df-suc 6364 df-iota 6489 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-fv 6545 df-riota 7361 df-ov 7408 df-oprab 7409 df-mpo 7410 df-om 7853 df-1st 7974 df-2nd 7975 df-frecs 8267 df-wrecs 8298 df-recs 8372 df-rdg 8411 df-1o 8467 df-er 8705 df-en 8942 df-dom 8943 df-sdom 8944 df-fin 8945 df-card 9936 df-pnf 11254 df-mnf 11255 df-xr 11256 df-ltxr 11257 df-le 11258 df-sub 11450 df-neg 11451 df-nn 12217 df-2 12279 df-n0 12477 df-z 12563 df-uz 12827 df-fz 13491 df-fzo 13634 df-hash 14296 df-word 14471 df-concat 14527 df-s1 14552 df-s2 14805 df-s3 14806 |
This theorem is referenced by: 2wlkd 29699 |
Copyright terms: Public domain | W3C validator |