| 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 4597 | . . . 4 ⊢ {𝐴, 𝐵} = ({𝐴} ∪ {𝐵}) | |
| 2 | 1 | reseq2i 5976 | . . 3 ⊢ ( I ↾ {𝐴, 𝐵}) = ( I ↾ ({𝐴} ∪ {𝐵})) |
| 3 | resundi 5993 | . . 3 ⊢ ( I ↾ ({𝐴} ∪ {𝐵})) = (( I ↾ {𝐴}) ∪ ( I ↾ {𝐵})) | |
| 4 | 2, 3 | eqtri 2792 | . 2 ⊢ ( I ↾ {𝐴, 𝐵}) = (( I ↾ {𝐴}) ∪ ( I ↾ {𝐵})) |
| 5 | xpsng 7136 | . . . . . 6 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐴 ∈ 𝑉) → ({𝐴} × {𝐴}) = {〈𝐴, 𝐴〉}) | |
| 6 | 5 | anidms 576 | . . . . 5 ⊢ (𝐴 ∈ 𝑉 → ({𝐴} × {𝐴}) = {〈𝐴, 𝐴〉}) |
| 7 | 6 | adantr 485 | . . . 4 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → ({𝐴} × {𝐴}) = {〈𝐴, 𝐴〉}) |
| 8 | xpsng 7136 | . . . . . 6 ⊢ ((𝐵 ∈ 𝑊 ∧ 𝐵 ∈ 𝑊) → ({𝐵} × {𝐵}) = {〈𝐵, 𝐵〉}) | |
| 9 | 8 | anidms 576 | . . . . 5 ⊢ (𝐵 ∈ 𝑊 → ({𝐵} × {𝐵}) = {〈𝐵, 𝐵〉}) |
| 10 | 9 | adantl 486 | . . . 4 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → ({𝐵} × {𝐵}) = {〈𝐵, 𝐵〉}) |
| 11 | 7, 10 | uneq12d 4131 | . . 3 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (({𝐴} × {𝐴}) ∪ ({𝐵} × {𝐵})) = ({〈𝐴, 𝐴〉} ∪ {〈𝐵, 𝐵〉})) |
| 12 | restidsing 6056 | . . . 4 ⊢ ( I ↾ {𝐴}) = ({𝐴} × {𝐴}) | |
| 13 | restidsing 6056 | . . . 4 ⊢ ( I ↾ {𝐵}) = ({𝐵} × {𝐵}) | |
| 14 | 12, 13 | uneq12i 4128 | . . 3 ⊢ (( I ↾ {𝐴}) ∪ ( I ↾ {𝐵})) = (({𝐴} × {𝐴}) ∪ ({𝐵} × {𝐵})) |
| 15 | df-pr 4597 | . . 3 ⊢ {〈𝐴, 𝐴〉, 〈𝐵, 𝐵〉} = ({〈𝐴, 𝐴〉} ∪ {〈𝐵, 𝐵〉}) | |
| 16 | 11, 14, 15 | 3eqtr4g 2829 | . 2 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (( I ↾ {𝐴}) ∪ ( I ↾ {𝐵})) = {〈𝐴, 𝐴〉, 〈𝐵, 𝐵〉}) |
| 17 | 4, 16 | eqtrid 2816 | 1 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → ( I ↾ {𝐴, 𝐵}) = {〈𝐴, 𝐴〉, 〈𝐵, 𝐵〉}) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 400 = wceq 1567 ∈ wcel 2149 ∪ cun 3911 {csn 4594 {cpr 4596 〈cop 4600 I cid 5556 × cxp 5660 ↾ cres 5664 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1822 ax-4 1836 ax-5 1937 ax-6 1994 ax-7 2035 ax-8 2151 ax-9 2159 ax-10 2182 ax-11 2198 ax-12 2219 ax-ext 2741 ax-sep 5261 ax-pr 5405 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1103 df-tru 1570 df-fal 1580 df-ex 1807 df-nf 1811 df-sb 2098 df-mo 2573 df-eu 2603 df-clab 2748 df-cleq 2761 df-clel 2844 df-nfc 2918 df-ne 2965 df-ral 3086 df-rex 3096 df-reu 3377 df-rab 3424 df-v 3465 df-dif 3916 df-un 3918 df-in 3920 df-ss 3930 df-nul 4295 df-if 4493 df-sn 4595 df-pr 4597 df-op 4601 df-br 5114 df-opab 5178 df-mpt 5197 df-id 5557 df-xp 5668 df-rel 5669 df-cnv 5670 df-co 5671 df-dm 5672 df-rn 5673 df-res 5674 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 |
| This theorem is referenced by: psgnprfval1 19592 |
| Copyright terms: Public domain | W3C validator |