| 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 4591 | . . . 4 ⊢ {𝐴, 𝐵} = ({𝐴} ∪ {𝐵}) | |
| 2 | 1 | reseq2i 5983 | . . 3 ⊢ ( I ↾ {𝐴, 𝐵}) = ( I ↾ ({𝐴} ∪ {𝐵})) |
| 3 | resundi 6000 | . . 3 ⊢ ( I ↾ ({𝐴} ∪ {𝐵})) = (( I ↾ {𝐴}) ∪ ( I ↾ {𝐵})) | |
| 4 | 2, 3 | eqtri 2786 | . 2 ⊢ ( I ↾ {𝐴, 𝐵}) = (( I ↾ {𝐴}) ∪ ( I ↾ {𝐵})) |
| 5 | xpsng 7172 | . . . . . 6 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐴 ∈ 𝑉) → ({𝐴} × {𝐴}) = {〈𝐴, 𝐴〉}) | |
| 6 | 5 | anidms 577 | . . . . 5 ⊢ (𝐴 ∈ 𝑉 → ({𝐴} × {𝐴}) = {〈𝐴, 𝐴〉}) |
| 7 | 6 | adantr 486 | . . . 4 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → ({𝐴} × {𝐴}) = {〈𝐴, 𝐴〉}) |
| 8 | xpsng 7172 | . . . . . 6 ⊢ ((𝐵 ∈ 𝑊 ∧ 𝐵 ∈ 𝑊) → ({𝐵} × {𝐵}) = {〈𝐵, 𝐵〉}) | |
| 9 | 8 | anidms 577 | . . . . 5 ⊢ (𝐵 ∈ 𝑊 → ({𝐵} × {𝐵}) = {〈𝐵, 𝐵〉}) |
| 10 | 9 | adantl 487 | . . . 4 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → ({𝐵} × {𝐵}) = {〈𝐵, 𝐵〉}) |
| 11 | 7, 10 | uneq12d 4171 | . . 3 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (({𝐴} × {𝐴}) ∪ ({𝐵} × {𝐵})) = ({〈𝐴, 𝐴〉} ∪ {〈𝐵, 𝐵〉})) |
| 12 | restidsing 6063 | . . . 4 ⊢ ( I ↾ {𝐴}) = ({𝐴} × {𝐴}) | |
| 13 | restidsing 6063 | . . . 4 ⊢ ( I ↾ {𝐵}) = ({𝐵} × {𝐵}) | |
| 14 | 12, 13 | uneq12i 4168 | . . 3 ⊢ (( I ↾ {𝐴}) ∪ ( I ↾ {𝐵})) = (({𝐴} × {𝐴}) ∪ ({𝐵} × {𝐵})) |
| 15 | df-pr 4591 | . . 3 ⊢ {〈𝐴, 𝐴〉, 〈𝐵, 𝐵〉} = ({〈𝐴, 𝐴〉} ∪ {〈𝐵, 𝐵〉}) | |
| 16 | 11, 14, 15 | 3eqtr4g 2823 | . 2 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (( I ↾ {𝐴}) ∪ ( I ↾ {𝐵})) = {〈𝐴, 𝐴〉, 〈𝐵, 𝐵〉}) |
| 17 | 4, 16 | eqtrid 2810 | 1 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → ( I ↾ {𝐴, 𝐵}) = {〈𝐴, 𝐴〉, 〈𝐵, 𝐵〉}) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1570 ∈ wcel 2147 ∪ cun 4152 {csn 4588 {cpr 4590 〈cop 4840 I cid 5552 × cxp 5656 ↾ cres 5660 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-sep 5255 ax-pr 5398 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-ral 3081 df-rex 3091 df-reu 3370 df-rab 3417 df-v 3456 df-ss 3901 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-sn 4589 df-pr 4591 df-op 4841 df-br 5109 df-opab 5174 df-mpt 5193 df-id 5553 df-xp 5664 df-rel 5665 df-cnv 5666 df-co 5667 df-dm 5668 df-rn 5669 df-res 5670 df-fun 6568 df-fn 6569 df-f 6570 df-f1 6571 df-fo 6572 df-f1o 6573 |
| This theorem is used by: psgnprfval1 19787 |
| Copyright terms: Public domain | W3C validator |