ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  idref GIF version

Theorem idref 5396
Description: TODO: This is the same as issref 4707 (which has a much longer proof). Should we replace issref 4707 with this one? - NM 9-May-2016.

Two ways to state a relation is reflexive. (Adapted from Tarski.) (Contributed by FL, 15-Jan-2012.) (Proof shortened by Mario Carneiro, 3-Nov-2015.) (Proof modification is discouraged.)

Assertion
Ref Expression
idref (( I ↾ 𝐴) ⊆ 𝑅 ↔ ∀𝑥𝐴 𝑥𝑅𝑥)
Distinct variable groups:   𝑥,𝐴   𝑥,𝑅

Proof of Theorem idref
StepHypRef Expression
1 eqid 2040 . . . 4 (𝑥𝐴 ↦ ⟨𝑥, 𝑥⟩) = (𝑥𝐴 ↦ ⟨𝑥, 𝑥⟩)
21fmpt 5319 . . 3 (∀𝑥𝐴𝑥, 𝑥⟩ ∈ 𝑅 ↔ (𝑥𝐴 ↦ ⟨𝑥, 𝑥⟩):𝐴𝑅)
3 vex 2560 . . . . . 6 𝑥 ∈ V
43, 3opex 3966 . . . . 5 𝑥, 𝑥⟩ ∈ V
54, 1fnmpti 5027 . . . 4 (𝑥𝐴 ↦ ⟨𝑥, 𝑥⟩) Fn 𝐴
6 df-f 4906 . . . 4 ((𝑥𝐴 ↦ ⟨𝑥, 𝑥⟩):𝐴𝑅 ↔ ((𝑥𝐴 ↦ ⟨𝑥, 𝑥⟩) Fn 𝐴 ∧ ran (𝑥𝐴 ↦ ⟨𝑥, 𝑥⟩) ⊆ 𝑅))
75, 6mpbiran 847 . . 3 ((𝑥𝐴 ↦ ⟨𝑥, 𝑥⟩):𝐴𝑅 ↔ ran (𝑥𝐴 ↦ ⟨𝑥, 𝑥⟩) ⊆ 𝑅)
82, 7bitri 173 . 2 (∀𝑥𝐴𝑥, 𝑥⟩ ∈ 𝑅 ↔ ran (𝑥𝐴 ↦ ⟨𝑥, 𝑥⟩) ⊆ 𝑅)
9 df-br 3765 . . 3 (𝑥𝑅𝑥 ↔ ⟨𝑥, 𝑥⟩ ∈ 𝑅)
109ralbii 2330 . 2 (∀𝑥𝐴 𝑥𝑅𝑥 ↔ ∀𝑥𝐴𝑥, 𝑥⟩ ∈ 𝑅)
11 mptresid 4660 . . . 4 (𝑥𝐴𝑥) = ( I ↾ 𝐴)
123fnasrn 5341 . . . 4 (𝑥𝐴𝑥) = ran (𝑥𝐴 ↦ ⟨𝑥, 𝑥⟩)
1311, 12eqtr3i 2062 . . 3 ( I ↾ 𝐴) = ran (𝑥𝐴 ↦ ⟨𝑥, 𝑥⟩)
1413sseq1i 2969 . 2 (( I ↾ 𝐴) ⊆ 𝑅 ↔ ran (𝑥𝐴 ↦ ⟨𝑥, 𝑥⟩) ⊆ 𝑅)
158, 10, 143bitr4ri 202 1 (( I ↾ 𝐴) ⊆ 𝑅 ↔ ∀𝑥𝐴 𝑥𝑅𝑥)
Colors of variables: wff set class
Syntax hints:  wb 98  wcel 1393  wral 2306  wss 2917  cop 3378   class class class wbr 3764  cmpt 3818   I cid 4025  ran crn 4346  cres 4347   Fn wfn 4897  wf 4898
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 99  ax-ia2 100  ax-ia3 101  ax-io 630  ax-5 1336  ax-7 1337  ax-gen 1338  ax-ie1 1382  ax-ie2 1383  ax-8 1395  ax-10 1396  ax-11 1397  ax-i12 1398  ax-bndl 1399  ax-4 1400  ax-14 1405  ax-17 1419  ax-i9 1423  ax-ial 1427  ax-i5r 1428  ax-ext 2022  ax-sep 3875  ax-pow 3927  ax-pr 3944
This theorem depends on definitions:  df-bi 110  df-3an 887  df-tru 1246  df-nf 1350  df-sb 1646  df-eu 1903  df-mo 1904  df-clab 2027  df-cleq 2033  df-clel 2036  df-nfc 2167  df-ral 2311  df-rex 2312  df-reu 2313  df-rab 2315  df-v 2559  df-sbc 2765  df-csb 2853  df-un 2922  df-in 2924  df-ss 2931  df-pw 3361  df-sn 3381  df-pr 3382  df-op 3384  df-uni 3581  df-iun 3659  df-br 3765  df-opab 3819  df-mpt 3820  df-id 4030  df-xp 4351  df-rel 4352  df-cnv 4353  df-co 4354  df-dm 4355  df-rn 4356  df-res 4357  df-ima 4358  df-iota 4867  df-fun 4904  df-fn 4905  df-f 4906  df-f1 4907  df-fo 4908  df-f1o 4909  df-fv 4910
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator