xpcomf1o - Metamath Proof Explorer

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

Theorem xpcomf1o 9064

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**
Step	Hyp	Ref	Expression
1		relxp 5673	. . . 4 ⊢ Rel (𝐴 × 𝐵)
2		cnvf1o 8108	. . . 4 ⊢ (Rel (𝐴 × 𝐵) → (𝑥 ∈ (𝐴 × 𝐵) ↦ ∪ ^◡{𝑥}):(𝐴 × 𝐵)–1-1-onto→^◡(𝐴 × 𝐵))
3	1, 2	ax-mp 5	. . 3 ⊢ (𝑥 ∈ (𝐴 × 𝐵) ↦ ∪ ^◡{𝑥}):(𝐴 × 𝐵)–1-1-onto→^◡(𝐴 × 𝐵)
4		xpcomf1o.1	. . . 4 ⊢ 𝐹 = (𝑥 ∈ (𝐴 × 𝐵) ↦ ∪ ^◡{𝑥})
5		f1oeq1 6805	. . . 4 ⊢ (𝐹 = (𝑥 ∈ (𝐴 × 𝐵) ↦ ∪ ^◡{𝑥}) → (𝐹:(𝐴 × 𝐵)–1-1-onto→^◡(𝐴 × 𝐵) ↔ (𝑥 ∈ (𝐴 × 𝐵) ↦ ∪ ^◡{𝑥}):(𝐴 × 𝐵)–1-1-onto→^◡(𝐴 × 𝐵)))
6	4, 5	ax-mp 5	. . 3 ⊢ (𝐹:(𝐴 × 𝐵)–1-1-onto→^◡(𝐴 × 𝐵) ↔ (𝑥 ∈ (𝐴 × 𝐵) ↦ ∪ ^◡{𝑥}):(𝐴 × 𝐵)–1-1-onto→^◡(𝐴 × 𝐵))
7	3, 6	mpbir 234	. 2 ⊢ 𝐹:(𝐴 × 𝐵)–1-1-onto→^◡(𝐴 × 𝐵)
8		cnvxp 6148	. . 3 ⊢ ^◡(𝐴 × 𝐵) = (𝐵 × 𝐴)
9		f1oeq3 6807	. . 3 ⊢ (^◡(𝐴 × 𝐵) = (𝐵 × 𝐴) → (𝐹:(𝐴 × 𝐵)–1-1-onto→^◡(𝐴 × 𝐵) ↔ 𝐹:(𝐴 × 𝐵)–1-1-onto→(𝐵 × 𝐴)))
10	8, 9	ax-mp 5	. 2 ⊢ (𝐹:(𝐴 × 𝐵)–1-1-onto→^◡(𝐴 × 𝐵) ↔ 𝐹:(𝐴 × 𝐵)–1-1-onto→(𝐵 × 𝐴))
11	7, 10	mpbi 233	1 ⊢ 𝐹:(𝐴 × 𝐵)–1-1-onto→(𝐵 × 𝐴)

Colors of variables: wff setvar class

This proof depends on syntax axioms: ↔ wb 209 = wceq 1570 {csn 4584 ∪ cuni 4867 ↦ cmpt 5186 × cxp 5653 ^◡ccnv 5654 Rel wrel 5660 –1-1-onto→wf1o 6532

This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2732 ax-sep 5251 ax-nul 5263 ax-pow 5330 ax-pr 5398 ax-un 7736

This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-ral 3077 df-rex 3087 df-rab 3413 df-v 3452 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-br 5104 df-opab 5168 df-mpt 5187 df-id 5550 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-iota 6489 df-fun 6535 df-fn 6536 df-f 6537 df-f1 6538 df-fo 6539 df-f1o 6540 df-fv 6541 df-1st 7986 df-2nd 7987

This theorem is used by: xpcomco 9065 xpcomen 9066 omf1o 9078 swapf1f1o 50201 swapf2f1o 50202 swapf2f1oaALT 50204

W3C validator