Metamath Proof Explorer < Previous   Next > Nearby theorems Mirrors  >  Home  >  MPE Home  >  Th. List  >  idrefALT Structured version   Visualization version   GIF version

Theorem idrefALT 5967
 Description: Alternate proof of idref 6902 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.)
Assertion
Ref Expression
idrefALT (( I ↾ 𝐴) ⊆ 𝑅 ↔ ∀𝑥𝐴 𝑥𝑅𝑥)
Distinct variable groups:   𝑥,𝑅   𝑥,𝐴

Proof of Theorem idrefALT
Dummy variable 𝑦 is distinct from all other variables.
StepHypRef Expression
1 dfss2 3954 . 2 (( I ↾ 𝐴) ⊆ 𝑅 ↔ ∀𝑦(𝑦 ∈ ( I ↾ 𝐴) → 𝑦𝑅))
2 elrid 5907 . . . . . 6 (𝑦 ∈ ( I ↾ 𝐴) ↔ ∃𝑥𝐴 𝑦 = ⟨𝑥, 𝑥⟩)
32imbi1i 352 . . . . 5 ((𝑦 ∈ ( I ↾ 𝐴) → 𝑦𝑅) ↔ (∃𝑥𝐴 𝑦 = ⟨𝑥, 𝑥⟩ → 𝑦𝑅))
4 r19.23v 3279 . . . . 5 (∀𝑥𝐴 (𝑦 = ⟨𝑥, 𝑥⟩ → 𝑦𝑅) ↔ (∃𝑥𝐴 𝑦 = ⟨𝑥, 𝑥⟩ → 𝑦𝑅))
5 eleq1 2900 . . . . . . . 8 (𝑦 = ⟨𝑥, 𝑥⟩ → (𝑦𝑅 ↔ ⟨𝑥, 𝑥⟩ ∈ 𝑅))
6 df-br 5059 . . . . . . . 8 (𝑥𝑅𝑥 ↔ ⟨𝑥, 𝑥⟩ ∈ 𝑅)
75, 6syl6bbr 291 . . . . . . 7 (𝑦 = ⟨𝑥, 𝑥⟩ → (𝑦𝑅𝑥𝑅𝑥))
87pm5.74i 273 . . . . . 6 ((𝑦 = ⟨𝑥, 𝑥⟩ → 𝑦𝑅) ↔ (𝑦 = ⟨𝑥, 𝑥⟩ → 𝑥𝑅𝑥))
98ralbii 3165 . . . . 5 (∀𝑥𝐴 (𝑦 = ⟨𝑥, 𝑥⟩ → 𝑦𝑅) ↔ ∀𝑥𝐴 (𝑦 = ⟨𝑥, 𝑥⟩ → 𝑥𝑅𝑥))
103, 4, 93bitr2i 301 . . . 4 ((𝑦 ∈ ( I ↾ 𝐴) → 𝑦𝑅) ↔ ∀𝑥𝐴 (𝑦 = ⟨𝑥, 𝑥⟩ → 𝑥𝑅𝑥))
1110albii 1816 . . 3 (∀𝑦(𝑦 ∈ ( I ↾ 𝐴) → 𝑦𝑅) ↔ ∀𝑦𝑥𝐴 (𝑦 = ⟨𝑥, 𝑥⟩ → 𝑥𝑅𝑥))
12 ralcom4 3235 . . 3 (∀𝑥𝐴𝑦(𝑦 = ⟨𝑥, 𝑥⟩ → 𝑥𝑅𝑥) ↔ ∀𝑦𝑥𝐴 (𝑦 = ⟨𝑥, 𝑥⟩ → 𝑥𝑅𝑥))
13 opex 5348 . . . . 5 𝑥, 𝑥⟩ ∈ V
14 biidd 264 . . . . 5 (𝑦 = ⟨𝑥, 𝑥⟩ → (𝑥𝑅𝑥𝑥𝑅𝑥))
1513, 14ceqsalv 3532 . . . 4 (∀𝑦(𝑦 = ⟨𝑥, 𝑥⟩ → 𝑥𝑅𝑥) ↔ 𝑥𝑅𝑥)
1615ralbii 3165 . . 3 (∀𝑥𝐴𝑦(𝑦 = ⟨𝑥, 𝑥⟩ → 𝑥𝑅𝑥) ↔ ∀𝑥𝐴 𝑥𝑅𝑥)
1711, 12, 163bitr2i 301 . 2 (∀𝑦(𝑦 ∈ ( I ↾ 𝐴) → 𝑦𝑅) ↔ ∀𝑥𝐴 𝑥𝑅𝑥)
181, 17bitri 277 1 (( I ↾ 𝐴) ⊆ 𝑅 ↔ ∀𝑥𝐴 𝑥𝑅𝑥)
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ↔ wb 208  ∀wal 1531   = wceq 1533   ∈ wcel 2110  ∀wral 3138  ∃wrex 3139   ⊆ wss 3935  ⟨cop 4566   class class class wbr 5058   I cid 5453   ↾ cres 5551 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1907  ax-6 1966  ax-7 2011  ax-8 2112  ax-9 2120  ax-10 2141  ax-11 2157  ax-12 2173  ax-ext 2793  ax-sep 5195  ax-nul 5202  ax-pr 5321 This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1085  df-tru 1536  df-ex 1777  df-nf 1781  df-sb 2066  df-mo 2618  df-eu 2650  df-clab 2800  df-cleq 2814  df-clel 2893  df-nfc 2963  df-ral 3143  df-rex 3144  df-rab 3147  df-v 3496  df-dif 3938  df-un 3940  df-in 3942  df-ss 3951  df-nul 4291  df-if 4467  df-sn 4561  df-pr 4563  df-op 4567  df-br 5059  df-opab 5121  df-id 5454  df-xp 5555  df-rel 5556  df-res 5561 This theorem is referenced by:  idinxpssinxp2  35569  idinxpssinxp3  35570  symrefref3  35794  refsymrels3  35796  elrefsymrels3  35800  dfeqvrels3  35818  refrelsredund3  35863  refrelredund3  35866
 Copyright terms: Public domain W3C validator