| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > wwlktovf | Structured version Visualization version GIF version | ||
| Description: Lemma 1 for wrd2f1tovbij 15156. (Contributed by Alexander van der Vekens, 27-Jul-2018.) |
| Ref | Expression |
|---|---|
| wwlktovf1o.d | ⊢ 𝐷 = {𝑤 ∈ Word 𝑉 ∣ ((♯‘𝑤) = 2 ∧ (𝑤‘0) = 𝑃 ∧ {(𝑤‘0), (𝑤‘1)} ∈ 𝑋)} |
| wwlktovf1o.r | ⊢ 𝑅 = {𝑛 ∈ 𝑉 ∣ {𝑃, 𝑛} ∈ 𝑋} |
| wwlktovf1o.f | ⊢ 𝐹 = (𝑡 ∈ 𝐷 ↦ (𝑡‘1)) |
| Ref | Expression |
|---|---|
| wwlktovf | ⊢ 𝐹:𝐷⟶𝑅 |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | wwlktovf1o.f | . 2 ⊢ 𝐹 = (𝑡 ∈ 𝐷 ↦ (𝑡‘1)) | |
| 2 | wrdf 14704 | . . . . 5 ⊢ (𝑡 ∈ Word 𝑉 → 𝑡:(0..^(♯‘𝑡))⟶𝑉) | |
| 3 | oveq2 7459 | . . . . . . . 8 ⊢ ((♯‘𝑡) = 2 → (0..^(♯‘𝑡)) = (0..^2)) | |
| 4 | 3 | feq2d 6723 | . . . . . . 7 ⊢ ((♯‘𝑡) = 2 → (𝑡:(0..^(♯‘𝑡))⟶𝑉 ↔ 𝑡:(0..^2)⟶𝑉)) |
| 5 | 1nn0 12662 | . . . . . . . . 9 ⊢ 1 ∈ ℕ0 | |
| 6 | 2nn 12456 | . . . . . . . . 9 ⊢ 2 ∈ ℕ | |
| 7 | 1lt2 12555 | . . . . . . . . 9 ⊢ 1 < 2 | |
| 8 | elfzo0 13875 | . . . . . . . . 9 ⊢ (1 ∈ (0..^2) ↔ (1 ∈ ℕ0 ∧ 2 ∈ ℕ ∧ 1 < 2)) | |
| 9 | 5, 6, 7, 8 | mpbir3an 1360 | . . . . . . . 8 ⊢ 1 ∈ (0..^2) |
| 10 | ffvelcdm 7113 | . . . . . . . 8 ⊢ ((𝑡:(0..^2)⟶𝑉 ∧ 1 ∈ (0..^2)) → (𝑡‘1) ∈ 𝑉) | |
| 11 | 9, 10 | mpan2 704 | . . . . . . 7 ⊢ (𝑡:(0..^2)⟶𝑉 → (𝑡‘1) ∈ 𝑉) |
| 12 | 4, 11 | biimtrdi 256 | . . . . . 6 ⊢ ((♯‘𝑡) = 2 → (𝑡:(0..^(♯‘𝑡))⟶𝑉 → (𝑡‘1) ∈ 𝑉)) |
| 13 | 12 | 3ad2ant1 1151 | . . . . 5 ⊢ (((♯‘𝑡) = 2 ∧ (𝑡‘0) = 𝑃 ∧ {(𝑡‘0), (𝑡‘1)} ∈ 𝑋) → (𝑡:(0..^(♯‘𝑡))⟶𝑉 → (𝑡‘1) ∈ 𝑉)) |
| 14 | 2, 13 | mpan9 516 | . . . 4 ⊢ ((𝑡 ∈ Word 𝑉 ∧ ((♯‘𝑡) = 2 ∧ (𝑡‘0) = 𝑃 ∧ {(𝑡‘0), (𝑡‘1)} ∈ 𝑋)) → (𝑡‘1) ∈ 𝑉) |
| 15 | preq1 4696 | . . . . . . . 8 ⊢ ((𝑡‘0) = 𝑃 → {(𝑡‘0), (𝑡‘1)} = {𝑃, (𝑡‘1)}) | |
| 16 | 15 | eleq1d 2849 | . . . . . . 7 ⊢ ((𝑡‘0) = 𝑃 → ({(𝑡‘0), (𝑡‘1)} ∈ 𝑋 ↔ {𝑃, (𝑡‘1)} ∈ 𝑋)) |
| 17 | 16 | biimpa 482 | . . . . . 6 ⊢ (((𝑡‘0) = 𝑃 ∧ {(𝑡‘0), (𝑡‘1)} ∈ 𝑋) → {𝑃, (𝑡‘1)} ∈ 𝑋) |
| 18 | 17 | 3adant1 1148 | . . . . 5 ⊢ (((♯‘𝑡) = 2 ∧ (𝑡‘0) = 𝑃 ∧ {(𝑡‘0), (𝑡‘1)} ∈ 𝑋) → {𝑃, (𝑡‘1)} ∈ 𝑋) |
| 19 | 18 | adantl 487 | . . . 4 ⊢ ((𝑡 ∈ Word 𝑉 ∧ ((♯‘𝑡) = 2 ∧ (𝑡‘0) = 𝑃 ∧ {(𝑡‘0), (𝑡‘1)} ∈ 𝑋)) → {𝑃, (𝑡‘1)} ∈ 𝑋) |
| 20 | 14, 19 | jca 521 | . . 3 ⊢ ((𝑡 ∈ Word 𝑉 ∧ ((♯‘𝑡) = 2 ∧ (𝑡‘0) = 𝑃 ∧ {(𝑡‘0), (𝑡‘1)} ∈ 𝑋)) → ((𝑡‘1) ∈ 𝑉 ∧ {𝑃, (𝑡‘1)} ∈ 𝑋)) |
| 21 | fveqeq2 6925 | . . . . 5 ⊢ (𝑤 = 𝑡 → ((♯‘𝑤) = 2 ↔ (♯‘𝑡) = 2)) | |
| 22 | fveq1 6915 | . . . . . 6 ⊢ (𝑤 = 𝑡 → (𝑤‘0) = (𝑡‘0)) | |
| 23 | 22 | eqeq1d 2765 | . . . . 5 ⊢ (𝑤 = 𝑡 → ((𝑤‘0) = 𝑃 ↔ (𝑡‘0) = 𝑃)) |
| 24 | fveq1 6915 | . . . . . . 7 ⊢ (𝑤 = 𝑡 → (𝑤‘1) = (𝑡‘1)) | |
| 25 | 22, 24 | preq12d 4704 | . . . . . 6 ⊢ (𝑤 = 𝑡 → {(𝑤‘0), (𝑤‘1)} = {(𝑡‘0), (𝑡‘1)}) |
| 26 | 25 | eleq1d 2849 | . . . . 5 ⊢ (𝑤 = 𝑡 → ({(𝑤‘0), (𝑤‘1)} ∈ 𝑋 ↔ {(𝑡‘0), (𝑡‘1)} ∈ 𝑋)) |
| 27 | 21, 23, 26 | 3anbi123d 1465 | . . . 4 ⊢ (𝑤 = 𝑡 → (((♯‘𝑤) = 2 ∧ (𝑤‘0) = 𝑃 ∧ {(𝑤‘0), (𝑤‘1)} ∈ 𝑋) ↔ ((♯‘𝑡) = 2 ∧ (𝑡‘0) = 𝑃 ∧ {(𝑡‘0), (𝑡‘1)} ∈ 𝑋))) |
| 28 | wwlktovf1o.d | . . . 4 ⊢ 𝐷 = {𝑤 ∈ Word 𝑉 ∣ ((♯‘𝑤) = 2 ∧ (𝑤‘0) = 𝑃 ∧ {(𝑤‘0), (𝑤‘1)} ∈ 𝑋)} | |
| 29 | 27, 28 | elrab2 3652 | . . 3 ⊢ (𝑡 ∈ 𝐷 ↔ (𝑡 ∈ Word 𝑉 ∧ ((♯‘𝑡) = 2 ∧ (𝑡‘0) = 𝑃 ∧ {(𝑡‘0), (𝑡‘1)} ∈ 𝑋))) |
| 30 | preq2 4697 | . . . . 5 ⊢ (𝑛 = (𝑡‘1) → {𝑃, 𝑛} = {𝑃, (𝑡‘1)}) | |
| 31 | 30 | eleq1d 2849 | . . . 4 ⊢ (𝑛 = (𝑡‘1) → ({𝑃, 𝑛} ∈ 𝑋 ↔ {𝑃, (𝑡‘1)} ∈ 𝑋)) |
| 32 | wwlktovf1o.r | . . . 4 ⊢ 𝑅 = {𝑛 ∈ 𝑉 ∣ {𝑃, 𝑛} ∈ 𝑋} | |
| 33 | 31, 32 | elrab2 3652 | . . 3 ⊢ ((𝑡‘1) ∈ 𝑅 ↔ ((𝑡‘1) ∈ 𝑉 ∧ {𝑃, (𝑡‘1)} ∈ 𝑋)) |
| 34 | 20, 29, 33 | 3imtr4i 295 | . 2 ⊢ (𝑡 ∈ 𝐷 → (𝑡‘1) ∈ 𝑅) |
| 35 | 1, 34 | fmpti 7144 | 1 ⊢ 𝐹:𝐷⟶𝑅 |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 ∧ w3a 1103 = wceq 1570 ∈ wcel 2147 {crab 3416 {cpr 4590 class class class wbr 5108 ↦ cmpt 5192 ⟶wf 6562 ‘cfv 6566 (class class class)co 7451 0cc0 11239 1c1 11240 < clt 11382 ℕcn 12375 2c2 12437 ℕ0cn0 12646 ..^cfzo 13828 ♯chash 14515 Word cword 14699 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-rep 5238 ax-sep 5255 ax-nul 5266 ax-pow 5334 ax-pr 5398 ax-un 7783 ax-cnex 11295 ax-resscn 11296 ax-1cn 11297 ax-icn 11298 ax-addcl 11299 ax-addrcl 11300 ax-mulcl 11301 ax-mulrcl 11302 ax-mulcom 11303 ax-addass 11304 ax-mulass 11305 ax-distr 11306 ax-i2m1 11307 ax-1ne0 11308 ax-1rid 11309 ax-rnegex 11310 ax-rrecex 11311 ax-cnre 11312 ax-pre-lttri 11313 ax-pre-lttrn 11314 ax-pre-ltadd 11315 ax-pre-mulgt0 11316 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-nel 3066 df-ral 3081 df-rex 3091 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-pss 4017 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4841 df-uni 4873 df-int 4913 df-iun 4958 df-br 5109 df-opab 5174 df-mpt 5193 df-tr 5219 df-id 5553 df-eprel 5558 df-po 5566 df-so 5567 df-fr 5611 df-we 5613 df-xp 5664 df-rel 5665 df-cnv 5666 df-co 5667 df-dm 5668 df-rn 5669 df-res 5670 df-ima 5671 df-pred 6330 df-ord 6391 df-on 6392 df-lim 6393 df-suc 6394 df-iota 6520 df-fun 6568 df-fn 6569 df-f 6570 df-f1 6571 df-fo 6572 df-f1o 6573 df-fv 6574 df-riota 7408 df-ov 7454 df-oprab 7455 df-mpo 7456 df-om 7912 df-1st 8035 df-2nd 8036 df-frecs 8337 df-wrecs 8368 df-recs 8417 df-rdg 8456 df-1o 8514 df-er 8755 df-en 9012 df-dom 9013 df-sdom 9014 df-fin 9015 df-card 10057 df-pnf 11384 df-mnf 11385 df-xr 11386 df-ltxr 11387 df-le 11388 df-sub 11582 df-neg 11583 df-nn 12376 df-2 12445 df-n0 12647 df-z 12734 df-uz 13006 df-fz 13680 df-fzo 13829 df-hash 14516 df-word 14700 |
| This theorem is used by: wwlktovf1 15153 wwlktovfo 15154 |
| Copyright terms: Public domain | W3C validator |