| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > restidsing | 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 5089 | . 2 ⊢ Rel ( I ↾ {𝐴}) | |
| 2 | relxp 4882 | . 2 ⊢ Rel ({𝐴} × {𝐴}) | |
| 3 | velsn 3725 | . . . . 5 ⊢ (𝑥 ∈ {𝐴} ↔ 𝑥 = 𝐴) | |
| 4 | velsn 3725 | . . . . 5 ⊢ (𝑦 ∈ {𝐴} ↔ 𝑦 = 𝐴) | |
| 5 | 3, 4 | anbi12i 464 | . . . 4 ⊢ ((𝑥 ∈ {𝐴} ∧ 𝑦 ∈ {𝐴}) ↔ (𝑥 = 𝐴 ∧ 𝑦 = 𝐴)) |
| 6 | vex 2824 | . . . . . . 7 ⊢ 𝑦 ∈ V | |
| 7 | 6 | ideq 4930 | . . . . . 6 ⊢ (𝑥 I 𝑦 ↔ 𝑥 = 𝑦) |
| 8 | 3, 7 | anbi12i 464 | . . . . 5 ⊢ ((𝑥 ∈ {𝐴} ∧ 𝑥 I 𝑦) ↔ (𝑥 = 𝐴 ∧ 𝑥 = 𝑦)) |
| 9 | eqeq1 2245 | . . . . . . 7 ⊢ (𝑥 = 𝐴 → (𝑥 = 𝑦 ↔ 𝐴 = 𝑦)) | |
| 10 | eqcom 2240 | . . . . . . 7 ⊢ (𝐴 = 𝑦 ↔ 𝑦 = 𝐴) | |
| 11 | 9, 10 | bitrdi 196 | . . . . . 6 ⊢ (𝑥 = 𝐴 → (𝑥 = 𝑦 ↔ 𝑦 = 𝐴)) |
| 12 | 11 | pm5.32i 458 | . . . . 5 ⊢ ((𝑥 = 𝐴 ∧ 𝑥 = 𝑦) ↔ (𝑥 = 𝐴 ∧ 𝑦 = 𝐴)) |
| 13 | 8, 12 | bitri 184 | . . . 4 ⊢ ((𝑥 ∈ {𝐴} ∧ 𝑥 I 𝑦) ↔ (𝑥 = 𝐴 ∧ 𝑦 = 𝐴)) |
| 14 | df-br 4129 | . . . . 5 ⊢ (𝑥 I 𝑦 ↔ 〈𝑥, 𝑦〉 ∈ I ) | |
| 15 | 14 | anbi2i 461 | . . . 4 ⊢ ((𝑥 ∈ {𝐴} ∧ 𝑥 I 𝑦) ↔ (𝑥 ∈ {𝐴} ∧ 〈𝑥, 𝑦〉 ∈ I )) |
| 16 | 5, 13, 15 | 3bitr2ri 209 | . . 3 ⊢ ((𝑥 ∈ {𝐴} ∧ 〈𝑥, 𝑦〉 ∈ I ) ↔ (𝑥 ∈ {𝐴} ∧ 𝑦 ∈ {𝐴})) |
| 17 | 6 | opelres 5066 | . . . 4 ⊢ (〈𝑥, 𝑦〉 ∈ ( I ↾ {𝐴}) ↔ (〈𝑥, 𝑦〉 ∈ I ∧ 𝑥 ∈ {𝐴})) |
| 18 | 17 | biancomi 270 | . . 3 ⊢ (〈𝑥, 𝑦〉 ∈ ( I ↾ {𝐴}) ↔ (𝑥 ∈ {𝐴} ∧ 〈𝑥, 𝑦〉 ∈ I )) |
| 19 | opelxp 4802 | . . 3 ⊢ (〈𝑥, 𝑦〉 ∈ ({𝐴} × {𝐴}) ↔ (𝑥 ∈ {𝐴} ∧ 𝑦 ∈ {𝐴})) | |
| 20 | 16, 18, 19 | 3bitr4i 212 | . 2 ⊢ (〈𝑥, 𝑦〉 ∈ ( I ↾ {𝐴}) ↔ 〈𝑥, 𝑦〉 ∈ ({𝐴} × {𝐴})) |
| 21 | 1, 2, 20 | eqrelriiv 4867 | 1 ⊢ ( I ↾ {𝐴}) = ({𝐴} × {𝐴}) |
| Colors of variables: wff set class |
| Syntax hints: ∧ wa 104 = wceq 1402 ∈ wcel 2209 {csn 3708 〈cop 3711 class class class wbr 4128 I cid 4431 × cxp 4770 ↾ cres 4774 |
| 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 721 ax-5 1500 ax-7 1501 ax-gen 1502 ax-ie1 1546 ax-ie2 1547 ax-8 1557 ax-10 1558 ax-11 1559 ax-i12 1560 ax-bndl 1562 ax-4 1563 ax-17 1579 ax-i9 1583 ax-ial 1587 ax-i5r 1588 ax-14 2212 ax-ext 2220 ax-sep 4247 ax-pow 4309 ax-pr 4344 |
| This theorem depends on definitions: df-bi 117 df-3an 1011 df-tru 1405 df-nf 1514 df-sb 1816 df-eu 2089 df-mo 2090 df-clab 2225 df-cleq 2231 df-clel 2234 df-nfc 2381 df-ral 2533 df-rex 2534 df-v 2823 df-un 3224 df-in 3226 df-ss 3233 df-pw 3690 df-sn 3714 df-pr 3715 df-op 3717 df-br 4129 df-opab 4191 df-id 4436 df-xp 4778 df-rel 4779 df-res 4784 |
| This theorem is referenced by: grp1inv 13895 |
| Copyright terms: Public domain | W3C validator |