| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > funcestrcsetclem5 | Structured version Visualization version GIF version | ||
| Description: Lemma 5 for funcestrcsetc 18373. (Contributed by AV, 23-Mar-2020.) |
| Ref | Expression |
|---|---|
| funcestrcsetc.e | ⊢ 𝐸 = (ExtStrCat‘𝑈) |
| funcestrcsetc.s | ⊢ 𝑆 = (SetCat‘𝑈) |
| funcestrcsetc.b | ⊢ 𝐵 = (Base‘𝐸) |
| funcestrcsetc.c | ⊢ 𝐶 = (Base‘𝑆) |
| funcestrcsetc.u | ⊢ (𝜑 → 𝑈 ∈ WUni) |
| funcestrcsetc.f | ⊢ (𝜑 → 𝐹 = (𝑥 ∈ 𝐵 ↦ (Base‘𝑥))) |
| funcestrcsetc.g | ⊢ (𝜑 → 𝐺 = (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ ( I ↾ ((Base‘𝑦) ↑m (Base‘𝑥))))) |
| funcestrcsetc.m | ⊢ 𝑀 = (Base‘𝑋) |
| funcestrcsetc.n | ⊢ 𝑁 = (Base‘𝑌) |
| Ref | Expression |
|---|---|
| funcestrcsetclem5 | ⊢ ((𝜑 ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → (𝑋𝐺𝑌) = ( I ↾ (𝑁 ↑m 𝑀))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | funcestrcsetc.g | . . 3 ⊢ (𝜑 → 𝐺 = (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ ( I ↾ ((Base‘𝑦) ↑m (Base‘𝑥))))) | |
| 2 | 1 | adantr 486 | . 2 ⊢ ((𝜑 ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → 𝐺 = (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ ( I ↾ ((Base‘𝑦) ↑m (Base‘𝑥))))) |
| 3 | fveq2 6916 | . . . . . 6 ⊢ (𝑦 = 𝑌 → (Base‘𝑦) = (Base‘𝑌)) | |
| 4 | fveq2 6916 | . . . . . 6 ⊢ (𝑥 = 𝑋 → (Base‘𝑥) = (Base‘𝑋)) | |
| 5 | 3, 4 | oveqan12rd 7471 | . . . . 5 ⊢ ((𝑥 = 𝑋 ∧ 𝑦 = 𝑌) → ((Base‘𝑦) ↑m (Base‘𝑥)) = ((Base‘𝑌) ↑m (Base‘𝑋))) |
| 6 | funcestrcsetc.n | . . . . . 6 ⊢ 𝑁 = (Base‘𝑌) | |
| 7 | funcestrcsetc.m | . . . . . 6 ⊢ 𝑀 = (Base‘𝑋) | |
| 8 | 6, 7 | oveq12i 7463 | . . . . 5 ⊢ (𝑁 ↑m 𝑀) = ((Base‘𝑌) ↑m (Base‘𝑋)) |
| 9 | 5, 8 | eqtr4di 2816 | . . . 4 ⊢ ((𝑥 = 𝑋 ∧ 𝑦 = 𝑌) → ((Base‘𝑦) ↑m (Base‘𝑥)) = (𝑁 ↑m 𝑀)) |
| 10 | 9 | reseq2d 5986 | . . 3 ⊢ ((𝑥 = 𝑋 ∧ 𝑦 = 𝑌) → ( I ↾ ((Base‘𝑦) ↑m (Base‘𝑥))) = ( I ↾ (𝑁 ↑m 𝑀))) |
| 11 | 10 | adantl 487 | . 2 ⊢ (((𝜑 ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) ∧ (𝑥 = 𝑋 ∧ 𝑦 = 𝑌)) → ( I ↾ ((Base‘𝑦) ↑m (Base‘𝑥))) = ( I ↾ (𝑁 ↑m 𝑀))) |
| 12 | simprl 783 | . 2 ⊢ ((𝜑 ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → 𝑋 ∈ 𝐵) | |
| 13 | simprr 785 | . 2 ⊢ ((𝜑 ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → 𝑌 ∈ 𝐵) | |
| 14 | ovexd 7486 | . . 3 ⊢ ((𝜑 ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → (𝑁 ↑m 𝑀) ∈ V) | |
| 15 | 14 | resiexd 7253 | . 2 ⊢ ((𝜑 ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → ( I ↾ (𝑁 ↑m 𝑀)) ∈ V) |
| 16 | 2, 11, 12, 13, 15 | ovmpod 7604 | 1 ⊢ ((𝜑 ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) → (𝑋𝐺𝑌) = ( I ↾ (𝑁 ↑m 𝑀))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1570 ∈ wcel 2147 Vcvv 3454 ↦ cmpt 5192 I cid 5552 ↾ cres 5660 ‘cfv 6566 (class class class)co 7451 ∈ cmpo 7453 ↑m cmap 8885 WUnicwun 10824 Basecbs 17431 SetCatcsetc 18300 ExtStrCatcestrc 18346 |
| 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-pr 5398 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 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-ral 3081 df-rex 3091 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-sn 4589 df-pr 4591 df-op 4841 df-uni 4873 df-iun 4958 df-br 5109 df-opab 5174 df-mpt 5193 df-id 5553 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-iota 6520 df-fun 6568 df-fn 6569 df-f 6570 df-f1 6571 df-fo 6572 df-f1o 6573 df-fv 6574 df-ov 7454 df-oprab 7455 df-mpo 7456 |
| This theorem is used by: funcestrcsetclem6 18369 funcestrcsetclem7 18370 funcestrcsetclem8 18371 funcestrcsetclem9 18372 |
| Copyright terms: Public domain | W3C validator |