mapsnf1o3 - Metamath Proof Explorer

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

Theorem mapsnf1o3 8840

Description: Explicit bijection in the reverse of mapsnf1o2 8839. (Contributed by Stefan O'Rear, 24-Mar-2015.)

**Hypotheses**
Ref	Expression
mapsncnv.s	⊢ 𝑆 = {𝑋}
mapsncnv.b	⊢ 𝐵 ∈ V
mapsncnv.x	⊢ 𝑋 ∈ V
mapsnf1o3.f	⊢ 𝐹 = (𝑦 ∈ 𝐵 ↦ (𝑆 × {𝑦}))

**Assertion**
Ref	Expression
mapsnf1o3	⊢ 𝐹:𝐵–1-1-onto→(𝐵 ↑_m 𝑆)

Distinct variable groups: 𝑦,𝐵 𝑦,𝑆 𝑦,𝑋 Allowed substitution hint: 𝐹(𝑦)

Proof of Theorem mapsnf1o3 Dummy variable 𝑥 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		mapsncnv.s	. . . 4 ⊢ 𝑆 = {𝑋}
2		mapsncnv.b	. . . 4 ⊢ 𝐵 ∈ V
3		mapsncnv.x	. . . 4 ⊢ 𝑋 ∈ V
4		eqid 2737	. . . 4 ⊢ (𝑥 ∈ (𝐵 ↑_m 𝑆) ↦ (𝑥‘𝑋)) = (𝑥 ∈ (𝐵 ↑_m 𝑆) ↦ (𝑥‘𝑋))
5	1, 2, 3, 4	mapsnf1o2 8839	. . 3 ⊢ (𝑥 ∈ (𝐵 ↑_m 𝑆) ↦ (𝑥‘𝑋)):(𝐵 ↑_m 𝑆)–1-1-onto→𝐵
6		f1ocnv 6790	. . 3 ⊢ ((𝑥 ∈ (𝐵 ↑_m 𝑆) ↦ (𝑥‘𝑋)):(𝐵 ↑_m 𝑆)–1-1-onto→𝐵 → ^◡(𝑥 ∈ (𝐵 ↑_m 𝑆) ↦ (𝑥‘𝑋)):𝐵–1-1-onto→(𝐵 ↑_m 𝑆))
7	5, 6	ax-mp 5	. 2 ⊢ ^◡(𝑥 ∈ (𝐵 ↑_m 𝑆) ↦ (𝑥‘𝑋)):𝐵–1-1-onto→(𝐵 ↑_m 𝑆)
8		mapsnf1o3.f	. . . 4 ⊢ 𝐹 = (𝑦 ∈ 𝐵 ↦ (𝑆 × {𝑦}))
9	1, 2, 3, 4	mapsncnv 8838	. . . 4 ⊢ ^◡(𝑥 ∈ (𝐵 ↑_m 𝑆) ↦ (𝑥‘𝑋)) = (𝑦 ∈ 𝐵 ↦ (𝑆 × {𝑦}))
10	8, 9	eqtr4i 2763	. . 3 ⊢ 𝐹 = ^◡(𝑥 ∈ (𝐵 ↑_m 𝑆) ↦ (𝑥‘𝑋))
11		f1oeq1 6766	. . 3 ⊢ (𝐹 = ^◡(𝑥 ∈ (𝐵 ↑_m 𝑆) ↦ (𝑥‘𝑋)) → (𝐹:𝐵–1-1-onto→(𝐵 ↑_m 𝑆) ↔ ^◡(𝑥 ∈ (𝐵 ↑_m 𝑆) ↦ (𝑥‘𝑋)):𝐵–1-1-onto→(𝐵 ↑_m 𝑆)))
12	10, 11	ax-mp 5	. 2 ⊢ (𝐹:𝐵–1-1-onto→(𝐵 ↑_m 𝑆) ↔ ^◡(𝑥 ∈ (𝐵 ↑_m 𝑆) ↦ (𝑥‘𝑋)):𝐵–1-1-onto→(𝐵 ↑_m 𝑆))
13	7, 12	mpbir 231	1 ⊢ 𝐹:𝐵–1-1-onto→(𝐵 ↑_m 𝑆)

Colors of variables: wff setvar class

Syntax hints: ↔ wb 206 = wceq 1542 ∈ wcel 2114 Vcvv 3430 {csn 4568 ↦ cmpt 5167 × cxp 5626 ^◡ccnv 5627 –1-1-onto→wf1o 6495 ‘cfv 6496 (class class class)co 7364 ↑_m cmap 8770

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-sep 5232 ax-nul 5242 ax-pow 5306 ax-pr 5374 ax-un 7686

This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-ral 3053 df-rex 3063 df-reu 3344 df-rab 3391 df-v 3432 df-sbc 3730 df-csb 3839 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-nul 4275 df-if 4468 df-pw 4544 df-sn 4569 df-pr 4571 df-op 4575 df-uni 4852 df-iun 4936 df-br 5087 df-opab 5149 df-mpt 5168 df-id 5523 df-xp 5634 df-rel 5635 df-cnv 5636 df-co 5637 df-dm 5638 df-rn 5639 df-res 5640 df-ima 5641 df-iota 6452 df-fun 6498 df-fn 6499 df-f 6500 df-f1 6501 df-fo 6502 df-f1o 6503 df-fv 6504 df-ov 7367 df-oprab 7368 df-mpo 7369 df-1st 7939 df-2nd 7940 df-map 8772

This theorem is referenced by: coe1f2 22189 coe1add 22245 evls1rhmlem 22302 evl1sca 22315 pf1ind 22336 ismrer1 38181

W3C validator