Theorem cnvco2 35277

Description: Another distributive law of converse over class composition. (Contributed by Scott Fenton, 3-May-2014.)

Assertion

Ref	Expression
cnvco2	⊢ ◡(𝐴 ∘ ◡𝐵) = (𝐵 ∘ ◡𝐴)

Proof of Theorem cnvco2

Dummy variables 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		relcnv 6102	. 2 ⊢ Rel ◡(𝐴 ∘ ◡𝐵)
2		relco 6106	. 2 ⊢ Rel (𝐵 ∘ ◡𝐴)
3		vex 3473	. . . . . 6 ⊢ 𝑦 ∈ V
4		vex 3473	. . . . . 6 ⊢ 𝑧 ∈ V
5	3, 4	brcnv 5879	. . . . 5 ⊢ (𝑦◡𝐵𝑧 ↔ 𝑧𝐵𝑦)
6		vex 3473	. . . . . . 7 ⊢ 𝑥 ∈ V
7	6, 4	brcnv 5879	. . . . . 6 ⊢ (𝑥◡𝐴𝑧 ↔ 𝑧𝐴𝑥)
8	7	bicomi 223	. . . . 5 ⊢ (𝑧𝐴𝑥 ↔ 𝑥◡𝐴𝑧)
9	5, 8	anbi12ci 627	. . . 4 ⊢ ((𝑦◡𝐵𝑧 ∧ 𝑧𝐴𝑥) ↔ (𝑥◡𝐴𝑧 ∧ 𝑧𝐵𝑦))
10	9	exbii 1843	. . 3 ⊢ (∃𝑧(𝑦◡𝐵𝑧 ∧ 𝑧𝐴𝑥) ↔ ∃𝑧(𝑥◡𝐴𝑧 ∧ 𝑧𝐵𝑦))
11	6, 3	opelcnv 5878	. . . 4 ⊢ (⟨𝑥, 𝑦⟩ ∈ ◡(𝐴 ∘ ◡𝐵) ↔ ⟨𝑦, 𝑥⟩ ∈ (𝐴 ∘ ◡𝐵))
12	3, 6	opelco 5868	. . . 4 ⊢ (⟨𝑦, 𝑥⟩ ∈ (𝐴 ∘ ◡𝐵) ↔ ∃𝑧(𝑦◡𝐵𝑧 ∧ 𝑧𝐴𝑥))
13	11, 12	bitri 275	. . 3 ⊢ (⟨𝑥, 𝑦⟩ ∈ ◡(𝐴 ∘ ◡𝐵) ↔ ∃𝑧(𝑦◡𝐵𝑧 ∧ 𝑧𝐴𝑥))
14	6, 3	opelco 5868	. . 3 ⊢ (⟨𝑥, 𝑦⟩ ∈ (𝐵 ∘ ◡𝐴) ↔ ∃𝑧(𝑥◡𝐴𝑧 ∧ 𝑧𝐵𝑦))
15	10, 13, 14	3bitr4i 303	. 2 ⊢ (⟨𝑥, 𝑦⟩ ∈ ◡(𝐴 ∘ ◡𝐵) ↔ ⟨𝑥, 𝑦⟩ ∈ (𝐵 ∘ ◡𝐴))
16	1, 2, 15	eqrelriiv 5786	1 ⊢ ◡(𝐴 ∘ ◡𝐵) = (𝐵 ∘ ◡𝐴)

Syntax hints:   ∧ wa 395   = wceq 1534  ∃wex 1774   ∈ wcel 2099  ⟨cop 4630   class class class wbr 5142  ^◡ccnv 5671   ∘ ccom 5676

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1790  ax-4 1804  ax-5 1906  ax-6 1964  ax-7 2004  ax-8 2101  ax-9 2109  ax-ext 2698  ax-sep 5293  ax-nul 5300  ax-pr 5423

This theorem depends on definitions:  df-bi 206  df-an 396  df-or 847  df-3an 1087  df-tru 1537  df-fal 1547  df-ex 1775  df-sb 2061  df-clab 2705  df-cleq 2719  df-clel 2805  df-rab 3428  df-v 3471  df-dif 3947  df-un 3949  df-in 3951  df-ss 3961  df-nul 4319  df-if 4525  df-sn 4625  df-pr 4627  df-op 4631  df-br 5143  df-opab 5205  df-xp 5678  df-rel 5679  df-cnv 5680  df-co 5681

This theorem is referenced by: (None)