Theorem f1mpt 7115

Description: Express injection for a mapping operation. (Contributed by Mario Carneiro, 2-Jan-2017.)

Hypotheses

Ref	Expression
f1mpt.1	⊢ 𝐹 = (𝑥 ∈ 𝐴 ↦ 𝐶)
f1mpt.2	⊢ (𝑥 = 𝑦 → 𝐶 = 𝐷)

Assertion

Ref	Expression
f1mpt	⊢ (𝐹:𝐴–1-1→𝐵 ↔ (∀𝑥 ∈ 𝐴 𝐶 ∈ 𝐵 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝐶 = 𝐷 → 𝑥 = 𝑦)))

Distinct variable groups:   𝑥,𝑦,𝐴   𝑥,𝐵,𝑦   𝑦,𝐶   𝑥,𝐷   𝑦,𝐹

Allowed substitution hints:   𝐶(𝑥)   𝐷(𝑦)   𝐹(𝑥)

Proof of Theorem f1mpt

Step	Hyp	Ref	Expression
1		f1mpt.1	. . . 4 ⊢ 𝐹 = (𝑥 ∈ 𝐴 ↦ 𝐶)
2		nfmpt1 5178	. . . 4 ⊢ Ⅎ𝑥(𝑥 ∈ 𝐴 ↦ 𝐶)
3	1, 2	nfcxfr 2904	. . 3 ⊢ Ⅎ𝑥𝐹
4		nfcv 2906	. . 3 ⊢ Ⅎ𝑦𝐹
5	3, 4	dff13f 7110	. 2 ⊢ (𝐹:𝐴–1-1→𝐵 ↔ (𝐹:𝐴⟶𝐵 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ((𝐹‘𝑥) = (𝐹‘𝑦) → 𝑥 = 𝑦)))
6	1	fmpt 6966	. . 3 ⊢ (∀𝑥 ∈ 𝐴 𝐶 ∈ 𝐵 ↔ 𝐹:𝐴⟶𝐵)
7	6	anbi1i 623	. 2 ⊢ ((∀𝑥 ∈ 𝐴 𝐶 ∈ 𝐵 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ((𝐹‘𝑥) = (𝐹‘𝑦) → 𝑥 = 𝑦)) ↔ (𝐹:𝐴⟶𝐵 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ((𝐹‘𝑥) = (𝐹‘𝑦) → 𝑥 = 𝑦)))
8		f1mpt.2	. . . . . . 7 ⊢ (𝑥 = 𝑦 → 𝐶 = 𝐷)
9	8	eleq1d 2823	. . . . . 6 ⊢ (𝑥 = 𝑦 → (𝐶 ∈ 𝐵 ↔ 𝐷 ∈ 𝐵))
10	9	cbvralvw 3372	. . . . 5 ⊢ (∀𝑥 ∈ 𝐴 𝐶 ∈ 𝐵 ↔ ∀𝑦 ∈ 𝐴 𝐷 ∈ 𝐵)
11		raaanv 4449	. . . . . 6 ⊢ (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝐶 ∈ 𝐵 ∧ 𝐷 ∈ 𝐵) ↔ (∀𝑥 ∈ 𝐴 𝐶 ∈ 𝐵 ∧ ∀𝑦 ∈ 𝐴 𝐷 ∈ 𝐵))
12	1	fvmpt2 6868	. . . . . . . . . . . . . 14 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝐶 ∈ 𝐵) → (𝐹‘𝑥) = 𝐶)
13	8, 1	fvmptg 6855	. . . . . . . . . . . . . 14 ⊢ ((𝑦 ∈ 𝐴 ∧ 𝐷 ∈ 𝐵) → (𝐹‘𝑦) = 𝐷)
14	12, 13	eqeqan12d 2752	. . . . . . . . . . . . 13 ⊢ (((𝑥 ∈ 𝐴 ∧ 𝐶 ∈ 𝐵) ∧ (𝑦 ∈ 𝐴 ∧ 𝐷 ∈ 𝐵)) → ((𝐹‘𝑥) = (𝐹‘𝑦) ↔ 𝐶 = 𝐷))
15	14	an4s 656	. . . . . . . . . . . 12 ⊢ (((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴) ∧ (𝐶 ∈ 𝐵 ∧ 𝐷 ∈ 𝐵)) → ((𝐹‘𝑥) = (𝐹‘𝑦) ↔ 𝐶 = 𝐷))
16	15	imbi1d 341	. . . . . . . . . . 11 ⊢ (((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴) ∧ (𝐶 ∈ 𝐵 ∧ 𝐷 ∈ 𝐵)) → (((𝐹‘𝑥) = (𝐹‘𝑦) → 𝑥 = 𝑦) ↔ (𝐶 = 𝐷 → 𝑥 = 𝑦)))
17	16	ex 412	. . . . . . . . . 10 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴) → ((𝐶 ∈ 𝐵 ∧ 𝐷 ∈ 𝐵) → (((𝐹‘𝑥) = (𝐹‘𝑦) → 𝑥 = 𝑦) ↔ (𝐶 = 𝐷 → 𝑥 = 𝑦))))
18	17	ralimdva 3102	. . . . . . . . 9 ⊢ (𝑥 ∈ 𝐴 → (∀𝑦 ∈ 𝐴 (𝐶 ∈ 𝐵 ∧ 𝐷 ∈ 𝐵) → ∀𝑦 ∈ 𝐴 (((𝐹‘𝑥) = (𝐹‘𝑦) → 𝑥 = 𝑦) ↔ (𝐶 = 𝐷 → 𝑥 = 𝑦))))
19		ralbi 3092	. . . . . . . . 9 ⊢ (∀𝑦 ∈ 𝐴 (((𝐹‘𝑥) = (𝐹‘𝑦) → 𝑥 = 𝑦) ↔ (𝐶 = 𝐷 → 𝑥 = 𝑦)) → (∀𝑦 ∈ 𝐴 ((𝐹‘𝑥) = (𝐹‘𝑦) → 𝑥 = 𝑦) ↔ ∀𝑦 ∈ 𝐴 (𝐶 = 𝐷 → 𝑥 = 𝑦)))
20	18, 19	syl6 35	. . . . . . . 8 ⊢ (𝑥 ∈ 𝐴 → (∀𝑦 ∈ 𝐴 (𝐶 ∈ 𝐵 ∧ 𝐷 ∈ 𝐵) → (∀𝑦 ∈ 𝐴 ((𝐹‘𝑥) = (𝐹‘𝑦) → 𝑥 = 𝑦) ↔ ∀𝑦 ∈ 𝐴 (𝐶 = 𝐷 → 𝑥 = 𝑦))))
21	20	ralimia 3084	. . . . . . 7 ⊢ (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝐶 ∈ 𝐵 ∧ 𝐷 ∈ 𝐵) → ∀𝑥 ∈ 𝐴 (∀𝑦 ∈ 𝐴 ((𝐹‘𝑥) = (𝐹‘𝑦) → 𝑥 = 𝑦) ↔ ∀𝑦 ∈ 𝐴 (𝐶 = 𝐷 → 𝑥 = 𝑦)))
22		ralbi 3092	. . . . . . 7 ⊢ (∀𝑥 ∈ 𝐴 (∀𝑦 ∈ 𝐴 ((𝐹‘𝑥) = (𝐹‘𝑦) → 𝑥 = 𝑦) ↔ ∀𝑦 ∈ 𝐴 (𝐶 = 𝐷 → 𝑥 = 𝑦)) → (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ((𝐹‘𝑥) = (𝐹‘𝑦) → 𝑥 = 𝑦) ↔ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝐶 = 𝐷 → 𝑥 = 𝑦)))
23	21, 22	syl 17	. . . . . 6 ⊢ (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝐶 ∈ 𝐵 ∧ 𝐷 ∈ 𝐵) → (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ((𝐹‘𝑥) = (𝐹‘𝑦) → 𝑥 = 𝑦) ↔ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝐶 = 𝐷 → 𝑥 = 𝑦)))
24	11, 23	sylbir 234	. . . . 5 ⊢ ((∀𝑥 ∈ 𝐴 𝐶 ∈ 𝐵 ∧ ∀𝑦 ∈ 𝐴 𝐷 ∈ 𝐵) → (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ((𝐹‘𝑥) = (𝐹‘𝑦) → 𝑥 = 𝑦) ↔ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝐶 = 𝐷 → 𝑥 = 𝑦)))
25	10, 24	sylan2b 593	. . . 4 ⊢ ((∀𝑥 ∈ 𝐴 𝐶 ∈ 𝐵 ∧ ∀𝑥 ∈ 𝐴 𝐶 ∈ 𝐵) → (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ((𝐹‘𝑥) = (𝐹‘𝑦) → 𝑥 = 𝑦) ↔ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝐶 = 𝐷 → 𝑥 = 𝑦)))
26	25	anidms 566	. . 3 ⊢ (∀𝑥 ∈ 𝐴 𝐶 ∈ 𝐵 → (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ((𝐹‘𝑥) = (𝐹‘𝑦) → 𝑥 = 𝑦) ↔ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝐶 = 𝐷 → 𝑥 = 𝑦)))
27	26	pm5.32i 574	. 2 ⊢ ((∀𝑥 ∈ 𝐴 𝐶 ∈ 𝐵 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ((𝐹‘𝑥) = (𝐹‘𝑦) → 𝑥 = 𝑦)) ↔ (∀𝑥 ∈ 𝐴 𝐶 ∈ 𝐵 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝐶 = 𝐷 → 𝑥 = 𝑦)))
28	5, 7, 27	3bitr2i 298	1 ⊢ (𝐹:𝐴–1-1→𝐵 ↔ (∀𝑥 ∈ 𝐴 𝐶 ∈ 𝐵 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝐶 = 𝐷 → 𝑥 = 𝑦)))

