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

Theorem erlecpbl 17599
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 1151 . . . 4 ((𝜑 ∧ (𝐴𝑉𝐵𝑉) ∧ (𝐶𝑉𝐷𝑉)) → Er 𝑉)
3 ercpbl.v . . . . 5 (𝜑𝑉𝑊)
433ad2ant1 1151 . . . 4 ((𝜑 ∧ (𝐴𝑉𝐵𝑉) ∧ (𝐶𝑉𝐷𝑉)) → 𝑉𝑊)
5 ercpbl.f . . . 4 𝐹 = (𝑥𝑉 ↦ [𝑥] )
6 simp2l 1218 . . . 4 ((𝜑 ∧ (𝐴𝑉𝐵𝑉) ∧ (𝐶𝑉𝐷𝑉)) → 𝐴𝑉)
72, 4, 5, 6ercpbllem 17597 . . 3 ((𝜑 ∧ (𝐴𝑉𝐵𝑉) ∧ (𝐶𝑉𝐷𝑉)) → ((𝐹𝐴) = (𝐹𝐶) ↔ 𝐴 𝐶))
8 simp2r 1219 . . . 4 ((𝜑 ∧ (𝐴𝑉𝐵𝑉) ∧ (𝐶𝑉𝐷𝑉)) → 𝐵𝑉)
92, 4, 5, 8ercpbllem 17597 . . 3 ((𝜑 ∧ (𝐴𝑉𝐵𝑉) ∧ (𝐶𝑉𝐷𝑉)) → ((𝐹𝐵) = (𝐹𝐷) ↔ 𝐵 𝐷))
107, 9anbi12d 643 . 2 ((𝜑 ∧ (𝐴𝑉𝐵𝑉) ∧ (𝐶𝑉𝐷𝑉)) → (((𝐹𝐴) = (𝐹𝐶) ∧ (𝐹𝐵) = (𝐹𝐷)) ↔ (𝐴 𝐶𝐵 𝐷)))
11 erlecpbl.e . . 3 (𝜑 → ((𝐴 𝐶𝐵 𝐷) → (𝐴𝑁𝐵𝐶𝑁𝐷)))
12113ad2ant1 1151 . 2 ((𝜑 ∧ (𝐴𝑉𝐵𝑉) ∧ (𝐶𝑉𝐷𝑉)) → ((𝐴 𝐶𝐵 𝐷) → (𝐴𝑁𝐵𝐶𝑁𝐷)))
1310, 12sylbid 243 1 ((𝜑 ∧ (𝐴𝑉𝐵𝑉) ∧ (𝐶𝑉𝐷𝑉)) → (((𝐹𝐴) = (𝐹𝐶) ∧ (𝐹𝐵) = (𝐹𝐷)) → (𝐴𝑁𝐵𝐶𝑁𝐷)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 209  wa 400  w3a 1103   = wceq 1570  wcel 2143   class class class wbr 5109  cmpt 5192  cfv 6536   Er wer 8687  [cec 8688
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-10 2176  ax-11 2192  ax-12 2213  ax-ext 2735  ax-sep 5257  ax-nul 5269  ax-pr 5404
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-nf 1814  df-sb 2097  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2838  df-nfc 2912  df-ne 2959  df-ral 3080  df-rex 3090  df-rab 3417  df-v 3457  df-dif 3908  df-un 3910  df-in 3912  df-ss 3922  df-nul 4287  df-if 4488  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4873  df-br 5110  df-opab 5174  df-mpt 5193  df-id 5556  df-xp 5667  df-rel 5668  df-cnv 5669  df-co 5670  df-dm 5671  df-rn 5672  df-res 5673  df-ima 5674  df-iota 6492  df-fun 6538  df-fv 6544  df-er 8690  df-ec 8692
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator