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

Theorem idrefALT 6106
Description: Alternate proof of idref 7149 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 df-ss 3896 . 2 (( I ↾ 𝐴) ⊆ 𝑅 ↔ ∀𝑦(𝑦 ∈ ( I ↾ 𝐴) → 𝑦 ∈ 𝑅))
2 elrid 6037 . . . . . 6 (𝑦 ∈ ( I ↾ 𝐴) ↔ ∃𝑥 ∈ 𝐴 𝑦 = ⟨𝑥, 𝑥⟩)
32imbi1i 352 . . . . 5 ((𝑦 ∈ ( I ↾ 𝐴) → 𝑦 ∈ 𝑅) ↔ (∃𝑥 ∈ 𝐴 𝑦 = ⟨𝑥, 𝑥⟩ → 𝑦 ∈ 𝑅))
4 r19.23v 3189 . . . . 5 (∀𝑥 ∈ 𝐴 (𝑦 = ⟨𝑥, 𝑥⟩ → 𝑦 ∈ 𝑅) ↔ (∃𝑥 ∈ 𝐴 𝑦 = ⟨𝑥, 𝑥⟩ → 𝑦 ∈ 𝑅))
5 eleq1 2848 . . . . . . . 8 (𝑦 = ⟨𝑥, 𝑥⟩ → (𝑦 ∈ 𝑅 ↔ ⟨𝑥, 𝑥⟩ ∈ 𝑅))
6 df-br 5103 . . . . . . . 8 (𝑥𝑅𝑥 ↔ ⟨𝑥, 𝑥⟩ ∈ 𝑅)
75, 6bitr4di 292 . . . . . . 7 (𝑦 = ⟨𝑥, 𝑥⟩ → (𝑦 ∈ 𝑅 ↔ 𝑥𝑅𝑥))
87pm5.74i 274 . . . . . 6 ((𝑦 = ⟨𝑥, 𝑥⟩ → 𝑦 ∈ 𝑅) ↔ (𝑦 = ⟨𝑥, 𝑥⟩ → 𝑥𝑅𝑥))
98ralbii 3108 . . . . 5 (∀𝑥 ∈ 𝐴 (𝑦 = ⟨𝑥, 𝑥⟩ → 𝑦 ∈ 𝑅) ↔ ∀𝑥 ∈ 𝐴 (𝑦 = ⟨𝑥, 𝑥⟩ → 𝑥𝑅𝑥))
103, 4, 93bitr2i 302 . . . 4 ((𝑦 ∈ ( I ↾ 𝐴) → 𝑦 ∈ 𝑅) ↔ ∀𝑥 ∈ 𝐴 (𝑦 = ⟨𝑥, 𝑥⟩ → 𝑥𝑅𝑥))
1110albii 1851 . . 3 (∀𝑦(𝑦 ∈ ( I ↾ 𝐴) → 𝑦 ∈ 𝑅) ↔ ∀𝑦∀𝑥 ∈ 𝐴 (𝑦 = ⟨𝑥, 𝑥⟩ → 𝑥𝑅𝑥))
12 ralcom4 3288 . . 3 (∀𝑥 ∈ 𝐴 ∀𝑦(𝑦 = ⟨𝑥, 𝑥⟩ → 𝑥𝑅𝑥) ↔ ∀𝑦∀𝑥 ∈ 𝐴 (𝑦 = ⟨𝑥, 𝑥⟩ → 𝑥𝑅𝑥))
13 opex 5431 . . . . 5 ⟨𝑥, 𝑥⟩ ∈ V
14 biidd 265 . . . . 5 (𝑦 = ⟨𝑥, 𝑥⟩ → (𝑥𝑅𝑥 ↔ 𝑥𝑅𝑥))
1513, 14ceqsalv 3489 . . . 4 (∀𝑦(𝑦 = ⟨𝑥, 𝑥⟩ → 𝑥𝑅𝑥) ↔ 𝑥𝑅𝑥)
1615ralbii 3108 . . 3 (∀𝑥 ∈ 𝐴 ∀𝑦(𝑦 = ⟨𝑥, 𝑥⟩ → 𝑥𝑅𝑥) ↔ ∀𝑥 ∈ 𝐴 𝑥𝑅𝑥)
1711, 12, 163bitr2i 302 . 2 (∀𝑦(𝑦 ∈ ( I ↾ 𝐴) → 𝑦 ∈ 𝑅) ↔ ∀𝑥 ∈ 𝐴 𝑥𝑅𝑥)
181, 17bitri 278 1 (( I ↾ 𝐴) ⊆ 𝑅 ↔ ∀𝑥 ∈ 𝐴 𝑥𝑅𝑥)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209  ∀wal 1567   = wceq 1569   ∈ wcel 2144  ∀wral 3076  ∃wrex 3086   ⊆ wss 3895  ⟨cop 4834   class class class wbr 5102   I cid 5544   ↾ cres 5652
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-11 2193  ax-ext 2732  ax-sep 5248  ax-pr 5390
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-sb 2099  df-clab 2739  df-cleq 2752  df-clel 2835  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-ss 3896  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-sn 4585  df-pr 4587  df-op 4835  df-br 5103  df-opab 5167  df-id 5545  df-xp 5656  df-rel 5657  df-res 5662
This theorem is used by:  idinxpssinxp2  39349  idinxpssinxp3  39350  symrefref3  39673  refsymrels3  39675  elrefsymrels3  39679  dfeqvrels3  39698  refrelsredund3  39743  refrelredund3  39746
  Copyright terms: Public domain W3C validator