opswap - Metamath Proof Explorer

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

Theorem opswap 6180

Description: Swap the members of an ordered pair. (Contributed by NM, 14-Dec-2008.) (Revised by Mario Carneiro, 30-Aug-2015.)

**Assertion**
Ref	Expression
opswap	⊢ ∪ ^◡{⟨𝐴, 𝐵⟩} = ⟨𝐵, 𝐴⟩

**Proof of Theorem opswap**
Step	Hyp	Ref	Expression
1		cnvsng 6174	. . . 4 ⊢ ((𝐴 ∈ V ∧ 𝐵 ∈ V) → ^◡{⟨𝐴, 𝐵⟩} = {⟨𝐵, 𝐴⟩})
2	1	unieqd 4851	. . 3 ⊢ ((𝐴 ∈ V ∧ 𝐵 ∈ V) → ∪ ^◡{⟨𝐴, 𝐵⟩} = ∪ {⟨𝐵, 𝐴⟩})
3		opex 5403	. . . 4 ⊢ ⟨𝐵, 𝐴⟩ ∈ V
4	3	unisn 4857	. . 3 ⊢ ∪ {⟨𝐵, 𝐴⟩} = ⟨𝐵, 𝐴⟩
5	2, 4	eqtrdi 2790	. 2 ⊢ ((𝐴 ∈ V ∧ 𝐵 ∈ V) → ∪ ^◡{⟨𝐴, 𝐵⟩} = ⟨𝐵, 𝐴⟩)
6		uni0 4866	. . 3 ⊢ ∪ ∅ = ∅
7		opprc 4827	. . . . . . 7 ⊢ (¬ (𝐴 ∈ V ∧ 𝐵 ∈ V) → ⟨𝐴, 𝐵⟩ = ∅)
8	7	sneqd 4567	. . . . . 6 ⊢ (¬ (𝐴 ∈ V ∧ 𝐵 ∈ V) → {⟨𝐴, 𝐵⟩} = {∅})
9	8	cnveqd 5817	. . . . 5 ⊢ (¬ (𝐴 ∈ V ∧ 𝐵 ∈ V) → ^◡{⟨𝐴, 𝐵⟩} = ^◡{∅})
10		cnvsn0 6161	. . . . 5 ⊢ ^◡{∅} = ∅
11	9, 10	eqtrdi 2790	. . . 4 ⊢ (¬ (𝐴 ∈ V ∧ 𝐵 ∈ V) → ^◡{⟨𝐴, 𝐵⟩} = ∅)
12	11	unieqd 4851	. . 3 ⊢ (¬ (𝐴 ∈ V ∧ 𝐵 ∈ V) → ∪ ^◡{⟨𝐴, 𝐵⟩} = ∪ ∅)
13		ancom 461	. . . 4 ⊢ ((𝐴 ∈ V ∧ 𝐵 ∈ V) ↔ (𝐵 ∈ V ∧ 𝐴 ∈ V))
14		opprc 4827	. . . 4 ⊢ (¬ (𝐵 ∈ V ∧ 𝐴 ∈ V) → ⟨𝐵, 𝐴⟩ = ∅)
15	13, 14	sylnbi 331	. . 3 ⊢ (¬ (𝐴 ∈ V ∧ 𝐵 ∈ V) → ⟨𝐵, 𝐴⟩ = ∅)
16	6, 12, 15	3eqtr4a 2800	. 2 ⊢ (¬ (𝐴 ∈ V ∧ 𝐵 ∈ V) → ∪ ^◡{⟨𝐴, 𝐵⟩} = ⟨𝐵, 𝐴⟩)
17	5, 16	pm2.61i 183	1 ⊢ ∪ ^◡{⟨𝐴, 𝐵⟩} = ⟨𝐵, 𝐴⟩

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 ∧ wa 396 = wceq 1547 ∈ wcel 2119 Vcvv 3431 ∅c0 4261 {csn 4555 ⟨cop 4561 ∪ cuni 4838 ^◡ccnv 5617

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1917 ax-6 1974 ax-7 2015 ax-8 2121 ax-9 2129 ax-ext 2711 ax-sep 5218 ax-pr 5362

This theorem depends on definitions: df-bi 208 df-an 397 df-or 854 df-3an 1094 df-tru 1550 df-fal 1560 df-ex 1787 df-sb 2074 df-clab 2718 df-cleq 2731 df-clel 2814 df-ne 2935 df-ral 3054 df-rex 3064 df-rab 3392 df-v 3433 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-nul 4262 df-if 4455 df-sn 4556 df-pr 4558 df-op 4562 df-uni 4839 df-br 5073 df-opab 5135 df-xp 5624 df-rel 5625 df-cnv 5626 df-dm 5628 df-rn 5629

This theorem is referenced by: 2nd1st 7980 cnvf1olem 8049 brtpos 8175 dftpos4 8185 tpostpos 8186 xpcomco 8995 fsumcnv 15726 fprodcnv 15939 gsumcom2 19941 txswaphmeolem 23787 swapf1 49762 swapf2 49764