| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > residpr | Structured version Visualization version GIF version | ||
| Description: Restriction of the identity to a pair. (Contributed by AV, 11-Dec-2018.) |
| Ref | Expression |
|---|---|
| residpr | ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → ( I ↾ {𝐴, 𝐵}) = {〈𝐴, 𝐴〉, 〈𝐵, 𝐵〉}) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | df-pr 4583 | . . . 4 ⊢ {𝐴, 𝐵} = ({𝐴} ∪ {𝐵}) | |
| 2 | 1 | reseq2i 5935 | . . 3 ⊢ ( I ↾ {𝐴, 𝐵}) = ( I ↾ ({𝐴} ∪ {𝐵})) |
| 3 | resundi 5952 | . . 3 ⊢ ( I ↾ ({𝐴} ∪ {𝐵})) = (( I ↾ {𝐴}) ∪ ( I ↾ {𝐵})) | |
| 4 | 2, 3 | eqtri 2759 | . 2 ⊢ ( I ↾ {𝐴, 𝐵}) = (( I ↾ {𝐴}) ∪ ( I ↾ {𝐵})) |
| 5 | xpsng 7084 | . . . . . 6 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐴 ∈ 𝑉) → ({𝐴} × {𝐴}) = {〈𝐴, 𝐴〉}) | |
| 6 | 5 | anidms 566 | . . . . 5 ⊢ (𝐴 ∈ 𝑉 → ({𝐴} × {𝐴}) = {〈𝐴, 𝐴〉}) |
| 7 | 6 | adantr 480 | . . . 4 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → ({𝐴} × {𝐴}) = {〈𝐴, 𝐴〉}) |
| 8 | xpsng 7084 | . . . . . 6 ⊢ ((𝐵 ∈ 𝑊 ∧ 𝐵 ∈ 𝑊) → ({𝐵} × {𝐵}) = {〈𝐵, 𝐵〉}) | |
| 9 | 8 | anidms 566 | . . . . 5 ⊢ (𝐵 ∈ 𝑊 → ({𝐵} × {𝐵}) = {〈𝐵, 𝐵〉}) |
| 10 | 9 | adantl 481 | . . . 4 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → ({𝐵} × {𝐵}) = {〈𝐵, 𝐵〉}) |
| 11 | 7, 10 | uneq12d 4121 | . . 3 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (({𝐴} × {𝐴}) ∪ ({𝐵} × {𝐵})) = ({〈𝐴, 𝐴〉} ∪ {〈𝐵, 𝐵〉})) |
| 12 | restidsing 6012 | . . . 4 ⊢ ( I ↾ {𝐴}) = ({𝐴} × {𝐴}) | |
| 13 | restidsing 6012 | . . . 4 ⊢ ( I ↾ {𝐵}) = ({𝐵} × {𝐵}) | |
| 14 | 12, 13 | uneq12i 4118 | . . 3 ⊢ (( I ↾ {𝐴}) ∪ ( I ↾ {𝐵})) = (({𝐴} × {𝐴}) ∪ ({𝐵} × {𝐵})) |
| 15 | df-pr 4583 | . . 3 ⊢ {〈𝐴, 𝐴〉, 〈𝐵, 𝐵〉} = ({〈𝐴, 𝐴〉} ∪ {〈𝐵, 𝐵〉}) | |
| 16 | 11, 14, 15 | 3eqtr4g 2796 | . 2 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (( I ↾ {𝐴}) ∪ ( I ↾ {𝐵})) = {〈𝐴, 𝐴〉, 〈𝐵, 𝐵〉}) |
| 17 | 4, 16 | eqtrid 2783 | 1 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → ( I ↾ {𝐴, 𝐵}) = {〈𝐴, 𝐴〉, 〈𝐵, 𝐵〉}) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1541 ∈ wcel 2113 ∪ cun 3899 {csn 4580 {cpr 4582 〈cop 4586 I cid 5518 × cxp 5622 ↾ cres 5626 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2184 ax-ext 2708 ax-sep 5241 ax-nul 5251 ax-pr 5377 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2539 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2811 df-nfc 2885 df-ne 2933 df-ral 3052 df-rex 3061 df-reu 3351 df-rab 3400 df-v 3442 df-dif 3904 df-un 3906 df-in 3908 df-ss 3918 df-nul 4286 df-if 4480 df-sn 4581 df-pr 4583 df-op 4587 df-br 5099 df-opab 5161 df-mpt 5180 df-id 5519 df-xp 5630 df-rel 5631 df-cnv 5632 df-co 5633 df-dm 5634 df-rn 5635 df-res 5636 df-fun 6494 df-fn 6495 df-f 6496 df-f1 6497 df-fo 6498 df-f1o 6499 |
| This theorem is referenced by: psgnprfval1 19451 |
| Copyright terms: Public domain | W3C validator |