| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > idrefALT | Structured version Visualization version GIF version | ||
| Description: Alternate proof of idref 7141 not relying on definitions related to functions. Two ways to state that a relation is reflexive on a class. (Contributed by FL, 15-Jan-2012.) (Proof shortened by Mario Carneiro, 3-Nov-2015.) (Revised by NM, 30-Mar-2016.) (Proof shortened by BJ, 28-Aug-2022.) The "proof modification is discouraged" tag is here only because this is an *ALT result. (Proof modification is discouraged.) (New usage is discouraged.) |
| Ref | Expression |
|---|---|
| idrefALT | ⊢ (( I ↾ 𝐴) ⊆ 𝑅 ↔ ∀𝑥 ∈ 𝐴 𝑥𝑅𝑥) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | df-ss 3948 | . 2 ⊢ (( I ↾ 𝐴) ⊆ 𝑅 ↔ ∀𝑦(𝑦 ∈ ( I ↾ 𝐴) → 𝑦 ∈ 𝑅)) | |
| 2 | elrid 6038 | . . . . . 6 ⊢ (𝑦 ∈ ( I ↾ 𝐴) ↔ ∃𝑥 ∈ 𝐴 𝑦 = 〈𝑥, 𝑥〉) | |
| 3 | 2 | imbi1i 349 | . . . . 5 ⊢ ((𝑦 ∈ ( I ↾ 𝐴) → 𝑦 ∈ 𝑅) ↔ (∃𝑥 ∈ 𝐴 𝑦 = 〈𝑥, 𝑥〉 → 𝑦 ∈ 𝑅)) |
| 4 | r19.23v 3169 | . . . . 5 ⊢ (∀𝑥 ∈ 𝐴 (𝑦 = 〈𝑥, 𝑥〉 → 𝑦 ∈ 𝑅) ↔ (∃𝑥 ∈ 𝐴 𝑦 = 〈𝑥, 𝑥〉 → 𝑦 ∈ 𝑅)) | |
| 5 | eleq1 2823 | . . . . . . . 8 ⊢ (𝑦 = 〈𝑥, 𝑥〉 → (𝑦 ∈ 𝑅 ↔ 〈𝑥, 𝑥〉 ∈ 𝑅)) | |
| 6 | df-br 5125 | . . . . . . . 8 ⊢ (𝑥𝑅𝑥 ↔ 〈𝑥, 𝑥〉 ∈ 𝑅) | |
| 7 | 5, 6 | bitr4di 289 | . . . . . . 7 ⊢ (𝑦 = 〈𝑥, 𝑥〉 → (𝑦 ∈ 𝑅 ↔ 𝑥𝑅𝑥)) |
| 8 | 7 | pm5.74i 271 | . . . . . 6 ⊢ ((𝑦 = 〈𝑥, 𝑥〉 → 𝑦 ∈ 𝑅) ↔ (𝑦 = 〈𝑥, 𝑥〉 → 𝑥𝑅𝑥)) |
| 9 | 8 | ralbii 3083 | . . . . 5 ⊢ (∀𝑥 ∈ 𝐴 (𝑦 = 〈𝑥, 𝑥〉 → 𝑦 ∈ 𝑅) ↔ ∀𝑥 ∈ 𝐴 (𝑦 = 〈𝑥, 𝑥〉 → 𝑥𝑅𝑥)) |
| 10 | 3, 4, 9 | 3bitr2i 299 | . . . 4 ⊢ ((𝑦 ∈ ( I ↾ 𝐴) → 𝑦 ∈ 𝑅) ↔ ∀𝑥 ∈ 𝐴 (𝑦 = 〈𝑥, 𝑥〉 → 𝑥𝑅𝑥)) |
| 11 | 10 | albii 1819 | . . 3 ⊢ (∀𝑦(𝑦 ∈ ( I ↾ 𝐴) → 𝑦 ∈ 𝑅) ↔ ∀𝑦∀𝑥 ∈ 𝐴 (𝑦 = 〈𝑥, 𝑥〉 → 𝑥𝑅𝑥)) |
| 12 | ralcom4 3272 | . . 3 ⊢ (∀𝑥 ∈ 𝐴 ∀𝑦(𝑦 = 〈𝑥, 𝑥〉 → 𝑥𝑅𝑥) ↔ ∀𝑦∀𝑥 ∈ 𝐴 (𝑦 = 〈𝑥, 𝑥〉 → 𝑥𝑅𝑥)) | |
| 13 | opex 5444 | . . . . 5 ⊢ 〈𝑥, 𝑥〉 ∈ V | |
| 14 | biidd 262 | . . . . 5 ⊢ (𝑦 = 〈𝑥, 𝑥〉 → (𝑥𝑅𝑥 ↔ 𝑥𝑅𝑥)) | |
| 15 | 13, 14 | ceqsalv 3505 | . . . 4 ⊢ (∀𝑦(𝑦 = 〈𝑥, 𝑥〉 → 𝑥𝑅𝑥) ↔ 𝑥𝑅𝑥) |
| 16 | 15 | ralbii 3083 | . . 3 ⊢ (∀𝑥 ∈ 𝐴 ∀𝑦(𝑦 = 〈𝑥, 𝑥〉 → 𝑥𝑅𝑥) ↔ ∀𝑥 ∈ 𝐴 𝑥𝑅𝑥) |
| 17 | 11, 12, 16 | 3bitr2i 299 | . 2 ⊢ (∀𝑦(𝑦 ∈ ( I ↾ 𝐴) → 𝑦 ∈ 𝑅) ↔ ∀𝑥 ∈ 𝐴 𝑥𝑅𝑥) |
| 18 | 1, 17 | bitri 275 | 1 ⊢ (( I ↾ 𝐴) ⊆ 𝑅 ↔ ∀𝑥 ∈ 𝐴 𝑥𝑅𝑥) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∀wal 1538 = wceq 1540 ∈ wcel 2109 ∀wral 3052 ∃wrex 3061 ⊆ wss 3931 〈cop 4612 class class class wbr 5124 I cid 5552 ↾ cres 5661 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-11 2158 ax-ext 2708 ax-sep 5271 ax-nul 5281 ax-pr 5407 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-sb 2066 df-clab 2715 df-cleq 2728 df-clel 2810 df-ral 3053 df-rex 3062 df-rab 3421 df-v 3466 df-dif 3934 df-un 3936 df-in 3938 df-ss 3948 df-nul 4314 df-if 4506 df-sn 4607 df-pr 4609 df-op 4613 df-br 5125 df-opab 5187 df-id 5553 df-xp 5665 df-rel 5666 df-res 5671 |
| This theorem is referenced by: idinxpssinxp2 38341 idinxpssinxp3 38342 symrefref3 38587 refsymrels3 38589 elrefsymrels3 38593 dfeqvrels3 38612 refrelsredund3 38657 refrelredund3 38660 |
| Copyright terms: Public domain | W3C validator |