Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > idref | Structured version Visualization version GIF version |
Description: 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.) |
Ref | Expression |
---|---|
idref | ⊢ (( I ↾ 𝐴) ⊆ 𝑅 ↔ ∀𝑥 ∈ 𝐴 𝑥𝑅𝑥) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | eqid 2824 | . . . 4 ⊢ (𝑥 ∈ 𝐴 ↦ 〈𝑥, 𝑥〉) = (𝑥 ∈ 𝐴 ↦ 〈𝑥, 𝑥〉) | |
2 | 1 | fmpt 6877 | . . 3 ⊢ (∀𝑥 ∈ 𝐴 〈𝑥, 𝑥〉 ∈ 𝑅 ↔ (𝑥 ∈ 𝐴 ↦ 〈𝑥, 𝑥〉):𝐴⟶𝑅) |
3 | opex 5359 | . . . . 5 ⊢ 〈𝑥, 𝑥〉 ∈ V | |
4 | 3, 1 | fnmpti 6494 | . . . 4 ⊢ (𝑥 ∈ 𝐴 ↦ 〈𝑥, 𝑥〉) Fn 𝐴 |
5 | df-f 6362 | . . . 4 ⊢ ((𝑥 ∈ 𝐴 ↦ 〈𝑥, 𝑥〉):𝐴⟶𝑅 ↔ ((𝑥 ∈ 𝐴 ↦ 〈𝑥, 𝑥〉) Fn 𝐴 ∧ ran (𝑥 ∈ 𝐴 ↦ 〈𝑥, 𝑥〉) ⊆ 𝑅)) | |
6 | 4, 5 | mpbiran 707 | . . 3 ⊢ ((𝑥 ∈ 𝐴 ↦ 〈𝑥, 𝑥〉):𝐴⟶𝑅 ↔ ran (𝑥 ∈ 𝐴 ↦ 〈𝑥, 𝑥〉) ⊆ 𝑅) |
7 | 2, 6 | bitri 277 | . 2 ⊢ (∀𝑥 ∈ 𝐴 〈𝑥, 𝑥〉 ∈ 𝑅 ↔ ran (𝑥 ∈ 𝐴 ↦ 〈𝑥, 𝑥〉) ⊆ 𝑅) |
8 | df-br 5070 | . . 3 ⊢ (𝑥𝑅𝑥 ↔ 〈𝑥, 𝑥〉 ∈ 𝑅) | |
9 | 8 | ralbii 3168 | . 2 ⊢ (∀𝑥 ∈ 𝐴 𝑥𝑅𝑥 ↔ ∀𝑥 ∈ 𝐴 〈𝑥, 𝑥〉 ∈ 𝑅) |
10 | mptresid 5921 | . . . 4 ⊢ ( I ↾ 𝐴) = (𝑥 ∈ 𝐴 ↦ 𝑥) | |
11 | vex 3500 | . . . . 5 ⊢ 𝑥 ∈ V | |
12 | 11 | fnasrn 6910 | . . . 4 ⊢ (𝑥 ∈ 𝐴 ↦ 𝑥) = ran (𝑥 ∈ 𝐴 ↦ 〈𝑥, 𝑥〉) |
13 | 10, 12 | eqtri 2847 | . . 3 ⊢ ( I ↾ 𝐴) = ran (𝑥 ∈ 𝐴 ↦ 〈𝑥, 𝑥〉) |
14 | 13 | sseq1i 3998 | . 2 ⊢ (( I ↾ 𝐴) ⊆ 𝑅 ↔ ran (𝑥 ∈ 𝐴 ↦ 〈𝑥, 𝑥〉) ⊆ 𝑅) |
15 | 7, 9, 14 | 3bitr4ri 306 | 1 ⊢ (( I ↾ 𝐴) ⊆ 𝑅 ↔ ∀𝑥 ∈ 𝐴 𝑥𝑅𝑥) |
Colors of variables: wff setvar class |
Syntax hints: ↔ wb 208 ∈ wcel 2113 ∀wral 3141 ⊆ wss 3939 〈cop 4576 class class class wbr 5069 ↦ cmpt 5149 I cid 5462 ran crn 5559 ↾ cres 5560 Fn wfn 6353 ⟶wf 6354 |
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 1969 ax-7 2014 ax-8 2115 ax-9 2123 ax-10 2144 ax-11 2160 ax-12 2176 ax-ext 2796 ax-sep 5206 ax-nul 5213 ax-pr 5333 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3an 1085 df-tru 1539 df-ex 1780 df-nf 1784 df-sb 2069 df-mo 2621 df-eu 2653 df-clab 2803 df-cleq 2817 df-clel 2896 df-nfc 2966 df-ne 3020 df-ral 3146 df-rex 3147 df-reu 3148 df-rab 3150 df-v 3499 df-sbc 3776 df-csb 3887 df-dif 3942 df-un 3944 df-in 3946 df-ss 3955 df-nul 4295 df-if 4471 df-sn 4571 df-pr 4573 df-op 4577 df-uni 4842 df-iun 4924 df-br 5070 df-opab 5132 df-mpt 5150 df-id 5463 df-xp 5564 df-rel 5565 df-cnv 5566 df-co 5567 df-dm 5568 df-rn 5569 df-res 5570 df-ima 5571 df-iota 6317 df-fun 6360 df-fn 6361 df-f 6362 df-f1 6363 df-fo 6364 df-f1o 6365 df-fv 6366 |
This theorem is referenced by: retos 20765 filnetlem2 33731 |
Copyright terms: Public domain | W3C validator |