| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > 2wlkdlem3 | Structured version Visualization version GIF version | ||
| Description: Lemma 3 for 2wlkd 30133. (Contributed by AV, 14-Feb-2021.) |
| Ref | Expression |
|---|---|
| 2wlkd.p | ⊢ 𝑃 = 〈“𝐴𝐵𝐶”〉 |
| 2wlkd.f | ⊢ 𝐹 = 〈“𝐽𝐾”〉 |
| 2wlkd.s | ⊢ (𝜑 → (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) |
| Ref | Expression |
|---|---|
| 2wlkdlem3 | ⊢ (𝜑 → ((𝑃‘0) = 𝐴 ∧ (𝑃‘1) = 𝐵 ∧ (𝑃‘2) = 𝐶)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | 2wlkd.s | . 2 ⊢ (𝜑 → (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉)) | |
| 2 | 2wlkd.p | . . . . 5 ⊢ 𝑃 = 〈“𝐴𝐵𝐶”〉 | |
| 3 | 2 | fveq1i 6868 | . . . 4 ⊢ (𝑃‘0) = (〈“𝐴𝐵𝐶”〉‘0) |
| 4 | s3fv0 14904 | . . . 4 ⊢ (𝐴 ∈ 𝑉 → (〈“𝐴𝐵𝐶”〉‘0) = 𝐴) | |
| 5 | 3, 4 | eqtrid 2809 | . . 3 ⊢ (𝐴 ∈ 𝑉 → (𝑃‘0) = 𝐴) |
| 6 | 2 | fveq1i 6868 | . . . 4 ⊢ (𝑃‘1) = (〈“𝐴𝐵𝐶”〉‘1) |
| 7 | s3fv1 14905 | . . . 4 ⊢ (𝐵 ∈ 𝑉 → (〈“𝐴𝐵𝐶”〉‘1) = 𝐵) | |
| 8 | 6, 7 | eqtrid 2809 | . . 3 ⊢ (𝐵 ∈ 𝑉 → (𝑃‘1) = 𝐵) |
| 9 | 2 | fveq1i 6868 | . . . 4 ⊢ (𝑃‘2) = (〈“𝐴𝐵𝐶”〉‘2) |
| 10 | s3fv2 14906 | . . . 4 ⊢ (𝐶 ∈ 𝑉 → (〈“𝐴𝐵𝐶”〉‘2) = 𝐶) | |
| 11 | 9, 10 | eqtrid 2809 | . . 3 ⊢ (𝐶 ∈ 𝑉 → (𝑃‘2) = 𝐶) |
| 12 | 5, 8, 11 | 3anim123i 1164 | . 2 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉) → ((𝑃‘0) = 𝐴 ∧ (𝑃‘1) = 𝐵 ∧ (𝑃‘2) = 𝐶)) |
| 13 | 1, 12 | syl 17 | 1 ⊢ (𝜑 → ((𝑃‘0) = 𝐴 ∧ (𝑃‘1) = 𝐵 ∧ (𝑃‘2) = 𝐶)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ w3a 1098 = wceq 1560 ∈ wcel 2142 ‘cfv 6521 0cc0 11073 1c1 11074 2c2 12272 〈“cs2 14854 〈“cs3 14855 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1815 ax-4 1829 ax-5 1930 ax-6 1987 ax-7 2028 ax-8 2144 ax-9 2152 ax-10 2175 ax-11 2191 ax-12 2212 ax-ext 2734 ax-rep 5227 ax-sep 5246 ax-nul 5256 ax-pow 5322 ax-pr 5390 ax-un 7718 ax-cnex 11129 ax-resscn 11130 ax-1cn 11131 ax-icn 11132 ax-addcl 11133 ax-addrcl 11134 ax-mulcl 11135 ax-mulrcl 11136 ax-mulcom 11137 ax-addass 11138 ax-mulass 11139 ax-distr 11140 ax-i2m1 11141 ax-1ne0 11142 ax-1rid 11143 ax-rnegex 11144 ax-rrecex 11145 ax-cnre 11146 ax-pre-lttri 11147 ax-pre-lttrn 11148 ax-pre-ltadd 11149 ax-pre-mulgt0 11150 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3or 1099 df-3an 1100 df-tru 1563 df-fal 1573 df-ex 1800 df-nf 1804 df-sb 2091 df-mo 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-nel 3062 df-ral 3077 df-rex 3087 df-reu 3368 df-rab 3415 df-v 3456 df-sbc 3745 df-csb 3853 df-dif 3907 df-un 3909 df-in 3911 df-ss 3921 df-pss 3924 df-nul 4286 df-if 4481 df-pw 4557 df-sn 4583 df-pr 4585 df-op 4589 df-uni 4866 df-int 4906 df-iun 4951 df-br 5101 df-opab 5163 df-mpt 5182 df-tr 5208 df-id 5542 df-eprel 5547 df-po 5555 df-so 5556 df-fr 5600 df-we 5602 df-xp 5653 df-rel 5654 df-cnv 5655 df-co 5656 df-dm 5657 df-rn 5658 df-res 5659 df-ima 5660 df-pred 6288 df-ord 6349 df-on 6350 df-lim 6351 df-suc 6352 df-iota 6477 df-fun 6523 df-fn 6524 df-f 6525 df-f1 6526 df-fo 6527 df-f1o 6528 df-fv 6529 df-riota 7353 df-ov 7399 df-oprab 7400 df-mpo 7401 df-om 7847 df-1st 7970 df-2nd 7971 df-frecs 8262 df-wrecs 8293 df-recs 8342 df-rdg 8381 df-1o 8437 df-er 8678 df-en 8928 df-dom 8929 df-sdom 8930 df-fin 8931 df-card 9897 df-pnf 11218 df-mnf 11219 df-xr 11220 df-ltxr 11221 df-le 11222 df-sub 11416 df-neg 11417 df-nn 12211 df-2 12280 df-n0 12482 df-z 12569 df-uz 12840 df-fz 13513 df-fzo 13660 df-hash 14344 df-word 14527 df-concat 14584 df-s1 14610 df-s2 14861 df-s3 14862 |
| This theorem is referenced by: 2wlkdlem4 30125 2wlkdlem5 30126 2pthdlem1 30127 2wlkdlem10 30132 |
| Copyright terms: Public domain | W3C validator |