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

Theorem erlecpbl 17603
Description: Translate the relation compatibility relation to a quotient set. (Contributed by Mario Carneiro, 24-Feb-2015.) (Revised by Mario Carneiro, 12-Aug-2015.) (Revised by AV, 12-Jul-2024.)
Hypotheses
Ref Expression
ercpbl.r (𝜑 Er 𝑉)
ercpbl.v (𝜑𝑉𝑊)
ercpbl.f 𝐹 = (𝑥𝑉 ↦ [𝑥] )
erlecpbl.e (𝜑 → ((𝐴 𝐶𝐵 𝐷) → (𝐴𝑁𝐵𝐶𝑁𝐷)))
Assertion
Ref Expression
erlecpbl ((𝜑 ∧ (𝐴𝑉𝐵𝑉) ∧ (𝐶𝑉𝐷𝑉)) → (((𝐹𝐴) = (𝐹𝐶) ∧ (𝐹𝐵) = (𝐹𝐷)) → (𝐴𝑁𝐵𝐶𝑁𝐷)))
Distinct variable groups:   𝑥,   𝑥,𝐴   𝑥,𝐵   𝑥,𝐶   𝑥,𝐷   𝑥,𝑉   𝜑,𝑥
Allowed substitution hints:   𝐹(𝑥)   𝑁(𝑥)   𝑊(𝑥)

Proof of Theorem erlecpbl
StepHypRef Expression
1 ercpbl.r . . . . 5 (𝜑 Er 𝑉)
213ad2ant1 1149 . . . 4 ((𝜑 ∧ (𝐴𝑉𝐵𝑉) ∧ (𝐶𝑉𝐷𝑉)) → Er 𝑉)
3 ercpbl.v . . . . 5 (𝜑𝑉𝑊)
433ad2ant1 1149 . . . 4 ((𝜑 ∧ (𝐴𝑉𝐵𝑉) ∧ (𝐶𝑉𝐷𝑉)) → 𝑉𝑊)
5 ercpbl.f . . . 4 𝐹 = (𝑥𝑉 ↦ [𝑥] )
6 simp2l 1216 . . . 4 ((𝜑 ∧ (𝐴𝑉𝐵𝑉) ∧ (𝐶𝑉𝐷𝑉)) → 𝐴𝑉)
72, 4, 5, 6ercpbllem 17601 . . 3 ((𝜑 ∧ (𝐴𝑉𝐵𝑉) ∧ (𝐶𝑉𝐷𝑉)) → ((𝐹𝐴) = (𝐹𝐶) ↔ 𝐴 𝐶))
8 simp2r 1217 . . . 4 ((𝜑 ∧ (𝐴𝑉𝐵𝑉) ∧ (𝐶𝑉𝐷𝑉)) → 𝐵𝑉)
92, 4, 5, 8ercpbllem 17601 . . 3 ((𝜑 ∧ (𝐴𝑉𝐵𝑉) ∧ (𝐶𝑉𝐷𝑉)) → ((𝐹𝐵) = (𝐹𝐷) ↔ 𝐵 𝐷))
107, 9anbi12d 643 . 2 ((𝜑 ∧ (𝐴𝑉𝐵𝑉) ∧ (𝐶𝑉𝐷𝑉)) → (((𝐹𝐴) = (𝐹𝐶) ∧ (𝐹𝐵) = (𝐹𝐷)) ↔ (𝐴 𝐶𝐵 𝐷)))
11 erlecpbl.e . . 3 (𝜑 → ((𝐴 𝐶𝐵 𝐷) → (𝐴𝑁𝐵𝐶𝑁𝐷)))
12113ad2ant1 1149 . 2 ((𝜑 ∧ (𝐴𝑉𝐵𝑉) ∧ (𝐶𝑉𝐷𝑉)) → ((𝐴 𝐶𝐵 𝐷) → (𝐴𝑁𝐵𝐶𝑁𝐷)))
1310, 12sylbid 243 1 ((𝜑 ∧ (𝐴𝑉𝐵𝑉) ∧ (𝐶𝑉𝐷𝑉)) → (((𝐹𝐴) = (𝐹𝐶) ∧ (𝐹𝐵) = (𝐹𝐷)) → (𝐴𝑁𝐵𝐶𝑁𝐷)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 209  wa 400  w3a 1101   = wceq 1567  wcel 2149   class class class wbr 5113  cmpt 5196  cfv 6537   Er wer 8690  [cec 8691
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1822  ax-4 1836  ax-5 1937  ax-6 1994  ax-7 2035  ax-8 2151  ax-9 2159  ax-10 2182  ax-11 2198  ax-12 2219  ax-ext 2741  ax-sep 5261  ax-nul 5271  ax-pr 5405
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1103  df-tru 1570  df-fal 1580  df-ex 1807  df-nf 1811  df-sb 2098  df-mo 2573  df-eu 2603  df-clab 2748  df-cleq 2761  df-clel 2844  df-nfc 2918  df-ne 2965  df-ral 3086  df-rex 3096  df-rab 3424  df-v 3465  df-dif 3916  df-un 3918  df-in 3920  df-ss 3930  df-nul 4295  df-if 4493  df-sn 4595  df-pr 4597  df-op 4601  df-uni 4877  df-br 5114  df-opab 5178  df-mpt 5197  df-id 5557  df-xp 5668  df-rel 5669  df-cnv 5670  df-co 5671  df-dm 5672  df-rn 5673  df-res 5674  df-ima 5675  df-iota 6493  df-fun 6539  df-fv 6545  df-er 8693  df-ec 8695
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator