![]() |
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 14911. (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 14469 | . . . . 5 ⊢ (𝑡 ∈ Word 𝑉 → 𝑡:(0..^(♯‘𝑡))⟶𝑉) | |
3 | oveq2 7417 | . . . . . . . 8 ⊢ ((♯‘𝑡) = 2 → (0..^(♯‘𝑡)) = (0..^2)) | |
4 | 3 | feq2d 6704 | . . . . . . 7 ⊢ ((♯‘𝑡) = 2 → (𝑡:(0..^(♯‘𝑡))⟶𝑉 ↔ 𝑡:(0..^2)⟶𝑉)) |
5 | 1nn0 12488 | . . . . . . . . 9 ⊢ 1 ∈ ℕ0 | |
6 | 2nn 12285 | . . . . . . . . 9 ⊢ 2 ∈ ℕ | |
7 | 1lt2 12383 | . . . . . . . . 9 ⊢ 1 < 2 | |
8 | elfzo0 13673 | . . . . . . . . 9 ⊢ (1 ∈ (0..^2) ↔ (1 ∈ ℕ0 ∧ 2 ∈ ℕ ∧ 1 < 2)) | |
9 | 5, 6, 7, 8 | mpbir3an 1342 | . . . . . . . 8 ⊢ 1 ∈ (0..^2) |
10 | ffvelcdm 7084 | . . . . . . . 8 ⊢ ((𝑡:(0..^2)⟶𝑉 ∧ 1 ∈ (0..^2)) → (𝑡‘1) ∈ 𝑉) | |
11 | 9, 10 | mpan2 690 | . . . . . . 7 ⊢ (𝑡:(0..^2)⟶𝑉 → (𝑡‘1) ∈ 𝑉) |
12 | 4, 11 | syl6bi 253 | . . . . . 6 ⊢ ((♯‘𝑡) = 2 → (𝑡:(0..^(♯‘𝑡))⟶𝑉 → (𝑡‘1) ∈ 𝑉)) |
13 | 12 | 3ad2ant1 1134 | . . . . 5 ⊢ (((♯‘𝑡) = 2 ∧ (𝑡‘0) = 𝑃 ∧ {(𝑡‘0), (𝑡‘1)} ∈ 𝑋) → (𝑡:(0..^(♯‘𝑡))⟶𝑉 → (𝑡‘1) ∈ 𝑉)) |
14 | 2, 13 | mpan9 508 | . . . 4 ⊢ ((𝑡 ∈ Word 𝑉 ∧ ((♯‘𝑡) = 2 ∧ (𝑡‘0) = 𝑃 ∧ {(𝑡‘0), (𝑡‘1)} ∈ 𝑋)) → (𝑡‘1) ∈ 𝑉) |
15 | preq1 4738 | . . . . . . . 8 ⊢ ((𝑡‘0) = 𝑃 → {(𝑡‘0), (𝑡‘1)} = {𝑃, (𝑡‘1)}) | |
16 | 15 | eleq1d 2819 | . . . . . . 7 ⊢ ((𝑡‘0) = 𝑃 → ({(𝑡‘0), (𝑡‘1)} ∈ 𝑋 ↔ {𝑃, (𝑡‘1)} ∈ 𝑋)) |
17 | 16 | biimpa 478 | . . . . . 6 ⊢ (((𝑡‘0) = 𝑃 ∧ {(𝑡‘0), (𝑡‘1)} ∈ 𝑋) → {𝑃, (𝑡‘1)} ∈ 𝑋) |
18 | 17 | 3adant1 1131 | . . . . 5 ⊢ (((♯‘𝑡) = 2 ∧ (𝑡‘0) = 𝑃 ∧ {(𝑡‘0), (𝑡‘1)} ∈ 𝑋) → {𝑃, (𝑡‘1)} ∈ 𝑋) |
19 | 18 | adantl 483 | . . . 4 ⊢ ((𝑡 ∈ Word 𝑉 ∧ ((♯‘𝑡) = 2 ∧ (𝑡‘0) = 𝑃 ∧ {(𝑡‘0), (𝑡‘1)} ∈ 𝑋)) → {𝑃, (𝑡‘1)} ∈ 𝑋) |
20 | 14, 19 | jca 513 | . . 3 ⊢ ((𝑡 ∈ Word 𝑉 ∧ ((♯‘𝑡) = 2 ∧ (𝑡‘0) = 𝑃 ∧ {(𝑡‘0), (𝑡‘1)} ∈ 𝑋)) → ((𝑡‘1) ∈ 𝑉 ∧ {𝑃, (𝑡‘1)} ∈ 𝑋)) |
21 | fveqeq2 6901 | . . . . 5 ⊢ (𝑤 = 𝑡 → ((♯‘𝑤) = 2 ↔ (♯‘𝑡) = 2)) | |
22 | fveq1 6891 | . . . . . 6 ⊢ (𝑤 = 𝑡 → (𝑤‘0) = (𝑡‘0)) | |
23 | 22 | eqeq1d 2735 | . . . . 5 ⊢ (𝑤 = 𝑡 → ((𝑤‘0) = 𝑃 ↔ (𝑡‘0) = 𝑃)) |
24 | fveq1 6891 | . . . . . . 7 ⊢ (𝑤 = 𝑡 → (𝑤‘1) = (𝑡‘1)) | |
25 | 22, 24 | preq12d 4746 | . . . . . 6 ⊢ (𝑤 = 𝑡 → {(𝑤‘0), (𝑤‘1)} = {(𝑡‘0), (𝑡‘1)}) |
26 | 25 | eleq1d 2819 | . . . . 5 ⊢ (𝑤 = 𝑡 → ({(𝑤‘0), (𝑤‘1)} ∈ 𝑋 ↔ {(𝑡‘0), (𝑡‘1)} ∈ 𝑋)) |
27 | 21, 23, 26 | 3anbi123d 1437 | . . . 4 ⊢ (𝑤 = 𝑡 → (((♯‘𝑤) = 2 ∧ (𝑤‘0) = 𝑃 ∧ {(𝑤‘0), (𝑤‘1)} ∈ 𝑋) ↔ ((♯‘𝑡) = 2 ∧ (𝑡‘0) = 𝑃 ∧ {(𝑡‘0), (𝑡‘1)} ∈ 𝑋))) |
28 | wwlktovf1o.d | . . . 4 ⊢ 𝐷 = {𝑤 ∈ Word 𝑉 ∣ ((♯‘𝑤) = 2 ∧ (𝑤‘0) = 𝑃 ∧ {(𝑤‘0), (𝑤‘1)} ∈ 𝑋)} | |
29 | 27, 28 | elrab2 3687 | . . 3 ⊢ (𝑡 ∈ 𝐷 ↔ (𝑡 ∈ Word 𝑉 ∧ ((♯‘𝑡) = 2 ∧ (𝑡‘0) = 𝑃 ∧ {(𝑡‘0), (𝑡‘1)} ∈ 𝑋))) |
30 | preq2 4739 | . . . . 5 ⊢ (𝑛 = (𝑡‘1) → {𝑃, 𝑛} = {𝑃, (𝑡‘1)}) | |
31 | 30 | eleq1d 2819 | . . . 4 ⊢ (𝑛 = (𝑡‘1) → ({𝑃, 𝑛} ∈ 𝑋 ↔ {𝑃, (𝑡‘1)} ∈ 𝑋)) |
32 | wwlktovf1o.r | . . . 4 ⊢ 𝑅 = {𝑛 ∈ 𝑉 ∣ {𝑃, 𝑛} ∈ 𝑋} | |
33 | 31, 32 | elrab2 3687 | . . 3 ⊢ ((𝑡‘1) ∈ 𝑅 ↔ ((𝑡‘1) ∈ 𝑉 ∧ {𝑃, (𝑡‘1)} ∈ 𝑋)) |
34 | 20, 29, 33 | 3imtr4i 292 | . 2 ⊢ (𝑡 ∈ 𝐷 → (𝑡‘1) ∈ 𝑅) |
35 | 1, 34 | fmpti 7112 | 1 ⊢ 𝐹:𝐷⟶𝑅 |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 397 ∧ w3a 1088 = wceq 1542 ∈ wcel 2107 {crab 3433 {cpr 4631 class class class wbr 5149 ↦ cmpt 5232 ⟶wf 6540 ‘cfv 6544 (class class class)co 7409 0cc0 11110 1c1 11111 < clt 11248 ℕcn 12212 2c2 12267 ℕ0cn0 12472 ..^cfzo 13627 ♯chash 14290 Word cword 14464 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2109 ax-9 2117 ax-10 2138 ax-11 2155 ax-12 2172 ax-ext 2704 ax-rep 5286 ax-sep 5300 ax-nul 5307 ax-pow 5364 ax-pr 5428 ax-un 7725 ax-cnex 11166 ax-resscn 11167 ax-1cn 11168 ax-icn 11169 ax-addcl 11170 ax-addrcl 11171 ax-mulcl 11172 ax-mulrcl 11173 ax-mulcom 11174 ax-addass 11175 ax-mulass 11176 ax-distr 11177 ax-i2m1 11178 ax-1ne0 11179 ax-1rid 11180 ax-rnegex 11181 ax-rrecex 11182 ax-cnre 11183 ax-pre-lttri 11184 ax-pre-lttrn 11185 ax-pre-ltadd 11186 ax-pre-mulgt0 11187 |
This theorem depends on definitions: df-bi 206 df-an 398 df-or 847 df-3or 1089 df-3an 1090 df-tru 1545 df-fal 1555 df-ex 1783 df-nf 1787 df-sb 2069 df-mo 2535 df-eu 2564 df-clab 2711 df-cleq 2725 df-clel 2811 df-nfc 2886 df-ne 2942 df-nel 3048 df-ral 3063 df-rex 3072 df-reu 3378 df-rab 3434 df-v 3477 df-sbc 3779 df-csb 3895 df-dif 3952 df-un 3954 df-in 3956 df-ss 3966 df-pss 3968 df-nul 4324 df-if 4530 df-pw 4605 df-sn 4630 df-pr 4632 df-op 4636 df-uni 4910 df-int 4952 df-iun 5000 df-br 5150 df-opab 5212 df-mpt 5233 df-tr 5267 df-id 5575 df-eprel 5581 df-po 5589 df-so 5590 df-fr 5632 df-we 5634 df-xp 5683 df-rel 5684 df-cnv 5685 df-co 5686 df-dm 5687 df-rn 5688 df-res 5689 df-ima 5690 df-pred 6301 df-ord 6368 df-on 6369 df-lim 6370 df-suc 6371 df-iota 6496 df-fun 6546 df-fn 6547 df-f 6548 df-f1 6549 df-fo 6550 df-f1o 6551 df-fv 6552 df-riota 7365 df-ov 7412 df-oprab 7413 df-mpo 7414 df-om 7856 df-1st 7975 df-2nd 7976 df-frecs 8266 df-wrecs 8297 df-recs 8371 df-rdg 8410 df-1o 8466 df-er 8703 df-en 8940 df-dom 8941 df-sdom 8942 df-fin 8943 df-card 9934 df-pnf 11250 df-mnf 11251 df-xr 11252 df-ltxr 11253 df-le 11254 df-sub 11446 df-neg 11447 df-nn 12213 df-2 12275 df-n0 12473 df-z 12559 df-uz 12823 df-fz 13485 df-fzo 13628 df-hash 14291 df-word 14465 |
This theorem is referenced by: wwlktovf1 14908 wwlktovfo 14909 |
Copyright terms: Public domain | W3C validator |