![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > fvdiagfn | 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 | simpr 110 | . 2 ⊢ ((𝐼 ∈ 𝑊 ∧ 𝑋 ∈ 𝐵) → 𝑋 ∈ 𝐵) | |
2 | snexg 4199 | . . 3 ⊢ (𝑋 ∈ 𝐵 → {𝑋} ∈ V) | |
3 | xpexg 4755 | . . 3 ⊢ ((𝐼 ∈ 𝑊 ∧ {𝑋} ∈ V) → (𝐼 × {𝑋}) ∈ V) | |
4 | 2, 3 | sylan2 286 | . 2 ⊢ ((𝐼 ∈ 𝑊 ∧ 𝑋 ∈ 𝐵) → (𝐼 × {𝑋}) ∈ V) |
5 | sneq 3618 | . . . 4 ⊢ (𝑥 = 𝑋 → {𝑥} = {𝑋}) | |
6 | 5 | xpeq2d 4665 | . . 3 ⊢ (𝑥 = 𝑋 → (𝐼 × {𝑥}) = (𝐼 × {𝑋})) |
7 | fdiagfn.f | . . 3 ⊢ 𝐹 = (𝑥 ∈ 𝐵 ↦ (𝐼 × {𝑥})) | |
8 | 6, 7 | fvmptg 5609 | . 2 ⊢ ((𝑋 ∈ 𝐵 ∧ (𝐼 × {𝑋}) ∈ V) → (𝐹‘𝑋) = (𝐼 × {𝑋})) |
9 | 1, 4, 8 | syl2anc 411 | 1 ⊢ ((𝐼 ∈ 𝑊 ∧ 𝑋 ∈ 𝐵) → (𝐹‘𝑋) = (𝐼 × {𝑋})) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 104 = wceq 1364 ∈ wcel 2160 Vcvv 2752 {csn 3607 ↦ cmpt 4079 × cxp 4639 ‘cfv 5232 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-io 710 ax-5 1458 ax-7 1459 ax-gen 1460 ax-ie1 1504 ax-ie2 1505 ax-8 1515 ax-10 1516 ax-11 1517 ax-i12 1518 ax-bndl 1520 ax-4 1521 ax-17 1537 ax-i9 1541 ax-ial 1545 ax-i5r 1546 ax-13 2162 ax-14 2163 ax-ext 2171 ax-sep 4136 ax-pow 4189 ax-pr 4224 ax-un 4448 |
This theorem depends on definitions: df-bi 117 df-3an 982 df-tru 1367 df-nf 1472 df-sb 1774 df-eu 2041 df-mo 2042 df-clab 2176 df-cleq 2182 df-clel 2185 df-nfc 2321 df-ral 2473 df-rex 2474 df-v 2754 df-sbc 2978 df-un 3148 df-in 3150 df-ss 3157 df-pw 3592 df-sn 3613 df-pr 3614 df-op 3616 df-uni 3825 df-br 4019 df-opab 4080 df-mpt 4081 df-id 4308 df-xp 4647 df-rel 4648 df-cnv 4649 df-co 4650 df-dm 4651 df-iota 5193 df-fun 5234 df-fv 5240 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |