| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > restidsing | Structured version Visualization version GIF version | ||
| Description: Restriction of the identity to a singleton. (Contributed by FL, 2-Aug-2009.) (Proof shortened by JJ, 25-Aug-2021.) (Proof shortened by Peter Mazsa, 6-Oct-2022.) |
| Ref | Expression |
|---|---|
| restidsing | ⊢ ( I ↾ {𝐴}) = ({𝐴} × {𝐴}) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | relres 5992 | . 2 ⊢ Rel ( I ↾ {𝐴}) | |
| 2 | relxp 5665 | . 2 ⊢ Rel ({𝐴} × {𝐴}) | |
| 3 | velsn 4599 | . . . . 5 ⊢ (𝑥 ∈ {𝐴} ↔ 𝑥 = 𝐴) | |
| 4 | velsn 4599 | . . . . 5 ⊢ (𝑦 ∈ {𝐴} ↔ 𝑦 = 𝐴) | |
| 5 | 3, 4 | anbi12i 640 | . . . 4 ⊢ ((𝑥 ∈ {𝐴} ∧ 𝑦 ∈ {𝐴}) ↔ (𝑥 = 𝐴 ∧ 𝑦 = 𝐴)) |
| 6 | vex 3454 | . . . . . . 7 ⊢ 𝑦 ∈ V | |
| 7 | 6 | ideq 5826 | . . . . . 6 ⊢ (𝑥 I 𝑦 ↔ 𝑥 = 𝑦) |
| 8 | 3, 7 | anbi12i 640 | . . . . 5 ⊢ ((𝑥 ∈ {𝐴} ∧ 𝑥 I 𝑦) ↔ (𝑥 = 𝐴 ∧ 𝑥 = 𝑦)) |
| 9 | eqeq1 2764 | . . . . . . 7 ⊢ (𝑥 = 𝐴 → (𝑥 = 𝑦 ↔ 𝐴 = 𝑦)) | |
| 10 | eqcom 2767 | . . . . . . 7 ⊢ (𝐴 = 𝑦 ↔ 𝑦 = 𝐴) | |
| 11 | 9, 10 | bitrdi 290 | . . . . . 6 ⊢ (𝑥 = 𝐴 → (𝑥 = 𝑦 ↔ 𝑦 = 𝐴)) |
| 12 | 11 | pm5.32i 585 | . . . . 5 ⊢ ((𝑥 = 𝐴 ∧ 𝑥 = 𝑦) ↔ (𝑥 = 𝐴 ∧ 𝑦 = 𝐴)) |
| 13 | 8, 12 | bitri 278 | . . . 4 ⊢ ((𝑥 ∈ {𝐴} ∧ 𝑥 I 𝑦) ↔ (𝑥 = 𝐴 ∧ 𝑦 = 𝐴)) |
| 14 | df-br 5103 | . . . . 5 ⊢ (𝑥 I 𝑦 ↔ 〈𝑥, 𝑦〉 ∈ I ) | |
| 15 | 14 | anbi2i 635 | . . . 4 ⊢ ((𝑥 ∈ {𝐴} ∧ 𝑥 I 𝑦) ↔ (𝑥 ∈ {𝐴} ∧ 〈𝑥, 𝑦〉 ∈ I )) |
| 16 | 5, 13, 15 | 3bitr2ri 303 | . . 3 ⊢ ((𝑥 ∈ {𝐴} ∧ 〈𝑥, 𝑦〉 ∈ I ) ↔ (𝑥 ∈ {𝐴} ∧ 𝑦 ∈ {𝐴})) |
| 17 | 6 | opelresi 5974 | . . 3 ⊢ (〈𝑥, 𝑦〉 ∈ ( I ↾ {𝐴}) ↔ (𝑥 ∈ {𝐴} ∧ 〈𝑥, 𝑦〉 ∈ I )) |
| 18 | opelxp 5683 | . . 3 ⊢ (〈𝑥, 𝑦〉 ∈ ({𝐴} × {𝐴}) ↔ (𝑥 ∈ {𝐴} ∧ 𝑦 ∈ {𝐴})) | |
| 19 | 16, 17, 18 | 3bitr4i 306 | . 2 ⊢ (〈𝑥, 𝑦〉 ∈ ( I ↾ {𝐴}) ↔ 〈𝑥, 𝑦〉 ∈ ({𝐴} × {𝐴})) |
| 20 | 1, 2, 19 | eqrelriiv 5762 | 1 ⊢ ( I ↾ {𝐴}) = ({𝐴} × {𝐴}) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ∧ wa 401 = wceq 1570 ∈ wcel 2145 {csn 4583 〈cop 4589 class class class wbr 5102 I cid 5541 × cxp 5645 ↾ cres 5649 |
| 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 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-ext 2732 ax-sep 5248 ax-pr 5390 |
| 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-sb 2100 df-clab 2739 df-cleq 2752 df-clel 2835 df-ral 3077 df-rex 3087 df-rab 3413 df-v 3452 df-dif 3901 df-un 3903 df-in 3905 df-ss 3915 df-nul 4279 df-if 4482 df-sn 4584 df-pr 4586 df-op 4590 df-br 5103 df-opab 5167 df-id 5542 df-xp 5653 df-rel 5654 df-res 5659 |
| This theorem is used by: residpr 7134 grp1inv 19220 psgnsn 19696 m1detdiag 22874 |
| Copyright terms: Public domain | W3C validator |