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

Theorem erlecpbl 16832
 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 1130 . . . 4 ((𝜑 ∧ (𝐴𝑉𝐵𝑉) ∧ (𝐶𝑉𝐷𝑉)) → Er 𝑉)
3 ercpbl.v . . . . 5 (𝜑𝑉𝑊)
433ad2ant1 1130 . . . 4 ((𝜑 ∧ (𝐴𝑉𝐵𝑉) ∧ (𝐶𝑉𝐷𝑉)) → 𝑉𝑊)
5 ercpbl.f . . . 4 𝐹 = (𝑥𝑉 ↦ [𝑥] )
6 simp2l 1196 . . . 4 ((𝜑 ∧ (𝐴𝑉𝐵𝑉) ∧ (𝐶𝑉𝐷𝑉)) → 𝐴𝑉)
72, 4, 5, 6ercpbllem 16830 . . 3 ((𝜑 ∧ (𝐴𝑉𝐵𝑉) ∧ (𝐶𝑉𝐷𝑉)) → ((𝐹𝐴) = (𝐹𝐶) ↔ 𝐴 𝐶))
8 simp2r 1197 . . . 4 ((𝜑 ∧ (𝐴𝑉𝐵𝑉) ∧ (𝐶𝑉𝐷𝑉)) → 𝐵𝑉)
92, 4, 5, 8ercpbllem 16830 . . 3 ((𝜑 ∧ (𝐴𝑉𝐵𝑉) ∧ (𝐶𝑉𝐷𝑉)) → ((𝐹𝐵) = (𝐹𝐷) ↔ 𝐵 𝐷))
107, 9anbi12d 633 . 2 ((𝜑 ∧ (𝐴𝑉𝐵𝑉) ∧ (𝐶𝑉𝐷𝑉)) → (((𝐹𝐴) = (𝐹𝐶) ∧ (𝐹𝐵) = (𝐹𝐷)) ↔ (𝐴 𝐶𝐵 𝐷)))
11 erlecpbl.e . . 3 (𝜑 → ((𝐴 𝐶𝐵 𝐷) → (𝐴𝑁𝐵𝐶𝑁𝐷)))
12113ad2ant1 1130 . 2 ((𝜑 ∧ (𝐴𝑉𝐵𝑉) ∧ (𝐶𝑉𝐷𝑉)) → ((𝐴 𝐶𝐵 𝐷) → (𝐴𝑁𝐵𝐶𝑁𝐷)))
1310, 12sylbid 243 1 ((𝜑 ∧ (𝐴𝑉𝐵𝑉) ∧ (𝐶𝑉𝐷𝑉)) → (((𝐹𝐴) = (𝐹𝐶) ∧ (𝐹𝐵) = (𝐹𝐷)) → (𝐴𝑁𝐵𝐶𝑁𝐷)))
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ↔ wb 209   ∧ wa 399   ∧ w3a 1084   = wceq 1538   ∈ wcel 2111   class class class wbr 5033   ↦ cmpt 5113  ‘cfv 6329   Er wer 8284  [cec 8285 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2113  ax-9 2121  ax-10 2142  ax-11 2158  ax-12 2175  ax-ext 2770  ax-sep 5170  ax-nul 5177  ax-pr 5298 This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3an 1086  df-tru 1541  df-ex 1782  df-nf 1786  df-sb 2070  df-mo 2598  df-eu 2629  df-clab 2777  df-cleq 2791  df-clel 2870  df-nfc 2938  df-ne 2988  df-ral 3111  df-rex 3112  df-rab 3115  df-v 3443  df-sbc 3722  df-dif 3885  df-un 3887  df-in 3889  df-ss 3899  df-nul 4246  df-if 4428  df-sn 4528  df-pr 4530  df-op 4534  df-uni 4804  df-br 5034  df-opab 5096  df-mpt 5114  df-id 5428  df-xp 5528  df-rel 5529  df-cnv 5530  df-co 5531  df-dm 5532  df-rn 5533  df-res 5534  df-ima 5535  df-iota 6288  df-fun 6331  df-fv 6337  df-er 8287  df-ec 8289 This theorem is referenced by: (None)
 Copyright terms: Public domain W3C validator