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 6910 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 | dfss2 3957 | . 2 ⊢ (( I ↾ 𝐴) ⊆ 𝑅 ↔ ∀𝑦(𝑦 ∈ ( I ↾ 𝐴) → 𝑦 ∈ 𝑅)) | |
2 | elrid 5915 | . . . . . 6 ⊢ (𝑦 ∈ ( I ↾ 𝐴) ↔ ∃𝑥 ∈ 𝐴 𝑦 = 〈𝑥, 𝑥〉) | |
3 | 2 | imbi1i 352 | . . . . 5 ⊢ ((𝑦 ∈ ( I ↾ 𝐴) → 𝑦 ∈ 𝑅) ↔ (∃𝑥 ∈ 𝐴 𝑦 = 〈𝑥, 𝑥〉 → 𝑦 ∈ 𝑅)) |
4 | r19.23v 3281 | . . . . 5 ⊢ (∀𝑥 ∈ 𝐴 (𝑦 = 〈𝑥, 𝑥〉 → 𝑦 ∈ 𝑅) ↔ (∃𝑥 ∈ 𝐴 𝑦 = 〈𝑥, 𝑥〉 → 𝑦 ∈ 𝑅)) | |
5 | eleq1 2902 | . . . . . . . 8 ⊢ (𝑦 = 〈𝑥, 𝑥〉 → (𝑦 ∈ 𝑅 ↔ 〈𝑥, 𝑥〉 ∈ 𝑅)) | |
6 | df-br 5069 | . . . . . . . 8 ⊢ (𝑥𝑅𝑥 ↔ 〈𝑥, 𝑥〉 ∈ 𝑅) | |
7 | 5, 6 | syl6bbr 291 | . . . . . . 7 ⊢ (𝑦 = 〈𝑥, 𝑥〉 → (𝑦 ∈ 𝑅 ↔ 𝑥𝑅𝑥)) |
8 | 7 | pm5.74i 273 | . . . . . 6 ⊢ ((𝑦 = 〈𝑥, 𝑥〉 → 𝑦 ∈ 𝑅) ↔ (𝑦 = 〈𝑥, 𝑥〉 → 𝑥𝑅𝑥)) |
9 | 8 | ralbii 3167 | . . . . 5 ⊢ (∀𝑥 ∈ 𝐴 (𝑦 = 〈𝑥, 𝑥〉 → 𝑦 ∈ 𝑅) ↔ ∀𝑥 ∈ 𝐴 (𝑦 = 〈𝑥, 𝑥〉 → 𝑥𝑅𝑥)) |
10 | 3, 4, 9 | 3bitr2i 301 | . . . 4 ⊢ ((𝑦 ∈ ( I ↾ 𝐴) → 𝑦 ∈ 𝑅) ↔ ∀𝑥 ∈ 𝐴 (𝑦 = 〈𝑥, 𝑥〉 → 𝑥𝑅𝑥)) |
11 | 10 | albii 1820 | . . 3 ⊢ (∀𝑦(𝑦 ∈ ( I ↾ 𝐴) → 𝑦 ∈ 𝑅) ↔ ∀𝑦∀𝑥 ∈ 𝐴 (𝑦 = 〈𝑥, 𝑥〉 → 𝑥𝑅𝑥)) |
12 | ralcom4 3237 | . . 3 ⊢ (∀𝑥 ∈ 𝐴 ∀𝑦(𝑦 = 〈𝑥, 𝑥〉 → 𝑥𝑅𝑥) ↔ ∀𝑦∀𝑥 ∈ 𝐴 (𝑦 = 〈𝑥, 𝑥〉 → 𝑥𝑅𝑥)) | |
13 | opex 5358 | . . . . 5 ⊢ 〈𝑥, 𝑥〉 ∈ V | |
14 | biidd 264 | . . . . 5 ⊢ (𝑦 = 〈𝑥, 𝑥〉 → (𝑥𝑅𝑥 ↔ 𝑥𝑅𝑥)) | |
15 | 13, 14 | ceqsalv 3534 | . . . 4 ⊢ (∀𝑦(𝑦 = 〈𝑥, 𝑥〉 → 𝑥𝑅𝑥) ↔ 𝑥𝑅𝑥) |
16 | 15 | ralbii 3167 | . . 3 ⊢ (∀𝑥 ∈ 𝐴 ∀𝑦(𝑦 = 〈𝑥, 𝑥〉 → 𝑥𝑅𝑥) ↔ ∀𝑥 ∈ 𝐴 𝑥𝑅𝑥) |
17 | 11, 12, 16 | 3bitr2i 301 | . 2 ⊢ (∀𝑦(𝑦 ∈ ( I ↾ 𝐴) → 𝑦 ∈ 𝑅) ↔ ∀𝑥 ∈ 𝐴 𝑥𝑅𝑥) |
18 | 1, 17 | bitri 277 | 1 ⊢ (( I ↾ 𝐴) ⊆ 𝑅 ↔ ∀𝑥 ∈ 𝐴 𝑥𝑅𝑥) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 208 ∀wal 1535 = wceq 1537 ∈ wcel 2114 ∀wral 3140 ∃wrex 3141 ⊆ wss 3938 〈cop 4575 class class class wbr 5068 I cid 5461 ↾ cres 5559 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2795 ax-sep 5205 ax-nul 5212 ax-pr 5332 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3an 1085 df-tru 1540 df-ex 1781 df-nf 1785 df-sb 2070 df-mo 2622 df-eu 2654 df-clab 2802 df-cleq 2816 df-clel 2895 df-nfc 2965 df-ral 3145 df-rex 3146 df-rab 3149 df-v 3498 df-dif 3941 df-un 3943 df-in 3945 df-ss 3954 df-nul 4294 df-if 4470 df-sn 4570 df-pr 4572 df-op 4576 df-br 5069 df-opab 5131 df-id 5462 df-xp 5563 df-rel 5564 df-res 5569 |
This theorem is referenced by: idinxpssinxp2 35577 idinxpssinxp3 35578 symrefref3 35802 refsymrels3 35804 elrefsymrels3 35808 dfeqvrels3 35826 refrelsredund3 35871 refrelredund3 35874 |
Copyright terms: Public domain | W3C validator |