Syntax hints:   → wi 4   ↔ wb 205   ∧ wa 395   = wceq 1539   ∈ wcel 2108  ∀wral 3063   ↦ cmpt 5153  ⟶wf 6414  –1-1→wf1 6415  ‘cfv 6418

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1799  ax-4 1813  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2110  ax-9 2118  ax-10 2139  ax-11 2156  ax-12 2173  ax-ext 2709  ax-sep 5218  ax-nul 5225  ax-pr 5347

This theorem depends on definitions:  df-bi 206  df-an 396  df-or 844  df-3an 1087  df-tru 1542  df-fal 1552  df-ex 1784  df-nf 1788  df-sb 2069  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2817  df-nfc 2888  df-ne 2943  df-ral 3068  df-rex 3069  df-rab 3072  df-v 3424  df-sbc 3712  df-csb 3829  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-nul 4254  df-if 4457  df-sn 4559  df-pr 4561  df-op 4565  df-uni 4837  df-br 5071  df-opab 5133  df-mpt 5154  df-id 5480  df-xp 5586  df-rel 5587  df-cnv 5588  df-co 5589  df-dm 5590  df-rn 5591  df-res 5592  df-ima 5593  df-iota 6376  df-fun 6420  df-fn 6421  df-f 6422  df-f1 6423  df-fv 6426

This theorem is referenced by:  ismon2  17363  isepi2  17370  uspgredg2v  27494  usgredg2v  27497  aciunf1lem  30901  fnpreimac  30910  disjf1  42609