Theorem cnveqb 6188

Description: Equality theorem for converse. (Contributed by FL, 19-Sep-2011.)

Assertion

Ref	Expression
cnveqb	⊢ ((Rel 𝐴 ∧ Rel 𝐵) → (𝐴 = 𝐵 ↔ ◡𝐴 = ◡𝐵))

Proof of Theorem cnveqb

Step	Hyp	Ref	Expression
1		cnveq 5866	. 2 ⊢ (𝐴 = 𝐵 → ◡𝐴 = ◡𝐵)
2		dfrel2 6181	. . . 4 ⊢ (Rel 𝐴 ↔ ◡◡𝐴 = 𝐴)
3		dfrel2 6181	. . . . . . 7 ⊢ (Rel 𝐵 ↔ ◡◡𝐵 = 𝐵)
4		cnveq 5866	. . . . . . . . 9 ⊢ (◡𝐴 = ◡𝐵 → ◡◡𝐴 = ◡◡𝐵)
5		eqeq2 2738	. . . . . . . . 9 ⊢ (𝐵 = ◡◡𝐵 → (◡◡𝐴 = 𝐵 ↔ ◡◡𝐴 = ◡◡𝐵))
6	4, 5	imbitrrid 245	. . . . . . . 8 ⊢ (𝐵 = ◡◡𝐵 → (◡𝐴 = ◡𝐵 → ◡◡𝐴 = 𝐵))
7	6	eqcoms 2734	. . . . . . 7 ⊢ (◡◡𝐵 = 𝐵 → (◡𝐴 = ◡𝐵 → ◡◡𝐴 = 𝐵))
8	3, 7	sylbi 216	. . . . . 6 ⊢ (Rel 𝐵 → (◡𝐴 = ◡𝐵 → ◡◡𝐴 = 𝐵))
9		eqeq1 2730	. . . . . . 7 ⊢ (𝐴 = ◡◡𝐴 → (𝐴 = 𝐵 ↔ ◡◡𝐴 = 𝐵))
10	9	imbi2d 340	. . . . . 6 ⊢ (𝐴 = ◡◡𝐴 → ((◡𝐴 = ◡𝐵 → 𝐴 = 𝐵) ↔ (◡𝐴 = ◡𝐵 → ◡◡𝐴 = 𝐵)))
11	8, 10	imbitrrid 245	. . . . 5 ⊢ (𝐴 = ◡◡𝐴 → (Rel 𝐵 → (◡𝐴 = ◡𝐵 → 𝐴 = 𝐵)))
12	11	eqcoms 2734	. . . 4 ⊢ (◡◡𝐴 = 𝐴 → (Rel 𝐵 → (◡𝐴 = ◡𝐵 → 𝐴 = 𝐵)))
13	2, 12	sylbi 216	. . 3 ⊢ (Rel 𝐴 → (Rel 𝐵 → (◡𝐴 = ◡𝐵 → 𝐴 = 𝐵)))
14	13	imp 406	. 2 ⊢ ((Rel 𝐴 ∧ Rel 𝐵) → (◡𝐴 = ◡𝐵 → 𝐴 = 𝐵))
15	1, 14	impbid2 225	1 ⊢ ((Rel 𝐴 ∧ Rel 𝐵) → (𝐴 = 𝐵 ↔ ◡𝐴 = ◡𝐵))

Syntax hints:   → wi 4   ↔ wb 205   ∧ wa 395   = wceq 1533  ^◡ccnv 5668  Rel wrel 5674

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1789  ax-4 1803  ax-5 1905  ax-6 1963  ax-7 2003  ax-8 2100  ax-9 2108  ax-ext 2697  ax-sep 5292  ax-nul 5299  ax-pr 5420

This theorem depends on definitions:  df-bi 206  df-an 396  df-or 845  df-3an 1086  df-tru 1536  df-fal 1546  df-ex 1774  df-sb 2060  df-clab 2704  df-cleq 2718  df-clel 2804  df-rab 3427  df-v 3470  df-dif 3946  df-un 3948  df-in 3950  df-ss 3960  df-nul 4318  df-if 4524  df-sn 4624  df-pr 4626  df-op 4630  df-br 5142  df-opab 5204  df-xp 5675  df-rel 5676  df-cnv 5677

This theorem is referenced by:  cnveq0  6189  weisoeq2  7348  relexpaddg  15004  relexpaddss  43026