![]() |
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 4183 | . . 3 ⊢ (𝑋 ∈ 𝐵 → {𝑋} ∈ V) | |
3 | xpexg 4739 | . . 3 ⊢ ((𝐼 ∈ 𝑊 ∧ {𝑋} ∈ V) → (𝐼 × {𝑋}) ∈ V) | |
4 | 2, 3 | sylan2 286 | . 2 ⊢ ((𝐼 ∈ 𝑊 ∧ 𝑋 ∈ 𝐵) → (𝐼 × {𝑋}) ∈ V) |
5 | sneq 3603 | . . . 4 ⊢ (𝑥 = 𝑋 → {𝑥} = {𝑋}) | |
6 | 5 | xpeq2d 4649 | . . 3 ⊢ (𝑥 = 𝑋 → (𝐼 × {𝑥}) = (𝐼 × {𝑋})) |
7 | fdiagfn.f | . . 3 ⊢ 𝐹 = (𝑥 ∈ 𝐵 ↦ (𝐼 × {𝑥})) | |
8 | 6, 7 | fvmptg 5591 | . 2 ⊢ ((𝑋 ∈ 𝐵 ∧ (𝐼 × {𝑋}) ∈ V) → (𝐹‘𝑋) = (𝐼 × {𝑋})) |
9 | 1, 4, 8 | syl2anc 411 | 1 ⊢ ((𝐼 ∈ 𝑊 ∧ 𝑋 ∈ 𝐵) → (𝐹‘𝑋) = (𝐼 × {𝑋})) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 104 = wceq 1353 ∈ wcel 2148 Vcvv 2737 {csn 3592 ↦ cmpt 4063 × cxp 4623 ‘cfv 5215 |
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 709 ax-5 1447 ax-7 1448 ax-gen 1449 ax-ie1 1493 ax-ie2 1494 ax-8 1504 ax-10 1505 ax-11 1506 ax-i12 1507 ax-bndl 1509 ax-4 1510 ax-17 1526 ax-i9 1530 ax-ial 1534 ax-i5r 1535 ax-13 2150 ax-14 2151 ax-ext 2159 ax-sep 4120 ax-pow 4173 ax-pr 4208 ax-un 4432 |
This theorem depends on definitions: df-bi 117 df-3an 980 df-tru 1356 df-nf 1461 df-sb 1763 df-eu 2029 df-mo 2030 df-clab 2164 df-cleq 2170 df-clel 2173 df-nfc 2308 df-ral 2460 df-rex 2461 df-v 2739 df-sbc 2963 df-un 3133 df-in 3135 df-ss 3142 df-pw 3577 df-sn 3598 df-pr 3599 df-op 3601 df-uni 3810 df-br 4003 df-opab 4064 df-mpt 4065 df-id 4292 df-xp 4631 df-rel 4632 df-cnv 4633 df-co 4634 df-dm 4635 df-iota 5177 df-fun 5217 df-fv 5223 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |