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

Theorem idrefALT 6120
Description: Alternate proof of idref 7176 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 3901 . 2 (( I ↾ 𝐴) ⊆ 𝑅 ↔ ∀𝑦(𝑦 ∈ ( I ↾ 𝐴) → 𝑦 ∈ 𝑅))
2 elrid 6051 . . . . . 6 (𝑦 ∈ ( I ↾ 𝐴) ↔ ∃𝑥 ∈ 𝐴 𝑦 = ⟨𝑥, 𝑥⟩)
32imbi1i 352 . . . . 5 ((𝑦 ∈ ( I ↾ 𝐴) → 𝑦 ∈ 𝑅) ↔ (∃𝑥 ∈ 𝐴 𝑦 = ⟨𝑥, 𝑥⟩ → 𝑦 ∈ 𝑅))
4 r19.23v 3193 . . . . 5 (∀𝑥 ∈ 𝐴 (𝑦 = ⟨𝑥, 𝑥⟩ → 𝑦 ∈ 𝑅) ↔ (∃𝑥 ∈ 𝐴 𝑦 = ⟨𝑥, 𝑥⟩ → 𝑦 ∈ 𝑅))
5 eleq1 2852 . . . . . . . 8 (𝑦 = ⟨𝑥, 𝑥⟩ → (𝑦 ∈ 𝑅 ↔ ⟨𝑥, 𝑥⟩ ∈ 𝑅))
6 df-br 5107 . . . . . . . 8 (𝑥𝑅𝑥 ↔ ⟨𝑥, 𝑥⟩ ∈ 𝑅)
75, 6bitr4di 292 . . . . . . 7 (𝑦 = ⟨𝑥, 𝑥⟩ → (𝑦 ∈ 𝑅 ↔ 𝑥𝑅𝑥))
87pm5.74i 274 . . . . . 6 ((𝑦 = ⟨𝑥, 𝑥⟩ → 𝑦 ∈ 𝑅) ↔ (𝑦 = ⟨𝑥, 𝑥⟩ → 𝑥𝑅𝑥))
98ralbii 3112 . . . . 5 (∀𝑥 ∈ 𝐴 (𝑦 = ⟨𝑥, 𝑥⟩ → 𝑦 ∈ 𝑅) ↔ ∀𝑥 ∈ 𝐴 (𝑦 = ⟨𝑥, 𝑥⟩ → 𝑥𝑅𝑥))
103, 4, 93bitr2i 302 . . . 4 ((𝑦 ∈ ( I ↾ 𝐴) → 𝑦 ∈ 𝑅) ↔ ∀𝑥 ∈ 𝐴 (𝑦 = ⟨𝑥, 𝑥⟩ → 𝑥𝑅𝑥))
1110albii 1852 . . 3 (∀𝑦(𝑦 ∈ ( I ↾ 𝐴) → 𝑦 ∈ 𝑅) ↔ ∀𝑦∀𝑥 ∈ 𝐴 (𝑦 = ⟨𝑥, 𝑥⟩ → 𝑥𝑅𝑥))
12 ralcom4 3292 . . 3 (∀𝑥 ∈ 𝐴 ∀𝑦(𝑦 = ⟨𝑥, 𝑥⟩ → 𝑥𝑅𝑥) ↔ ∀𝑦∀𝑥 ∈ 𝐴 (𝑦 = ⟨𝑥, 𝑥⟩ → 𝑥𝑅𝑥))
13 opex 5437 . . . . 5 ⟨𝑥, 𝑥⟩ ∈ V
14 biidd 265 . . . . 5 (𝑦 = ⟨𝑥, 𝑥⟩ → (𝑥𝑅𝑥 ↔ 𝑥𝑅𝑥))
1513, 14ceqsalv 3493 . . . 4 (∀𝑦(𝑦 = ⟨𝑥, 𝑥⟩ → 𝑥𝑅𝑥) ↔ 𝑥𝑅𝑥)
1615ralbii 3112 . . 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 1568   = wceq 1570   ∈ wcel 2147  ∀wral 3080  ∃wrex 3090   ⊆ wss 3900  ⟨cop 4838   class class class wbr 5106   I cid 5550   ↾ cres 5658
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-11 2197  ax-ext 2735  ax-sep 5253  ax-pr 5396
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4839  df-br 5107  df-opab 5172  df-id 5551  df-xp 5662  df-rel 5663  df-res 5668
This theorem is used by:  idinxpssinxp2  39459  idinxpssinxp3  39460  symrefref3  39783  refsymrels3  39785  elrefsymrels3  39789  dfeqvrels3  39808  refrelsredund3  39853  refrelredund3  39856
  Copyright terms: Public domain W3C validator