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

Theorem xpcomf1o 7117
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 4882 . . . 4 Rel (𝐴 × 𝐵)
2 cnvf1o 6455 . . . 4 (Rel (𝐴 × 𝐵) → (𝑥 ∈ (𝐴 × 𝐵) ↦ {𝑥}):(𝐴 × 𝐵)–1-1-onto(𝐴 × 𝐵))
31, 2ax-mp 5 . . 3 (𝑥 ∈ (𝐴 × 𝐵) ↦ {𝑥}):(𝐴 × 𝐵)–1-1-onto(𝐴 × 𝐵)
4 xpcomf1o.1 . . . 4 𝐹 = (𝑥 ∈ (𝐴 × 𝐵) ↦ {𝑥})
5 f1oeq1 5625 . . . 4 (𝐹 = (𝑥 ∈ (𝐴 × 𝐵) ↦ {𝑥}) → (𝐹:(𝐴 × 𝐵)–1-1-onto(𝐴 × 𝐵) ↔ (𝑥 ∈ (𝐴 × 𝐵) ↦ {𝑥}):(𝐴 × 𝐵)–1-1-onto(𝐴 × 𝐵)))
64, 5ax-mp 5 . . 3 (𝐹:(𝐴 × 𝐵)–1-1-onto(𝐴 × 𝐵) ↔ (𝑥 ∈ (𝐴 × 𝐵) ↦ {𝑥}):(𝐴 × 𝐵)–1-1-onto(𝐴 × 𝐵))
73, 6mpbir 146 . 2 𝐹:(𝐴 × 𝐵)–1-1-onto(𝐴 × 𝐵)
8 cnvxp 5204 . . 3 (𝐴 × 𝐵) = (𝐵 × 𝐴)
9 f1oeq3 5627 . . 3 ((𝐴 × 𝐵) = (𝐵 × 𝐴) → (𝐹:(𝐴 × 𝐵)–1-1-onto(𝐴 × 𝐵) ↔ 𝐹:(𝐴 × 𝐵)–1-1-onto→(𝐵 × 𝐴)))
108, 9ax-mp 5 . 2 (𝐹:(𝐴 × 𝐵)–1-1-onto(𝐴 × 𝐵) ↔ 𝐹:(𝐴 × 𝐵)–1-1-onto→(𝐵 × 𝐴))
117, 10mpbi 145 1 𝐹:(𝐴 × 𝐵)–1-1-onto→(𝐵 × 𝐴)
Colors of variables: wff set class
Syntax hints:  wb 105   = wceq 1402  {csn 3708   cuni 3933  cmpt 4190   × cxp 4770  ccnv 4771  Rel wrel 4777  1-1-ontowf1o 5374
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4247  ax-pow 4309  ax-pr 4344  ax-un 4576
This theorem depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-rex 2534  df-v 2823  df-sbc 3052  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3714  df-pr 3715  df-op 3717  df-uni 3934  df-br 4129  df-opab 4191  df-mpt 4192  df-id 4436  df-xp 4778  df-rel 4779  df-cnv 4780  df-co 4781  df-dm 4782  df-rn 4783  df-iota 5335  df-fun 5377  df-fn 5378  df-f 5379  df-f1 5380  df-fo 5381  df-f1o 5382  df-fv 5383  df-1st 6368  df-2nd 6369
This theorem is referenced by:  xpcomco  7118  xpcomen  7119
  Copyright terms: Public domain W3C validator