xpsff1o - Metamath Proof Explorer

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

Theorem xpsff1o 17489

Description: The function appearing in xpsval 17492 is a bijection from the cartesian product to the indexed cartesian product indexed on the pair 2_o = {∅, 1_o}. (Contributed by Mario Carneiro, 15-Aug-2015.)

**Hypothesis**
Ref	Expression
xpsff1o.f	⊢ 𝐹 = (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ {⟨∅, 𝑥⟩, ⟨1_o, 𝑦⟩})

**Assertion**
Ref	Expression
xpsff1o	⊢ 𝐹:(𝐴 × 𝐵)–1-1-onto→X𝑘 ∈ 2_o if(𝑘 = ∅, 𝐴, 𝐵)

Distinct variable groups: 𝐴,𝑘,𝑥,𝑦 𝐵,𝑘,𝑥,𝑦 Allowed substitution hints: 𝐹(𝑥,𝑦,𝑘)

Proof of Theorem xpsff1o Dummy variables 𝑎 𝑏 𝑧 𝑤 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		xpsfrnel2 17486	. . . . . 6 ⊢ ({⟨∅, 𝑥⟩, ⟨1_o, 𝑦⟩} ∈ X𝑘 ∈ 2_o if(𝑘 = ∅, 𝐴, 𝐵) ↔ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵))
2	1	biimpri 228	. . . . 5 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) → {⟨∅, 𝑥⟩, ⟨1_o, 𝑦⟩} ∈ X𝑘 ∈ 2_o if(𝑘 = ∅, 𝐴, 𝐵))
3	2	rgen2 3169	. . . 4 ⊢ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 {⟨∅, 𝑥⟩, ⟨1_o, 𝑦⟩} ∈ X𝑘 ∈ 2_o if(𝑘 = ∅, 𝐴, 𝐵)
4		xpsff1o.f	. . . . 5 ⊢ 𝐹 = (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ {⟨∅, 𝑥⟩, ⟨1_o, 𝑦⟩})
5	4	fmpo 8010	. . . 4 ⊢ (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 {⟨∅, 𝑥⟩, ⟨1_o, 𝑦⟩} ∈ X𝑘 ∈ 2_o if(𝑘 = ∅, 𝐴, 𝐵) ↔ 𝐹:(𝐴 × 𝐵)⟶X𝑘 ∈ 2_o if(𝑘 = ∅, 𝐴, 𝐵))
6	3, 5	mpbi 230	. . 3 ⊢ 𝐹:(𝐴 × 𝐵)⟶X𝑘 ∈ 2_o if(𝑘 = ∅, 𝐴, 𝐵)
7		1st2nd2 7970	. . . . . . . 8 ⊢ (𝑧 ∈ (𝐴 × 𝐵) → 𝑧 = ⟨(1^st ‘𝑧), (2^nd ‘𝑧)⟩)
8	7	fveq2d 6830	. . . . . . 7 ⊢ (𝑧 ∈ (𝐴 × 𝐵) → (𝐹‘𝑧) = (𝐹‘⟨(1^st ‘𝑧), (2^nd ‘𝑧)⟩))
9		df-ov 7356	. . . . . . . 8 ⊢ ((1^st ‘𝑧)𝐹(2^nd ‘𝑧)) = (𝐹‘⟨(1^st ‘𝑧), (2^nd ‘𝑧)⟩)
10		xp1st 7963	. . . . . . . . 9 ⊢ (𝑧 ∈ (𝐴 × 𝐵) → (1^st ‘𝑧) ∈ 𝐴)
11		xp2nd 7964	. . . . . . . . 9 ⊢ (𝑧 ∈ (𝐴 × 𝐵) → (2^nd ‘𝑧) ∈ 𝐵)
12	4	xpsfval 17488	. . . . . . . . 9 ⊢ (((1^st ‘𝑧) ∈ 𝐴 ∧ (2^nd ‘𝑧) ∈ 𝐵) → ((1^st ‘𝑧)𝐹(2^nd ‘𝑧)) = {⟨∅, (1^st ‘𝑧)⟩, ⟨1_o, (2^nd ‘𝑧)⟩})
13	10, 11, 12	syl2anc 584	. . . . . . . 8 ⊢ (𝑧 ∈ (𝐴 × 𝐵) → ((1^st ‘𝑧)𝐹(2^nd ‘𝑧)) = {⟨∅, (1^st ‘𝑧)⟩, ⟨1_o, (2^nd ‘𝑧)⟩})
14	9, 13	eqtr3id 2778	. . . . . . 7 ⊢ (𝑧 ∈ (𝐴 × 𝐵) → (𝐹‘⟨(1^st ‘𝑧), (2^nd ‘𝑧)⟩) = {⟨∅, (1^st ‘𝑧)⟩, ⟨1_o, (2^nd ‘𝑧)⟩})
15	8, 14	eqtrd 2764	. . . . . 6 ⊢ (𝑧 ∈ (𝐴 × 𝐵) → (𝐹‘𝑧) = {⟨∅, (1^st ‘𝑧)⟩, ⟨1_o, (2^nd ‘𝑧)⟩})
16		1st2nd2 7970	. . . . . . . 8 ⊢ (𝑤 ∈ (𝐴 × 𝐵) → 𝑤 = ⟨(1^st ‘𝑤), (2^nd ‘𝑤)⟩)
17	16	fveq2d 6830	. . . . . . 7 ⊢ (𝑤 ∈ (𝐴 × 𝐵) → (𝐹‘𝑤) = (𝐹‘⟨(1^st ‘𝑤), (2^nd ‘𝑤)⟩))
18		df-ov 7356	. . . . . . . 8 ⊢ ((1^st ‘𝑤)𝐹(2^nd ‘𝑤)) = (𝐹‘⟨(1^st ‘𝑤), (2^nd ‘𝑤)⟩)
19		xp1st 7963	. . . . . . . . 9 ⊢ (𝑤 ∈ (𝐴 × 𝐵) → (1^st ‘𝑤) ∈ 𝐴)
20		xp2nd 7964	. . . . . . . . 9 ⊢ (𝑤 ∈ (𝐴 × 𝐵) → (2^nd ‘𝑤) ∈ 𝐵)
21	4	xpsfval 17488	. . . . . . . . 9 ⊢ (((1^st ‘𝑤) ∈ 𝐴 ∧ (2^nd ‘𝑤) ∈ 𝐵) → ((1^st ‘𝑤)𝐹(2^nd ‘𝑤)) = {⟨∅, (1^st ‘𝑤)⟩, ⟨1_o, (2^nd ‘𝑤)⟩})
22	19, 20, 21	syl2anc 584	. . . . . . . 8 ⊢ (𝑤 ∈ (𝐴 × 𝐵) → ((1^st ‘𝑤)𝐹(2^nd ‘𝑤)) = {⟨∅, (1^st ‘𝑤)⟩, ⟨1_o, (2^nd ‘𝑤)⟩})
23	18, 22	eqtr3id 2778	. . . . . . 7 ⊢ (𝑤 ∈ (𝐴 × 𝐵) → (𝐹‘⟨(1^st ‘𝑤), (2^nd ‘𝑤)⟩) = {⟨∅, (1^st ‘𝑤)⟩, ⟨1_o, (2^nd ‘𝑤)⟩})
24	17, 23	eqtrd 2764	. . . . . 6 ⊢ (𝑤 ∈ (𝐴 × 𝐵) → (𝐹‘𝑤) = {⟨∅, (1^st ‘𝑤)⟩, ⟨1_o, (2^nd ‘𝑤)⟩})
25	15, 24	eqeqan12d 2743	. . . . 5 ⊢ ((𝑧 ∈ (𝐴 × 𝐵) ∧ 𝑤 ∈ (𝐴 × 𝐵)) → ((𝐹‘𝑧) = (𝐹‘𝑤) ↔ {⟨∅, (1^st ‘𝑧)⟩, ⟨1_o, (2^nd ‘𝑧)⟩} = {⟨∅, (1^st ‘𝑤)⟩, ⟨1_o, (2^nd ‘𝑤)⟩}))
26		fveq1 6825	. . . . . . . 8 ⊢ ({⟨∅, (1^st ‘𝑧)⟩, ⟨1_o, (2^nd ‘𝑧)⟩} = {⟨∅, (1^st ‘𝑤)⟩, ⟨1_o, (2^nd ‘𝑤)⟩} → ({⟨∅, (1^st ‘𝑧)⟩, ⟨1_o, (2^nd ‘𝑧)⟩}‘∅) = ({⟨∅, (1^st ‘𝑤)⟩, ⟨1_o, (2^nd ‘𝑤)⟩}‘∅))
27		fvex 6839	. . . . . . . . 9 ⊢ (1^st ‘𝑧) ∈ V
28		fvpr0o 17481	. . . . . . . . 9 ⊢ ((1^st ‘𝑧) ∈ V → ({⟨∅, (1^st ‘𝑧)⟩, ⟨1_o, (2^nd ‘𝑧)⟩}‘∅) = (1^st ‘𝑧))
29	27, 28	ax-mp 5	. . . . . . . 8 ⊢ ({⟨∅, (1^st ‘𝑧)⟩, ⟨1_o, (2^nd ‘𝑧)⟩}‘∅) = (1^st ‘𝑧)
30		fvex 6839	. . . . . . . . 9 ⊢ (1^st ‘𝑤) ∈ V
31		fvpr0o 17481	. . . . . . . . 9 ⊢ ((1^st ‘𝑤) ∈ V → ({⟨∅, (1^st ‘𝑤)⟩, ⟨1_o, (2^nd ‘𝑤)⟩}‘∅) = (1^st ‘𝑤))
32	30, 31	ax-mp 5	. . . . . . . 8 ⊢ ({⟨∅, (1^st ‘𝑤)⟩, ⟨1_o, (2^nd ‘𝑤)⟩}‘∅) = (1^st ‘𝑤)
33	26, 29, 32	3eqtr3g 2787	. . . . . . 7 ⊢ ({⟨∅, (1^st ‘𝑧)⟩, ⟨1_o, (2^nd ‘𝑧)⟩} = {⟨∅, (1^st ‘𝑤)⟩, ⟨1_o, (2^nd ‘𝑤)⟩} → (1^st ‘𝑧) = (1^st ‘𝑤))
34		fveq1 6825	. . . . . . . 8 ⊢ ({⟨∅, (1^st ‘𝑧)⟩, ⟨1_o, (2^nd ‘𝑧)⟩} = {⟨∅, (1^st ‘𝑤)⟩, ⟨1_o, (2^nd ‘𝑤)⟩} → ({⟨∅, (1^st ‘𝑧)⟩, ⟨1_o, (2^nd ‘𝑧)⟩}‘1_o) = ({⟨∅, (1^st ‘𝑤)⟩, ⟨1_o, (2^nd ‘𝑤)⟩}‘1_o))
35		fvex 6839	. . . . . . . . 9 ⊢ (2^nd ‘𝑧) ∈ V
36		fvpr1o 17482	. . . . . . . . 9 ⊢ ((2^nd ‘𝑧) ∈ V → ({⟨∅, (1^st ‘𝑧)⟩, ⟨1_o, (2^nd ‘𝑧)⟩}‘1_o) = (2^nd ‘𝑧))
37	35, 36	ax-mp 5	. . . . . . . 8 ⊢ ({⟨∅, (1^st ‘𝑧)⟩, ⟨1_o, (2^nd ‘𝑧)⟩}‘1_o) = (2^nd ‘𝑧)
38		fvex 6839	. . . . . . . . 9 ⊢ (2^nd ‘𝑤) ∈ V
39		fvpr1o 17482	. . . . . . . . 9 ⊢ ((2^nd ‘𝑤) ∈ V → ({⟨∅, (1^st ‘𝑤)⟩, ⟨1_o, (2^nd ‘𝑤)⟩}‘1_o) = (2^nd ‘𝑤))
40	38, 39	ax-mp 5	. . . . . . . 8 ⊢ ({⟨∅, (1^st ‘𝑤)⟩, ⟨1_o, (2^nd ‘𝑤)⟩}‘1_o) = (2^nd ‘𝑤)
41	34, 37, 40	3eqtr3g 2787	. . . . . . 7 ⊢ ({⟨∅, (1^st ‘𝑧)⟩, ⟨1_o, (2^nd ‘𝑧)⟩} = {⟨∅, (1^st ‘𝑤)⟩, ⟨1_o, (2^nd ‘𝑤)⟩} → (2^nd ‘𝑧) = (2^nd ‘𝑤))
42	33, 41	opeq12d 4835	. . . . . 6 ⊢ ({⟨∅, (1^st ‘𝑧)⟩, ⟨1_o, (2^nd ‘𝑧)⟩} = {⟨∅, (1^st ‘𝑤)⟩, ⟨1_o, (2^nd ‘𝑤)⟩} → ⟨(1^st ‘𝑧), (2^nd ‘𝑧)⟩ = ⟨(1^st ‘𝑤), (2^nd ‘𝑤)⟩)
43	7, 16	eqeqan12d 2743	. . . . . 6 ⊢ ((𝑧 ∈ (𝐴 × 𝐵) ∧ 𝑤 ∈ (𝐴 × 𝐵)) → (𝑧 = 𝑤 ↔ ⟨(1^st ‘𝑧), (2^nd ‘𝑧)⟩ = ⟨(1^st ‘𝑤), (2^nd ‘𝑤)⟩))
44	42, 43	imbitrrid 246	. . . . 5 ⊢ ((𝑧 ∈ (𝐴 × 𝐵) ∧ 𝑤 ∈ (𝐴 × 𝐵)) → ({⟨∅, (1^st ‘𝑧)⟩, ⟨1_o, (2^nd ‘𝑧)⟩} = {⟨∅, (1^st ‘𝑤)⟩, ⟨1_o, (2^nd ‘𝑤)⟩} → 𝑧 = 𝑤))
45	25, 44	sylbid 240	. . . 4 ⊢ ((𝑧 ∈ (𝐴 × 𝐵) ∧ 𝑤 ∈ (𝐴 × 𝐵)) → ((𝐹‘𝑧) = (𝐹‘𝑤) → 𝑧 = 𝑤))
46	45	rgen2 3169	. . 3 ⊢ ∀𝑧 ∈ (𝐴 × 𝐵)∀𝑤 ∈ (𝐴 × 𝐵)((𝐹‘𝑧) = (𝐹‘𝑤) → 𝑧 = 𝑤)
47		dff13 7195	. . 3 ⊢ (𝐹:(𝐴 × 𝐵)–1-1→X𝑘 ∈ 2_o if(𝑘 = ∅, 𝐴, 𝐵) ↔ (𝐹:(𝐴 × 𝐵)⟶X𝑘 ∈ 2_o if(𝑘 = ∅, 𝐴, 𝐵) ∧ ∀𝑧 ∈ (𝐴 × 𝐵)∀𝑤 ∈ (𝐴 × 𝐵)((𝐹‘𝑧) = (𝐹‘𝑤) → 𝑧 = 𝑤)))
48	6, 46, 47	mpbir2an 711	. 2 ⊢ 𝐹:(𝐴 × 𝐵)–1-1→X𝑘 ∈ 2_o if(𝑘 = ∅, 𝐴, 𝐵)
49		xpsfrnel 17484	. . . . . 6 ⊢ (𝑧 ∈ X𝑘 ∈ 2_o if(𝑘 = ∅, 𝐴, 𝐵) ↔ (𝑧 Fn 2_o ∧ (𝑧‘∅) ∈ 𝐴 ∧ (𝑧‘1_o) ∈ 𝐵))
50	49	simp2bi 1146	. . . . 5 ⊢ (𝑧 ∈ X𝑘 ∈ 2_o if(𝑘 = ∅, 𝐴, 𝐵) → (𝑧‘∅) ∈ 𝐴)
51	49	simp3bi 1147	. . . . 5 ⊢ (𝑧 ∈ X𝑘 ∈ 2_o if(𝑘 = ∅, 𝐴, 𝐵) → (𝑧‘1_o) ∈ 𝐵)
52	4	xpsfval 17488	. . . . . . 7 ⊢ (((𝑧‘∅) ∈ 𝐴 ∧ (𝑧‘1_o) ∈ 𝐵) → ((𝑧‘∅)𝐹(𝑧‘1_o)) = {⟨∅, (𝑧‘∅)⟩, ⟨1_o, (𝑧‘1_o)⟩})
53	50, 51, 52	syl2anc 584	. . . . . 6 ⊢ (𝑧 ∈ X𝑘 ∈ 2_o if(𝑘 = ∅, 𝐴, 𝐵) → ((𝑧‘∅)𝐹(𝑧‘1_o)) = {⟨∅, (𝑧‘∅)⟩, ⟨1_o, (𝑧‘1_o)⟩})
54		ixpfn 8837	. . . . . . 7 ⊢ (𝑧 ∈ X𝑘 ∈ 2_o if(𝑘 = ∅, 𝐴, 𝐵) → 𝑧 Fn 2_o)
55		xpsfeq 17485	. . . . . . 7 ⊢ (𝑧 Fn 2_o → {⟨∅, (𝑧‘∅)⟩, ⟨1_o, (𝑧‘1_o)⟩} = 𝑧)
56	54, 55	syl 17	. . . . . 6 ⊢ (𝑧 ∈ X𝑘 ∈ 2_o if(𝑘 = ∅, 𝐴, 𝐵) → {⟨∅, (𝑧‘∅)⟩, ⟨1_o, (𝑧‘1_o)⟩} = 𝑧)
57	53, 56	eqtr2d 2765	. . . . 5 ⊢ (𝑧 ∈ X𝑘 ∈ 2_o if(𝑘 = ∅, 𝐴, 𝐵) → 𝑧 = ((𝑧‘∅)𝐹(𝑧‘1_o)))
58		rspceov 7402	. . . . 5 ⊢ (((𝑧‘∅) ∈ 𝐴 ∧ (𝑧‘1_o) ∈ 𝐵 ∧ 𝑧 = ((𝑧‘∅)𝐹(𝑧‘1_o))) → ∃𝑎 ∈ 𝐴 ∃𝑏 ∈ 𝐵 𝑧 = (𝑎𝐹𝑏))
59	50, 51, 57, 58	syl3anc 1373	. . . 4 ⊢ (𝑧 ∈ X𝑘 ∈ 2_o if(𝑘 = ∅, 𝐴, 𝐵) → ∃𝑎 ∈ 𝐴 ∃𝑏 ∈ 𝐵 𝑧 = (𝑎𝐹𝑏))
60	59	rgen 3046	. . 3 ⊢ ∀𝑧 ∈ X 𝑘 ∈ 2_o if(𝑘 = ∅, 𝐴, 𝐵)∃𝑎 ∈ 𝐴 ∃𝑏 ∈ 𝐵 𝑧 = (𝑎𝐹𝑏)
61		foov 7527	. . 3 ⊢ (𝐹:(𝐴 × 𝐵)–onto→X𝑘 ∈ 2_o if(𝑘 = ∅, 𝐴, 𝐵) ↔ (𝐹:(𝐴 × 𝐵)⟶X𝑘 ∈ 2_o if(𝑘 = ∅, 𝐴, 𝐵) ∧ ∀𝑧 ∈ X 𝑘 ∈ 2_o if(𝑘 = ∅, 𝐴, 𝐵)∃𝑎 ∈ 𝐴 ∃𝑏 ∈ 𝐵 𝑧 = (𝑎𝐹𝑏)))
62	6, 60, 61	mpbir2an 711	. 2 ⊢ 𝐹:(𝐴 × 𝐵)–onto→X𝑘 ∈ 2_o if(𝑘 = ∅, 𝐴, 𝐵)
63		df-f1o 6493	. 2 ⊢ (𝐹:(𝐴 × 𝐵)–1-1-onto→X𝑘 ∈ 2_o if(𝑘 = ∅, 𝐴, 𝐵) ↔ (𝐹:(𝐴 × 𝐵)–1-1→X𝑘 ∈ 2_o if(𝑘 = ∅, 𝐴, 𝐵) ∧ 𝐹:(𝐴 × 𝐵)–onto→X𝑘 ∈ 2_o if(𝑘 = ∅, 𝐴, 𝐵)))
64	48, 62, 63	mpbir2an 711	1 ⊢ 𝐹:(𝐴 × 𝐵)–1-1-onto→X𝑘 ∈ 2_o if(𝑘 = ∅, 𝐴, 𝐵)

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 395 = wceq 1540 ∈ wcel 2109 ∀wral 3044 ∃wrex 3053 Vcvv 3438 ∅c0 4286 ifcif 4478 {cpr 4581 ⟨cop 4585 × cxp 5621 Fn wfn 6481 ⟶wf 6482 –1-1→wf1 6483 –onto→wfo 6484 –1-1-onto→wf1o 6485 ‘cfv 6486 (class class class)co 7353 ∈ cmpo 7355 1^st c1st 7929 2^nd c2nd 7930 1_oc1o 8388 2_oc2o 8389 Xcixp 8831

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2701 ax-sep 5238 ax-nul 5248 ax-pr 5374 ax-un 7675

This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2533 df-eu 2562 df-clab 2708 df-cleq 2721 df-clel 2803 df-nfc 2878 df-ne 2926 df-ral 3045 df-rex 3054 df-reu 3346 df-rab 3397 df-v 3440 df-sbc 3745 df-csb 3854 df-dif 3908 df-un 3910 df-in 3912 df-ss 3922 df-pss 3925 df-nul 4287 df-if 4479 df-pw 4555 df-sn 4580 df-pr 4582 df-op 4586 df-uni 4862 df-iun 4946 df-br 5096 df-opab 5158 df-mpt 5177 df-tr 5203 df-id 5518 df-eprel 5523 df-po 5531 df-so 5532 df-fr 5576 df-we 5578 df-xp 5629 df-rel 5630 df-cnv 5631 df-co 5632 df-dm 5633 df-rn 5634 df-res 5635 df-ima 5636 df-ord 6314 df-on 6315 df-lim 6316 df-suc 6317 df-iota 6442 df-fun 6488 df-fn 6489 df-f 6490 df-f1 6491 df-fo 6492 df-f1o 6493 df-fv 6494 df-ov 7356 df-oprab 7357 df-mpo 7358 df-om 7807 df-1st 7931 df-2nd 7932 df-1o 8395 df-2o 8396 df-ixp 8832 df-en 8880 df-fin 8883

This theorem is referenced by: xpsfrn 17490 xpsff1o2 17491

W3C validator