Theorem cnvprop 32900

Description: Converse of a pair of ordered pairs. (Contributed by Thierry Arnoux, 24-Sep-2023.)

Assertion

Ref	Expression
cnvprop	⊢ (((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) ∧ (𝐶 ∈ 𝑉 ∧ 𝐷 ∈ 𝑊)) → ◡{⟨𝐴, 𝐵⟩, ⟨𝐶, 𝐷⟩} = {⟨𝐵, 𝐴⟩, ⟨𝐷, 𝐶⟩})

Proof of Theorem cnvprop

Step	Hyp	Ref	Expression
1		cnvsng 6212	. . . 4 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → ◡{⟨𝐴, 𝐵⟩} = {⟨𝐵, 𝐴⟩})
2	1	adantr 484	. . 3 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) ∧ (𝐶 ∈ 𝑉 ∧ 𝐷 ∈ 𝑊)) → ◡{⟨𝐴, 𝐵⟩} = {⟨𝐵, 𝐴⟩})
3		cnvsng 6212	. . . 4 ⊢ ((𝐶 ∈ 𝑉 ∧ 𝐷 ∈ 𝑊) → ◡{⟨𝐶, 𝐷⟩} = {⟨𝐷, 𝐶⟩})
4	3	adantl 485	. . 3 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) ∧ (𝐶 ∈ 𝑉 ∧ 𝐷 ∈ 𝑊)) → ◡{⟨𝐶, 𝐷⟩} = {⟨𝐷, 𝐶⟩})
5	2, 4	uneq12d 4124	. 2 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) ∧ (𝐶 ∈ 𝑉 ∧ 𝐷 ∈ 𝑊)) → (◡{⟨𝐴, 𝐵⟩} ∪ ◡{⟨𝐶, 𝐷⟩}) = ({⟨𝐵, 𝐴⟩} ∪ {⟨𝐷, 𝐶⟩}))
6		df-pr 4587	. . . 4 ⊢ {⟨𝐴, 𝐵⟩, ⟨𝐶, 𝐷⟩} = ({⟨𝐴, 𝐵⟩} ∪ {⟨𝐶, 𝐷⟩})
7	6	cnveqi 5848	. . 3 ⊢ ◡{⟨𝐴, 𝐵⟩, ⟨𝐶, 𝐷⟩} = ◡({⟨𝐴, 𝐵⟩} ∪ {⟨𝐶, 𝐷⟩})
8		cnvun 6128	. . 3 ⊢ ◡({⟨𝐴, 𝐵⟩} ∪ {⟨𝐶, 𝐷⟩}) = (◡{⟨𝐴, 𝐵⟩} ∪ ◡{⟨𝐶, 𝐷⟩})
9	7, 8	eqtri 2787	. 2 ⊢ ◡{⟨𝐴, 𝐵⟩, ⟨𝐶, 𝐷⟩} = (◡{⟨𝐴, 𝐵⟩} ∪ ◡{⟨𝐶, 𝐷⟩})
10		df-pr 4587	. 2 ⊢ {⟨𝐵, 𝐴⟩, ⟨𝐷, 𝐶⟩} = ({⟨𝐵, 𝐴⟩} ∪ {⟨𝐷, 𝐶⟩})
11	5, 9, 10	3eqtr4g 2824	1 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) ∧ (𝐶 ∈ 𝑉 ∧ 𝐷 ∈ 𝑊)) → ◡{⟨𝐴, 𝐵⟩, ⟨𝐶, 𝐷⟩} = {⟨𝐵, 𝐴⟩, ⟨𝐷, 𝐶⟩})

Syntax hints:   → wi 4   ∧ wa 399   = wceq 1562   ∈ wcel 2144   ∪ cun 3904  {csn 4584  {cpr 4586  ⟨cop 4590  ^◡ccnv 5648

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1817  ax-4 1831  ax-5 1932  ax-6 1989  ax-7 2030  ax-8 2146  ax-9 2154  ax-ext 2736  ax-sep 5248  ax-pr 5392

This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3an 1101  df-tru 1565  df-fal 1575  df-ex 1802  df-sb 2093  df-clab 2743  df-cleq 2756  df-clel 2839  df-ral 3079  df-rex 3089  df-rab 3417  df-v 3458  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4288  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-br 5103  df-opab 5165  df-xp 5655  df-rel 5656  df-cnv 5657

This theorem is referenced by:  cycpm2tr  33301