ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  xpcomf1o GIF version

Theorem xpcomf1o 6799
Description: The canonical bijection from (𝐴 × 𝐵) to (𝐵 × 𝐴). (Contributed by Mario Carneiro, 23-Apr-2014.)
Hypothesis
Ref Expression
xpcomf1o.1 𝐹 = (𝑥 ∈ (𝐴 × 𝐵) ↦ {𝑥})
Assertion
Ref Expression
xpcomf1o 𝐹:(𝐴 × 𝐵)–1-1-onto→(𝐵 × 𝐴)
Distinct variable groups:   𝑥,𝐴   𝑥,𝐵
Allowed substitution hint:   𝐹(𝑥)

Proof of Theorem xpcomf1o
StepHypRef Expression
1 relxp 4718 . . . 4 Rel (𝐴 × 𝐵)
2 cnvf1o 6201 . . . 4 (Rel (𝐴 × 𝐵) → (𝑥 ∈ (𝐴 × 𝐵) ↦ {𝑥}):(𝐴 × 𝐵)–1-1-onto(𝐴 × 𝐵))
31, 2ax-mp 5 . . 3 (𝑥 ∈ (𝐴 × 𝐵) ↦ {𝑥}):(𝐴 × 𝐵)–1-1-onto(𝐴 × 𝐵)
4 xpcomf1o.1 . . . 4 𝐹 = (𝑥 ∈ (𝐴 × 𝐵) ↦ {𝑥})
5 f1oeq1 5429 . . . 4 (𝐹 = (𝑥 ∈ (𝐴 × 𝐵) ↦ {𝑥}) → (𝐹:(𝐴 × 𝐵)–1-1-onto(𝐴 × 𝐵) ↔ (𝑥 ∈ (𝐴 × 𝐵) ↦ {𝑥}):(𝐴 × 𝐵)–1-1-onto(𝐴 × 𝐵)))
64, 5ax-mp 5 . . 3 (𝐹:(𝐴 × 𝐵)–1-1-onto(𝐴 × 𝐵) ↔ (𝑥 ∈ (𝐴 × 𝐵) ↦ {𝑥}):(𝐴 × 𝐵)–1-1-onto(𝐴 × 𝐵))
73, 6mpbir 145 . 2 𝐹:(𝐴 × 𝐵)–1-1-onto(𝐴 × 𝐵)
8 cnvxp 5027 . . 3 (𝐴 × 𝐵) = (𝐵 × 𝐴)
9 f1oeq3 5431 . . 3 ((𝐴 × 𝐵) = (𝐵 × 𝐴) → (𝐹:(𝐴 × 𝐵)–1-1-onto(𝐴 × 𝐵) ↔ 𝐹:(𝐴 × 𝐵)–1-1-onto→(𝐵 × 𝐴)))
108, 9ax-mp 5 . 2 (𝐹:(𝐴 × 𝐵)–1-1-onto(𝐴 × 𝐵) ↔ 𝐹:(𝐴 × 𝐵)–1-1-onto→(𝐵 × 𝐴))
117, 10mpbi 144 1 𝐹:(𝐴 × 𝐵)–1-1-onto→(𝐵 × 𝐴)
Colors of variables: wff set class
Syntax hints:  wb 104   = wceq 1348  {csn 3581   cuni 3794  cmpt 4048   × cxp 4607  ccnv 4608  Rel wrel 4614  1-1-ontowf1o 5195
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 704  ax-5 1440  ax-7 1441  ax-gen 1442  ax-ie1 1486  ax-ie2 1487  ax-8 1497  ax-10 1498  ax-11 1499  ax-i12 1500  ax-bndl 1502  ax-4 1503  ax-17 1519  ax-i9 1523  ax-ial 1527  ax-i5r 1528  ax-13 2143  ax-14 2144  ax-ext 2152  ax-sep 4105  ax-pow 4158  ax-pr 4192  ax-un 4416
This theorem depends on definitions:  df-bi 116  df-3an 975  df-tru 1351  df-nf 1454  df-sb 1756  df-eu 2022  df-mo 2023  df-clab 2157  df-cleq 2163  df-clel 2166  df-nfc 2301  df-ral 2453  df-rex 2454  df-v 2732  df-sbc 2956  df-un 3125  df-in 3127  df-ss 3134  df-pw 3566  df-sn 3587  df-pr 3588  df-op 3590  df-uni 3795  df-br 3988  df-opab 4049  df-mpt 4050  df-id 4276  df-xp 4615  df-rel 4616  df-cnv 4617  df-co 4618  df-dm 4619  df-rn 4620  df-iota 5158  df-fun 5198  df-fn 5199  df-f 5200  df-f1 5201  df-fo 5202  df-f1o 5203  df-fv 5204  df-1st 6116  df-2nd 6117
This theorem is referenced by:  xpcomco  6800  xpcomen  6801
  Copyright terms: Public domain W3C validator