![]() |
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 29791. (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 29782 | . . . 4 ⊢ (𝜑 → ((𝑃‘0) = 𝐴 ∧ (𝑃‘1) = 𝐵 ∧ (𝑃‘2) = 𝐶)) |
6 | simp1 1133 | . . . . . . 7 ⊢ (((𝑃‘0) = 𝐴 ∧ (𝑃‘1) = 𝐵 ∧ (𝑃‘2) = 𝐶) → (𝑃‘0) = 𝐴) | |
7 | simp2 1134 | . . . . . . 7 ⊢ (((𝑃‘0) = 𝐴 ∧ (𝑃‘1) = 𝐵 ∧ (𝑃‘2) = 𝐶) → (𝑃‘1) = 𝐵) | |
8 | 6, 7 | neeq12d 2992 | . . . . . 6 ⊢ (((𝑃‘0) = 𝐴 ∧ (𝑃‘1) = 𝐵 ∧ (𝑃‘2) = 𝐶) → ((𝑃‘0) ≠ (𝑃‘1) ↔ 𝐴 ≠ 𝐵)) |
9 | simp3 1135 | . . . . . . 7 ⊢ (((𝑃‘0) = 𝐴 ∧ (𝑃‘1) = 𝐵 ∧ (𝑃‘2) = 𝐶) → (𝑃‘2) = 𝐶) | |
10 | 7, 9 | neeq12d 2992 | . . . . . 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 29781 | . . . 4 ⊢ (0..^(♯‘𝐹)) = {0, 1} |
16 | 15 | raleqi 3313 | . . 3 ⊢ (∀𝑘 ∈ (0..^(♯‘𝐹))(𝑃‘𝑘) ≠ (𝑃‘(𝑘 + 1)) ↔ ∀𝑘 ∈ {0, 1} (𝑃‘𝑘) ≠ (𝑃‘(𝑘 + 1))) |
17 | c0ex 11238 | . . . 4 ⊢ 0 ∈ V | |
18 | 1ex 11240 | . . . 4 ⊢ 1 ∈ V | |
19 | fveq2 6892 | . . . . 5 ⊢ (𝑘 = 0 → (𝑃‘𝑘) = (𝑃‘0)) | |
20 | fv0p1e1 12365 | . . . . 5 ⊢ (𝑘 = 0 → (𝑃‘(𝑘 + 1)) = (𝑃‘1)) | |
21 | 19, 20 | neeq12d 2992 | . . . 4 ⊢ (𝑘 = 0 → ((𝑃‘𝑘) ≠ (𝑃‘(𝑘 + 1)) ↔ (𝑃‘0) ≠ (𝑃‘1))) |
22 | fveq2 6892 | . . . . 5 ⊢ (𝑘 = 1 → (𝑃‘𝑘) = (𝑃‘1)) | |
23 | oveq1 7423 | . . . . . . 7 ⊢ (𝑘 = 1 → (𝑘 + 1) = (1 + 1)) | |
24 | 1p1e2 12367 | . . . . . . 7 ⊢ (1 + 1) = 2 | |
25 | 23, 24 | eqtrdi 2781 | . . . . . 6 ⊢ (𝑘 = 1 → (𝑘 + 1) = 2) |
26 | 25 | fveq2d 6896 | . . . . 5 ⊢ (𝑘 = 1 → (𝑃‘(𝑘 + 1)) = (𝑃‘2)) |
27 | 22, 26 | neeq12d 2992 | . . . 4 ⊢ (𝑘 = 1 → ((𝑃‘𝑘) ≠ (𝑃‘(𝑘 + 1)) ↔ (𝑃‘1) ≠ (𝑃‘2))) |
28 | 17, 18, 21, 27 | ralpr 4700 | . . 3 ⊢ (∀𝑘 ∈ {0, 1} (𝑃‘𝑘) ≠ (𝑃‘(𝑘 + 1)) ↔ ((𝑃‘0) ≠ (𝑃‘1) ∧ (𝑃‘1) ≠ (𝑃‘2))) |
29 | 16, 28 | bitri 274 | . 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 394 ∧ w3a 1084 = wceq 1533 ∈ wcel 2098 ≠ wne 2930 ∀wral 3051 {cpr 4626 ‘cfv 6543 (class class class)co 7416 0cc0 11138 1c1 11139 + caddc 11141 2c2 12297 ..^cfzo 13659 ♯chash 14321 ⟨“cs2 14824 ⟨“cs3 14825 |
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 2166 ax-ext 2696 ax-rep 5280 ax-sep 5294 ax-nul 5301 ax-pow 5359 ax-pr 5423 ax-un 7738 ax-cnex 11194 ax-resscn 11195 ax-1cn 11196 ax-icn 11197 ax-addcl 11198 ax-addrcl 11199 ax-mulcl 11200 ax-mulrcl 11201 ax-mulcom 11202 ax-addass 11203 ax-mulass 11204 ax-distr 11205 ax-i2m1 11206 ax-1ne0 11207 ax-1rid 11208 ax-rnegex 11209 ax-rrecex 11210 ax-cnre 11211 ax-pre-lttri 11212 ax-pre-lttrn 11213 ax-pre-ltadd 11214 ax-pre-mulgt0 11215 |
This theorem depends on definitions: df-bi 206 df-an 395 df-or 846 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 2703 df-cleq 2717 df-clel 2802 df-nfc 2877 df-ne 2931 df-nel 3037 df-ral 3052 df-rex 3061 df-reu 3365 df-rab 3420 df-v 3465 df-sbc 3769 df-csb 3885 df-dif 3942 df-un 3944 df-in 3946 df-ss 3956 df-pss 3959 df-nul 4319 df-if 4525 df-pw 4600 df-sn 4625 df-pr 4627 df-op 4631 df-uni 4904 df-int 4945 df-iun 4993 df-br 5144 df-opab 5206 df-mpt 5227 df-tr 5261 df-id 5570 df-eprel 5576 df-po 5584 df-so 5585 df-fr 5627 df-we 5629 df-xp 5678 df-rel 5679 df-cnv 5680 df-co 5681 df-dm 5682 df-rn 5683 df-res 5684 df-ima 5685 df-pred 6300 df-ord 6367 df-on 6368 df-lim 6369 df-suc 6370 df-iota 6495 df-fun 6545 df-fn 6546 df-f 6547 df-f1 6548 df-fo 6549 df-f1o 6550 df-fv 6551 df-riota 7372 df-ov 7419 df-oprab 7420 df-mpo 7421 df-om 7869 df-1st 7991 df-2nd 7992 df-frecs 8285 df-wrecs 8316 df-recs 8390 df-rdg 8429 df-1o 8485 df-er 8723 df-en 8963 df-dom 8964 df-sdom 8965 df-fin 8966 df-card 9962 df-pnf 11280 df-mnf 11281 df-xr 11282 df-ltxr 11283 df-le 11284 df-sub 11476 df-neg 11477 df-nn 12243 df-2 12305 df-n0 12503 df-z 12589 df-uz 12853 df-fz 13517 df-fzo 13660 df-hash 14322 df-word 14497 df-concat 14553 df-s1 14578 df-s2 14831 df-s3 14832 |
This theorem is referenced by: 2wlkd 29791 |
Copyright terms: Public domain | W3C validator |