![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > opswapg | GIF version |
Description: Swap the members of an ordered pair. (Contributed by Jim Kingdon, 16-Dec-2018.) |
Ref | Expression |
---|---|
opswapg | ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → ∪ ◡{〈𝐴, 𝐵〉} = 〈𝐵, 𝐴〉) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | cnvsng 5032 | . . 3 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → ◡{〈𝐴, 𝐵〉} = {〈𝐵, 𝐴〉}) | |
2 | 1 | unieqd 3755 | . 2 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → ∪ ◡{〈𝐴, 𝐵〉} = ∪ {〈𝐵, 𝐴〉}) |
3 | elex 2700 | . . . 4 ⊢ (𝐵 ∈ 𝑊 → 𝐵 ∈ V) | |
4 | elex 2700 | . . . 4 ⊢ (𝐴 ∈ 𝑉 → 𝐴 ∈ V) | |
5 | opexg 4158 | . . . 4 ⊢ ((𝐵 ∈ V ∧ 𝐴 ∈ V) → 〈𝐵, 𝐴〉 ∈ V) | |
6 | 3, 4, 5 | syl2anr 288 | . . 3 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → 〈𝐵, 𝐴〉 ∈ V) |
7 | unisng 3761 | . . 3 ⊢ (〈𝐵, 𝐴〉 ∈ V → ∪ {〈𝐵, 𝐴〉} = 〈𝐵, 𝐴〉) | |
8 | 6, 7 | syl 14 | . 2 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → ∪ {〈𝐵, 𝐴〉} = 〈𝐵, 𝐴〉) |
9 | 2, 8 | eqtrd 2173 | 1 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → ∪ ◡{〈𝐴, 𝐵〉} = 〈𝐵, 𝐴〉) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 103 = wceq 1332 ∈ wcel 1481 Vcvv 2689 {csn 3532 〈cop 3535 ∪ cuni 3744 ◡ccnv 4546 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-io 699 ax-5 1424 ax-7 1425 ax-gen 1426 ax-ie1 1470 ax-ie2 1471 ax-8 1483 ax-10 1484 ax-11 1485 ax-i12 1486 ax-bndl 1487 ax-4 1488 ax-14 1493 ax-17 1507 ax-i9 1511 ax-ial 1515 ax-i5r 1516 ax-ext 2122 ax-sep 4054 ax-pow 4106 ax-pr 4139 |
This theorem depends on definitions: df-bi 116 df-3an 965 df-tru 1335 df-nf 1438 df-sb 1737 df-eu 2003 df-mo 2004 df-clab 2127 df-cleq 2133 df-clel 2136 df-nfc 2271 df-ral 2422 df-rex 2423 df-v 2691 df-un 3080 df-in 3082 df-ss 3089 df-pw 3517 df-sn 3538 df-pr 3539 df-op 3541 df-uni 3745 df-br 3938 df-opab 3998 df-xp 4553 df-rel 4554 df-cnv 4555 |
This theorem is referenced by: 2nd1st 6086 cnvf1olem 6129 brtposg 6159 dftpos4 6168 tpostpos 6169 xpcomco 6728 fsumcnv 11238 txswaphmeolem 12528 |
Copyright terms: Public domain | W3C validator |