![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > fvdiagfn | Structured version Visualization version GIF version |
Description: Functionality of the diagonal map. (Contributed by Stefan O'Rear, 24-Jan-2015.) |
Ref | Expression |
---|---|
fdiagfn.f | ⊢ 𝐹 = (𝑥 ∈ 𝐵 ↦ (𝐼 × {𝑥})) |
Ref | Expression |
---|---|
fvdiagfn | ⊢ ((𝐼 ∈ 𝑊 ∧ 𝑋 ∈ 𝐵) → (𝐹‘𝑋) = (𝐼 × {𝑋})) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | fdiagfn.f | . 2 ⊢ 𝐹 = (𝑥 ∈ 𝐵 ↦ (𝐼 × {𝑥})) | |
2 | sneq 4644 | . . 3 ⊢ (𝑥 = 𝑋 → {𝑥} = {𝑋}) | |
3 | 2 | xpeq2d 5723 | . 2 ⊢ (𝑥 = 𝑋 → (𝐼 × {𝑥}) = (𝐼 × {𝑋})) |
4 | simpr 484 | . 2 ⊢ ((𝐼 ∈ 𝑊 ∧ 𝑋 ∈ 𝐵) → 𝑋 ∈ 𝐵) | |
5 | snex 5445 | . . . 4 ⊢ {𝑋} ∈ V | |
6 | xpexg 7776 | . . . 4 ⊢ ((𝐼 ∈ 𝑊 ∧ {𝑋} ∈ V) → (𝐼 × {𝑋}) ∈ V) | |
7 | 5, 6 | mpan2 691 | . . 3 ⊢ (𝐼 ∈ 𝑊 → (𝐼 × {𝑋}) ∈ V) |
8 | 7 | adantr 480 | . 2 ⊢ ((𝐼 ∈ 𝑊 ∧ 𝑋 ∈ 𝐵) → (𝐼 × {𝑋}) ∈ V) |
9 | 1, 3, 4, 8 | fvmptd3 7046 | 1 ⊢ ((𝐼 ∈ 𝑊 ∧ 𝑋 ∈ 𝐵) → (𝐹‘𝑋) = (𝐼 × {𝑋})) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 395 = wceq 1539 ∈ wcel 2108 Vcvv 3481 {csn 4634 ↦ cmpt 5234 × cxp 5691 ‘cfv 6569 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1794 ax-4 1808 ax-5 1910 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-10 2141 ax-11 2157 ax-12 2177 ax-ext 2708 ax-sep 5305 ax-nul 5315 ax-pow 5374 ax-pr 5441 ax-un 7761 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3an 1089 df-tru 1542 df-fal 1552 df-ex 1779 df-nf 1783 df-sb 2065 df-mo 2540 df-eu 2569 df-clab 2715 df-cleq 2729 df-clel 2816 df-nfc 2892 df-ral 3062 df-rex 3071 df-rab 3437 df-v 3483 df-dif 3969 df-un 3971 df-in 3973 df-ss 3983 df-nul 4343 df-if 4535 df-pw 4610 df-sn 4635 df-pr 4637 df-op 4641 df-uni 4916 df-br 5152 df-opab 5214 df-mpt 5235 df-id 5587 df-xp 5699 df-rel 5700 df-cnv 5701 df-co 5702 df-dm 5703 df-iota 6522 df-fun 6571 df-fv 6577 |
This theorem is referenced by: pwsdiagmhm 18866 pwsdiaglmhm 21083 |
Copyright terms: Public domain | W3C validator |