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

Theorem erinxp 7766
 Description: A restricted equivalence relation is an equivalence relation. (Contributed by Mario Carneiro, 10-Jul-2015.) (Revised by Mario Carneiro, 12-Aug-2015.)
Hypotheses
Ref Expression
erinxp.r (𝜑𝑅 Er 𝐴)
erinxp.a (𝜑𝐵𝐴)
Assertion
Ref Expression
erinxp (𝜑 → (𝑅 ∩ (𝐵 × 𝐵)) Er 𝐵)

Proof of Theorem erinxp
Dummy variables 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 inss2 3812 . . . 4 (𝑅 ∩ (𝐵 × 𝐵)) ⊆ (𝐵 × 𝐵)
2 relxp 5188 . . . 4 Rel (𝐵 × 𝐵)
3 relss 5167 . . . 4 ((𝑅 ∩ (𝐵 × 𝐵)) ⊆ (𝐵 × 𝐵) → (Rel (𝐵 × 𝐵) → Rel (𝑅 ∩ (𝐵 × 𝐵))))
41, 2, 3mp2 9 . . 3 Rel (𝑅 ∩ (𝐵 × 𝐵))
54a1i 11 . 2 (𝜑 → Rel (𝑅 ∩ (𝐵 × 𝐵)))
6 simpr 477 . . . . 5 ((𝜑𝑥(𝑅 ∩ (𝐵 × 𝐵))𝑦) → 𝑥(𝑅 ∩ (𝐵 × 𝐵))𝑦)
7 brinxp2 5141 . . . . 5 (𝑥(𝑅 ∩ (𝐵 × 𝐵))𝑦 ↔ (𝑥𝐵𝑦𝐵𝑥𝑅𝑦))
86, 7sylib 208 . . . 4 ((𝜑𝑥(𝑅 ∩ (𝐵 × 𝐵))𝑦) → (𝑥𝐵𝑦𝐵𝑥𝑅𝑦))
98simp2d 1072 . . 3 ((𝜑𝑥(𝑅 ∩ (𝐵 × 𝐵))𝑦) → 𝑦𝐵)
108simp1d 1071 . . 3 ((𝜑𝑥(𝑅 ∩ (𝐵 × 𝐵))𝑦) → 𝑥𝐵)
11 erinxp.r . . . . 5 (𝜑𝑅 Er 𝐴)
1211adantr 481 . . . 4 ((𝜑𝑥(𝑅 ∩ (𝐵 × 𝐵))𝑦) → 𝑅 Er 𝐴)
138simp3d 1073 . . . 4 ((𝜑𝑥(𝑅 ∩ (𝐵 × 𝐵))𝑦) → 𝑥𝑅𝑦)
1412, 13ersym 7699 . . 3 ((𝜑𝑥(𝑅 ∩ (𝐵 × 𝐵))𝑦) → 𝑦𝑅𝑥)
15 brinxp2 5141 . . 3 (𝑦(𝑅 ∩ (𝐵 × 𝐵))𝑥 ↔ (𝑦𝐵𝑥𝐵𝑦𝑅𝑥))
169, 10, 14, 15syl3anbrc 1244 . 2 ((𝜑𝑥(𝑅 ∩ (𝐵 × 𝐵))𝑦) → 𝑦(𝑅 ∩ (𝐵 × 𝐵))𝑥)
1710adantrr 752 . . 3 ((𝜑 ∧ (𝑥(𝑅 ∩ (𝐵 × 𝐵))𝑦𝑦(𝑅 ∩ (𝐵 × 𝐵))𝑧)) → 𝑥𝐵)
18 simprr 795 . . . . 5 ((𝜑 ∧ (𝑥(𝑅 ∩ (𝐵 × 𝐵))𝑦𝑦(𝑅 ∩ (𝐵 × 𝐵))𝑧)) → 𝑦(𝑅 ∩ (𝐵 × 𝐵))𝑧)
19 brinxp2 5141 . . . . 5 (𝑦(𝑅 ∩ (𝐵 × 𝐵))𝑧 ↔ (𝑦𝐵𝑧𝐵𝑦𝑅𝑧))
2018, 19sylib 208 . . . 4 ((𝜑 ∧ (𝑥(𝑅 ∩ (𝐵 × 𝐵))𝑦𝑦(𝑅 ∩ (𝐵 × 𝐵))𝑧)) → (𝑦𝐵𝑧𝐵𝑦𝑅𝑧))
2120simp2d 1072 . . 3 ((𝜑 ∧ (𝑥(𝑅 ∩ (𝐵 × 𝐵))𝑦𝑦(𝑅 ∩ (𝐵 × 𝐵))𝑧)) → 𝑧𝐵)
2211adantr 481 . . . 4 ((𝜑 ∧ (𝑥(𝑅 ∩ (𝐵 × 𝐵))𝑦𝑦(𝑅 ∩ (𝐵 × 𝐵))𝑧)) → 𝑅 Er 𝐴)
2313adantrr 752 . . . 4 ((𝜑 ∧ (𝑥(𝑅 ∩ (𝐵 × 𝐵))𝑦𝑦(𝑅 ∩ (𝐵 × 𝐵))𝑧)) → 𝑥𝑅𝑦)
2420simp3d 1073 . . . 4 ((𝜑 ∧ (𝑥(𝑅 ∩ (𝐵 × 𝐵))𝑦𝑦(𝑅 ∩ (𝐵 × 𝐵))𝑧)) → 𝑦𝑅𝑧)
2522, 23, 24ertrd 7703 . . 3 ((𝜑 ∧ (𝑥(𝑅 ∩ (𝐵 × 𝐵))𝑦𝑦(𝑅 ∩ (𝐵 × 𝐵))𝑧)) → 𝑥𝑅𝑧)
26 brinxp2 5141 . . 3 (𝑥(𝑅 ∩ (𝐵 × 𝐵))𝑧 ↔ (𝑥𝐵𝑧𝐵𝑥𝑅𝑧))
2717, 21, 25, 26syl3anbrc 1244 . 2 ((𝜑 ∧ (𝑥(𝑅 ∩ (𝐵 × 𝐵))𝑦𝑦(𝑅 ∩ (𝐵 × 𝐵))𝑧)) → 𝑥(𝑅 ∩ (𝐵 × 𝐵))𝑧)
2811adantr 481 . . . . . 6 ((𝜑𝑥𝐵) → 𝑅 Er 𝐴)
29 erinxp.a . . . . . . 7 (𝜑𝐵𝐴)
3029sselda 3583 . . . . . 6 ((𝜑𝑥𝐵) → 𝑥𝐴)
3128, 30erref 7707 . . . . 5 ((𝜑𝑥𝐵) → 𝑥𝑅𝑥)
3231ex 450 . . . 4 (𝜑 → (𝑥𝐵𝑥𝑅𝑥))
3332pm4.71rd 666 . . 3 (𝜑 → (𝑥𝐵 ↔ (𝑥𝑅𝑥𝑥𝐵)))
34 brin 4664 . . . 4 (𝑥(𝑅 ∩ (𝐵 × 𝐵))𝑥 ↔ (𝑥𝑅𝑥𝑥(𝐵 × 𝐵)𝑥))
35 brxp 5107 . . . . . 6 (𝑥(𝐵 × 𝐵)𝑥 ↔ (𝑥𝐵𝑥𝐵))
36 anidm 675 . . . . . 6 ((𝑥𝐵𝑥𝐵) ↔ 𝑥𝐵)
3735, 36bitri 264 . . . . 5 (𝑥(𝐵 × 𝐵)𝑥𝑥𝐵)
3837anbi2i 729 . . . 4 ((𝑥𝑅𝑥𝑥(𝐵 × 𝐵)𝑥) ↔ (𝑥𝑅𝑥𝑥𝐵))
3934, 38bitri 264 . . 3 (𝑥(𝑅 ∩ (𝐵 × 𝐵))𝑥 ↔ (𝑥𝑅𝑥𝑥𝐵))
4033, 39syl6bbr 278 . 2 (𝜑 → (𝑥𝐵𝑥(𝑅 ∩ (𝐵 × 𝐵))𝑥))
415, 16, 27, 40iserd 7713 1 (𝜑 → (𝑅 ∩ (𝐵 × 𝐵)) Er 𝐵)
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ∧ wa 384   ∧ w3a 1036   ∈ wcel 1987   ∩ cin 3554   ⊆ wss 3555   class class class wbr 4613   × cxp 5072  Rel wrel 5079   Er wer 7684 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1719  ax-4 1734  ax-5 1836  ax-6 1885  ax-7 1932  ax-9 1996  ax-10 2016  ax-11 2031  ax-12 2044  ax-13 2245  ax-ext 2601  ax-sep 4741  ax-nul 4749  ax-pr 4867 This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1038  df-tru 1483  df-ex 1702  df-nf 1707  df-sb 1878  df-eu 2473  df-mo 2474  df-clab 2608  df-cleq 2614  df-clel 2617  df-nfc 2750  df-ral 2912  df-rex 2913  df-rab 2916  df-v 3188  df-dif 3558  df-un 3560  df-in 3562  df-ss 3569  df-nul 3892  df-if 4059  df-sn 4149  df-pr 4151  df-op 4155  df-br 4614  df-opab 4674  df-xp 5080  df-rel 5081  df-cnv 5082  df-co 5083  df-dm 5084  df-er 7687 This theorem is referenced by:  frgpuplem  18106  pi1buni  22748  pi1addf  22755  pi1addval  22756  pi1grplem  22757
 Copyright terms: Public domain W3C validator