f1o2ndf1 - Metamath Proof Explorer

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

Theorem f1o2ndf1 8104

Description: The 2^nd (second component of an ordered pair) function restricted to a one-to-one function 𝐹 is a one-to-one function from 𝐹 onto the range of 𝐹. (Contributed by Alexander van der Vekens, 4-Feb-2018.)

**Assertion**
Ref	Expression
f1o2ndf1	⊢ (𝐹:𝐴–1-1→𝐵 → (2^nd ↾ 𝐹):𝐹–1-1-onto→ran 𝐹)

Proof of Theorem f1o2ndf1 Dummy variables 𝑎 𝑏 𝑣 𝑤 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		f1f 6784	. . 3 ⊢ (𝐹:𝐴–1-1→𝐵 → 𝐹:𝐴⟶𝐵)
2		fo2ndf 8103	. . 3 ⊢ (𝐹:𝐴⟶𝐵 → (2^nd ↾ 𝐹):𝐹–onto→ran 𝐹)
3	1, 2	syl 17	. 2 ⊢ (𝐹:𝐴–1-1→𝐵 → (2^nd ↾ 𝐹):𝐹–onto→ran 𝐹)
4		f2ndf 8102	. . . . 5 ⊢ (𝐹:𝐴⟶𝐵 → (2^nd ↾ 𝐹):𝐹⟶𝐵)
5	1, 4	syl 17	. . . 4 ⊢ (𝐹:𝐴–1-1→𝐵 → (2^nd ↾ 𝐹):𝐹⟶𝐵)
6		fssxp 6742	. . . . . . 7 ⊢ (𝐹:𝐴⟶𝐵 → 𝐹 ⊆ (𝐴 × 𝐵))
7	1, 6	syl 17	. . . . . 6 ⊢ (𝐹:𝐴–1-1→𝐵 → 𝐹 ⊆ (𝐴 × 𝐵))
8		ssel2 3976	. . . . . . . . . . 11 ⊢ ((𝐹 ⊆ (𝐴 × 𝐵) ∧ 𝑥 ∈ 𝐹) → 𝑥 ∈ (𝐴 × 𝐵))
9		elxp2 5699	. . . . . . . . . . 11 ⊢ (𝑥 ∈ (𝐴 × 𝐵) ↔ ∃𝑎 ∈ 𝐴 ∃𝑣 ∈ 𝐵 𝑥 = ⟨𝑎, 𝑣⟩)
10	8, 9	sylib 217	. . . . . . . . . 10 ⊢ ((𝐹 ⊆ (𝐴 × 𝐵) ∧ 𝑥 ∈ 𝐹) → ∃𝑎 ∈ 𝐴 ∃𝑣 ∈ 𝐵 𝑥 = ⟨𝑎, 𝑣⟩)
11		ssel2 3976	. . . . . . . . . . 11 ⊢ ((𝐹 ⊆ (𝐴 × 𝐵) ∧ 𝑦 ∈ 𝐹) → 𝑦 ∈ (𝐴 × 𝐵))
12		elxp2 5699	. . . . . . . . . . 11 ⊢ (𝑦 ∈ (𝐴 × 𝐵) ↔ ∃𝑏 ∈ 𝐴 ∃𝑤 ∈ 𝐵 𝑦 = ⟨𝑏, 𝑤⟩)
13	11, 12	sylib 217	. . . . . . . . . 10 ⊢ ((𝐹 ⊆ (𝐴 × 𝐵) ∧ 𝑦 ∈ 𝐹) → ∃𝑏 ∈ 𝐴 ∃𝑤 ∈ 𝐵 𝑦 = ⟨𝑏, 𝑤⟩)
14	10, 13	anim12dan 619	. . . . . . . . 9 ⊢ ((𝐹 ⊆ (𝐴 × 𝐵) ∧ (𝑥 ∈ 𝐹 ∧ 𝑦 ∈ 𝐹)) → (∃𝑎 ∈ 𝐴 ∃𝑣 ∈ 𝐵 𝑥 = ⟨𝑎, 𝑣⟩ ∧ ∃𝑏 ∈ 𝐴 ∃𝑤 ∈ 𝐵 𝑦 = ⟨𝑏, 𝑤⟩))
15		fvres 6907	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (⟨𝑎, 𝑣⟩ ∈ 𝐹 → ((2^nd ↾ 𝐹)‘⟨𝑎, 𝑣⟩) = (2^nd ‘⟨𝑎, 𝑣⟩))
16	15	ad2antrr 724	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (((⟨𝑎, 𝑣⟩ ∈ 𝐹 ∧ ⟨𝑏, 𝑤⟩ ∈ 𝐹) ∧ ((𝑎 ∈ 𝐴 ∧ 𝑣 ∈ 𝐵) ∧ (𝑏 ∈ 𝐴 ∧ 𝑤 ∈ 𝐵))) → ((2^nd ↾ 𝐹)‘⟨𝑎, 𝑣⟩) = (2^nd ‘⟨𝑎, 𝑣⟩))
17		fvres 6907	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (⟨𝑏, 𝑤⟩ ∈ 𝐹 → ((2^nd ↾ 𝐹)‘⟨𝑏, 𝑤⟩) = (2^nd ‘⟨𝑏, 𝑤⟩))
18	17	ad2antlr 725	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (((⟨𝑎, 𝑣⟩ ∈ 𝐹 ∧ ⟨𝑏, 𝑤⟩ ∈ 𝐹) ∧ ((𝑎 ∈ 𝐴 ∧ 𝑣 ∈ 𝐵) ∧ (𝑏 ∈ 𝐴 ∧ 𝑤 ∈ 𝐵))) → ((2^nd ↾ 𝐹)‘⟨𝑏, 𝑤⟩) = (2^nd ‘⟨𝑏, 𝑤⟩))
19	16, 18	eqeq12d 2748	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (((⟨𝑎, 𝑣⟩ ∈ 𝐹 ∧ ⟨𝑏, 𝑤⟩ ∈ 𝐹) ∧ ((𝑎 ∈ 𝐴 ∧ 𝑣 ∈ 𝐵) ∧ (𝑏 ∈ 𝐴 ∧ 𝑤 ∈ 𝐵))) → (((2^nd ↾ 𝐹)‘⟨𝑎, 𝑣⟩) = ((2^nd ↾ 𝐹)‘⟨𝑏, 𝑤⟩) ↔ (2^nd ‘⟨𝑎, 𝑣⟩) = (2^nd ‘⟨𝑏, 𝑤⟩)))
20		vex 3478	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ 𝑎 ∈ V
21		vex 3478	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ 𝑣 ∈ V
22	20, 21	op2nd 7980	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (2^nd ‘⟨𝑎, 𝑣⟩) = 𝑣
23		vex 3478	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ 𝑏 ∈ V
24		vex 3478	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ 𝑤 ∈ V
25	23, 24	op2nd 7980	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (2^nd ‘⟨𝑏, 𝑤⟩) = 𝑤
26	22, 25	eqeq12i 2750	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ ((2^nd ‘⟨𝑎, 𝑣⟩) = (2^nd ‘⟨𝑏, 𝑤⟩) ↔ 𝑣 = 𝑤)
27		f1fun 6786	. . . . . . . . . . . . . . . . . . . . . . . . . . 27 ⊢ (𝐹:𝐴–1-1→𝐵 → Fun 𝐹)
28		funopfv 6940	. . . . . . . . . . . . . . . . . . . . . . . . . . . 28 ⊢ (Fun 𝐹 → (⟨𝑎, 𝑣⟩ ∈ 𝐹 → (𝐹‘𝑎) = 𝑣))
29		funopfv 6940	. . . . . . . . . . . . . . . . . . . . . . . . . . . 28 ⊢ (Fun 𝐹 → (⟨𝑏, 𝑤⟩ ∈ 𝐹 → (𝐹‘𝑏) = 𝑤))
30	28, 29	anim12d 609	. . . . . . . . . . . . . . . . . . . . . . . . . . 27 ⊢ (Fun 𝐹 → ((⟨𝑎, 𝑣⟩ ∈ 𝐹 ∧ ⟨𝑏, 𝑤⟩ ∈ 𝐹) → ((𝐹‘𝑎) = 𝑣 ∧ (𝐹‘𝑏) = 𝑤)))
31	27, 30	syl 17	. . . . . . . . . . . . . . . . . . . . . . . . . 26 ⊢ (𝐹:𝐴–1-1→𝐵 → ((⟨𝑎, 𝑣⟩ ∈ 𝐹 ∧ ⟨𝑏, 𝑤⟩ ∈ 𝐹) → ((𝐹‘𝑎) = 𝑣 ∧ (𝐹‘𝑏) = 𝑤)))
32		eqcom 2739	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 33 ⊢ ((𝐹‘𝑎) = 𝑣 ↔ 𝑣 = (𝐹‘𝑎))
33	32	biimpi 215	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 32 ⊢ ((𝐹‘𝑎) = 𝑣 → 𝑣 = (𝐹‘𝑎))
34		eqcom 2739	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 33 ⊢ ((𝐹‘𝑏) = 𝑤 ↔ 𝑤 = (𝐹‘𝑏))
35	34	biimpi 215	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 32 ⊢ ((𝐹‘𝑏) = 𝑤 → 𝑤 = (𝐹‘𝑏))
36	33, 35	eqeqan12d 2746	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 31 ⊢ (((𝐹‘𝑎) = 𝑣 ∧ (𝐹‘𝑏) = 𝑤) → (𝑣 = 𝑤 ↔ (𝐹‘𝑎) = (𝐹‘𝑏)))
37		simpl 483	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 37 ⊢ ((𝑎 ∈ 𝐴 ∧ 𝑣 ∈ 𝐵) → 𝑎 ∈ 𝐴)
38		simpl 483	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 37 ⊢ ((𝑏 ∈ 𝐴 ∧ 𝑤 ∈ 𝐵) → 𝑏 ∈ 𝐴)
39	37, 38	anim12i 613	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 36 ⊢ (((𝑎 ∈ 𝐴 ∧ 𝑣 ∈ 𝐵) ∧ (𝑏 ∈ 𝐴 ∧ 𝑤 ∈ 𝐵)) → (𝑎 ∈ 𝐴 ∧ 𝑏 ∈ 𝐴))
40		f1veqaeq 7252	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 36 ⊢ ((𝐹:𝐴–1-1→𝐵 ∧ (𝑎 ∈ 𝐴 ∧ 𝑏 ∈ 𝐴)) → ((𝐹‘𝑎) = (𝐹‘𝑏) → 𝑎 = 𝑏))
41	39, 40	sylan2 593	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 35 ⊢ ((𝐹:𝐴–1-1→𝐵 ∧ ((𝑎 ∈ 𝐴 ∧ 𝑣 ∈ 𝐵) ∧ (𝑏 ∈ 𝐴 ∧ 𝑤 ∈ 𝐵))) → ((𝐹‘𝑎) = (𝐹‘𝑏) → 𝑎 = 𝑏))
42		opeq12 4874	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 36 ⊢ ((𝑎 = 𝑏 ∧ 𝑣 = 𝑤) → ⟨𝑎, 𝑣⟩ = ⟨𝑏, 𝑤⟩)
43	42	ex 413	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 35 ⊢ (𝑎 = 𝑏 → (𝑣 = 𝑤 → ⟨𝑎, 𝑣⟩ = ⟨𝑏, 𝑤⟩))
44	41, 43	syl6 35	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 34 ⊢ ((𝐹:𝐴–1-1→𝐵 ∧ ((𝑎 ∈ 𝐴 ∧ 𝑣 ∈ 𝐵) ∧ (𝑏 ∈ 𝐴 ∧ 𝑤 ∈ 𝐵))) → ((𝐹‘𝑎) = (𝐹‘𝑏) → (𝑣 = 𝑤 → ⟨𝑎, 𝑣⟩ = ⟨𝑏, 𝑤⟩)))
45	44	com23 86	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 33 ⊢ ((𝐹:𝐴–1-1→𝐵 ∧ ((𝑎 ∈ 𝐴 ∧ 𝑣 ∈ 𝐵) ∧ (𝑏 ∈ 𝐴 ∧ 𝑤 ∈ 𝐵))) → (𝑣 = 𝑤 → ((𝐹‘𝑎) = (𝐹‘𝑏) → ⟨𝑎, 𝑣⟩ = ⟨𝑏, 𝑤⟩)))
46	45	ex 413	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 32 ⊢ (𝐹:𝐴–1-1→𝐵 → (((𝑎 ∈ 𝐴 ∧ 𝑣 ∈ 𝐵) ∧ (𝑏 ∈ 𝐴 ∧ 𝑤 ∈ 𝐵)) → (𝑣 = 𝑤 → ((𝐹‘𝑎) = (𝐹‘𝑏) → ⟨𝑎, 𝑣⟩ = ⟨𝑏, 𝑤⟩))))
47	46	com14 96	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 31 ⊢ ((𝐹‘𝑎) = (𝐹‘𝑏) → (((𝑎 ∈ 𝐴 ∧ 𝑣 ∈ 𝐵) ∧ (𝑏 ∈ 𝐴 ∧ 𝑤 ∈ 𝐵)) → (𝑣 = 𝑤 → (𝐹:𝐴–1-1→𝐵 → ⟨𝑎, 𝑣⟩ = ⟨𝑏, 𝑤⟩))))
48	36, 47	syl6bi 252	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . 30 ⊢ (((𝐹‘𝑎) = 𝑣 ∧ (𝐹‘𝑏) = 𝑤) → (𝑣 = 𝑤 → (((𝑎 ∈ 𝐴 ∧ 𝑣 ∈ 𝐵) ∧ (𝑏 ∈ 𝐴 ∧ 𝑤 ∈ 𝐵)) → (𝑣 = 𝑤 → (𝐹:𝐴–1-1→𝐵 → ⟨𝑎, 𝑣⟩ = ⟨𝑏, 𝑤⟩)))))
49	48	com14 96	. . . . . . . . . . . . . . . . . . . . . . . . . . . . 29 ⊢ (𝑣 = 𝑤 → (𝑣 = 𝑤 → (((𝑎 ∈ 𝐴 ∧ 𝑣 ∈ 𝐵) ∧ (𝑏 ∈ 𝐴 ∧ 𝑤 ∈ 𝐵)) → (((𝐹‘𝑎) = 𝑣 ∧ (𝐹‘𝑏) = 𝑤) → (𝐹:𝐴–1-1→𝐵 → ⟨𝑎, 𝑣⟩ = ⟨𝑏, 𝑤⟩)))))
50	49	pm2.43i 52	. . . . . . . . . . . . . . . . . . . . . . . . . . . 28 ⊢ (𝑣 = 𝑤 → (((𝑎 ∈ 𝐴 ∧ 𝑣 ∈ 𝐵) ∧ (𝑏 ∈ 𝐴 ∧ 𝑤 ∈ 𝐵)) → (((𝐹‘𝑎) = 𝑣 ∧ (𝐹‘𝑏) = 𝑤) → (𝐹:𝐴–1-1→𝐵 → ⟨𝑎, 𝑣⟩ = ⟨𝑏, 𝑤⟩))))
51	50	com14 96	. . . . . . . . . . . . . . . . . . . . . . . . . . 27 ⊢ (𝐹:𝐴–1-1→𝐵 → (((𝑎 ∈ 𝐴 ∧ 𝑣 ∈ 𝐵) ∧ (𝑏 ∈ 𝐴 ∧ 𝑤 ∈ 𝐵)) → (((𝐹‘𝑎) = 𝑣 ∧ (𝐹‘𝑏) = 𝑤) → (𝑣 = 𝑤 → ⟨𝑎, 𝑣⟩ = ⟨𝑏, 𝑤⟩))))
52	51	com23 86	. . . . . . . . . . . . . . . . . . . . . . . . . 26 ⊢ (𝐹:𝐴–1-1→𝐵 → (((𝐹‘𝑎) = 𝑣 ∧ (𝐹‘𝑏) = 𝑤) → (((𝑎 ∈ 𝐴 ∧ 𝑣 ∈ 𝐵) ∧ (𝑏 ∈ 𝐴 ∧ 𝑤 ∈ 𝐵)) → (𝑣 = 𝑤 → ⟨𝑎, 𝑣⟩ = ⟨𝑏, 𝑤⟩))))
53	31, 52	syld 47	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ (𝐹:𝐴–1-1→𝐵 → ((⟨𝑎, 𝑣⟩ ∈ 𝐹 ∧ ⟨𝑏, 𝑤⟩ ∈ 𝐹) → (((𝑎 ∈ 𝐴 ∧ 𝑣 ∈ 𝐵) ∧ (𝑏 ∈ 𝐴 ∧ 𝑤 ∈ 𝐵)) → (𝑣 = 𝑤 → ⟨𝑎, 𝑣⟩ = ⟨𝑏, 𝑤⟩))))
54	53	com13 88	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ (((𝑎 ∈ 𝐴 ∧ 𝑣 ∈ 𝐵) ∧ (𝑏 ∈ 𝐴 ∧ 𝑤 ∈ 𝐵)) → ((⟨𝑎, 𝑣⟩ ∈ 𝐹 ∧ ⟨𝑏, 𝑤⟩ ∈ 𝐹) → (𝐹:𝐴–1-1→𝐵 → (𝑣 = 𝑤 → ⟨𝑎, 𝑣⟩ = ⟨𝑏, 𝑤⟩))))
55	54	impcom 408	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (((⟨𝑎, 𝑣⟩ ∈ 𝐹 ∧ ⟨𝑏, 𝑤⟩ ∈ 𝐹) ∧ ((𝑎 ∈ 𝐴 ∧ 𝑣 ∈ 𝐵) ∧ (𝑏 ∈ 𝐴 ∧ 𝑤 ∈ 𝐵))) → (𝐹:𝐴–1-1→𝐵 → (𝑣 = 𝑤 → ⟨𝑎, 𝑣⟩ = ⟨𝑏, 𝑤⟩)))
56	55	com23 86	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (((⟨𝑎, 𝑣⟩ ∈ 𝐹 ∧ ⟨𝑏, 𝑤⟩ ∈ 𝐹) ∧ ((𝑎 ∈ 𝐴 ∧ 𝑣 ∈ 𝐵) ∧ (𝑏 ∈ 𝐴 ∧ 𝑤 ∈ 𝐵))) → (𝑣 = 𝑤 → (𝐹:𝐴–1-1→𝐵 → ⟨𝑎, 𝑣⟩ = ⟨𝑏, 𝑤⟩)))
57	26, 56	biimtrid 241	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (((⟨𝑎, 𝑣⟩ ∈ 𝐹 ∧ ⟨𝑏, 𝑤⟩ ∈ 𝐹) ∧ ((𝑎 ∈ 𝐴 ∧ 𝑣 ∈ 𝐵) ∧ (𝑏 ∈ 𝐴 ∧ 𝑤 ∈ 𝐵))) → ((2^nd ‘⟨𝑎, 𝑣⟩) = (2^nd ‘⟨𝑏, 𝑤⟩) → (𝐹:𝐴–1-1→𝐵 → ⟨𝑎, 𝑣⟩ = ⟨𝑏, 𝑤⟩)))
58	19, 57	sylbid 239	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((⟨𝑎, 𝑣⟩ ∈ 𝐹 ∧ ⟨𝑏, 𝑤⟩ ∈ 𝐹) ∧ ((𝑎 ∈ 𝐴 ∧ 𝑣 ∈ 𝐵) ∧ (𝑏 ∈ 𝐴 ∧ 𝑤 ∈ 𝐵))) → (((2^nd ↾ 𝐹)‘⟨𝑎, 𝑣⟩) = ((2^nd ↾ 𝐹)‘⟨𝑏, 𝑤⟩) → (𝐹:𝐴–1-1→𝐵 → ⟨𝑎, 𝑣⟩ = ⟨𝑏, 𝑤⟩)))
59	58	com23 86	. . . . . . . . . . . . . . . . . . 19 ⊢ (((⟨𝑎, 𝑣⟩ ∈ 𝐹 ∧ ⟨𝑏, 𝑤⟩ ∈ 𝐹) ∧ ((𝑎 ∈ 𝐴 ∧ 𝑣 ∈ 𝐵) ∧ (𝑏 ∈ 𝐴 ∧ 𝑤 ∈ 𝐵))) → (𝐹:𝐴–1-1→𝐵 → (((2^nd ↾ 𝐹)‘⟨𝑎, 𝑣⟩) = ((2^nd ↾ 𝐹)‘⟨𝑏, 𝑤⟩) → ⟨𝑎, 𝑣⟩ = ⟨𝑏, 𝑤⟩)))
60	59	ex 413	. . . . . . . . . . . . . . . . . 18 ⊢ ((⟨𝑎, 𝑣⟩ ∈ 𝐹 ∧ ⟨𝑏, 𝑤⟩ ∈ 𝐹) → (((𝑎 ∈ 𝐴 ∧ 𝑣 ∈ 𝐵) ∧ (𝑏 ∈ 𝐴 ∧ 𝑤 ∈ 𝐵)) → (𝐹:𝐴–1-1→𝐵 → (((2^nd ↾ 𝐹)‘⟨𝑎, 𝑣⟩) = ((2^nd ↾ 𝐹)‘⟨𝑏, 𝑤⟩) → ⟨𝑎, 𝑣⟩ = ⟨𝑏, 𝑤⟩))))
61	60	adantl 482	. . . . . . . . . . . . . . . . 17 ⊢ ((𝐹 ⊆ (𝐴 × 𝐵) ∧ (⟨𝑎, 𝑣⟩ ∈ 𝐹 ∧ ⟨𝑏, 𝑤⟩ ∈ 𝐹)) → (((𝑎 ∈ 𝐴 ∧ 𝑣 ∈ 𝐵) ∧ (𝑏 ∈ 𝐴 ∧ 𝑤 ∈ 𝐵)) → (𝐹:𝐴–1-1→𝐵 → (((2^nd ↾ 𝐹)‘⟨𝑎, 𝑣⟩) = ((2^nd ↾ 𝐹)‘⟨𝑏, 𝑤⟩) → ⟨𝑎, 𝑣⟩ = ⟨𝑏, 𝑤⟩))))
62	61	com12 32	. . . . . . . . . . . . . . . 16 ⊢ (((𝑎 ∈ 𝐴 ∧ 𝑣 ∈ 𝐵) ∧ (𝑏 ∈ 𝐴 ∧ 𝑤 ∈ 𝐵)) → ((𝐹 ⊆ (𝐴 × 𝐵) ∧ (⟨𝑎, 𝑣⟩ ∈ 𝐹 ∧ ⟨𝑏, 𝑤⟩ ∈ 𝐹)) → (𝐹:𝐴–1-1→𝐵 → (((2^nd ↾ 𝐹)‘⟨𝑎, 𝑣⟩) = ((2^nd ↾ 𝐹)‘⟨𝑏, 𝑤⟩) → ⟨𝑎, 𝑣⟩ = ⟨𝑏, 𝑤⟩))))
63	62	ad4ant13 749	. . . . . . . . . . . . . . 15 ⊢ (((((𝑎 ∈ 𝐴 ∧ 𝑣 ∈ 𝐵) ∧ 𝑥 = ⟨𝑎, 𝑣⟩) ∧ (𝑏 ∈ 𝐴 ∧ 𝑤 ∈ 𝐵)) ∧ 𝑦 = ⟨𝑏, 𝑤⟩) → ((𝐹 ⊆ (𝐴 × 𝐵) ∧ (⟨𝑎, 𝑣⟩ ∈ 𝐹 ∧ ⟨𝑏, 𝑤⟩ ∈ 𝐹)) → (𝐹:𝐴–1-1→𝐵 → (((2^nd ↾ 𝐹)‘⟨𝑎, 𝑣⟩) = ((2^nd ↾ 𝐹)‘⟨𝑏, 𝑤⟩) → ⟨𝑎, 𝑣⟩ = ⟨𝑏, 𝑤⟩))))
64		eleq1 2821	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑥 = ⟨𝑎, 𝑣⟩ → (𝑥 ∈ 𝐹 ↔ ⟨𝑎, 𝑣⟩ ∈ 𝐹))
65	64	ad2antlr 725	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝑎 ∈ 𝐴 ∧ 𝑣 ∈ 𝐵) ∧ 𝑥 = ⟨𝑎, 𝑣⟩) ∧ (𝑏 ∈ 𝐴 ∧ 𝑤 ∈ 𝐵)) → (𝑥 ∈ 𝐹 ↔ ⟨𝑎, 𝑣⟩ ∈ 𝐹))
66		eleq1 2821	. . . . . . . . . . . . . . . . 17 ⊢ (𝑦 = ⟨𝑏, 𝑤⟩ → (𝑦 ∈ 𝐹 ↔ ⟨𝑏, 𝑤⟩ ∈ 𝐹))
67	65, 66	bi2anan9 637	. . . . . . . . . . . . . . . 16 ⊢ (((((𝑎 ∈ 𝐴 ∧ 𝑣 ∈ 𝐵) ∧ 𝑥 = ⟨𝑎, 𝑣⟩) ∧ (𝑏 ∈ 𝐴 ∧ 𝑤 ∈ 𝐵)) ∧ 𝑦 = ⟨𝑏, 𝑤⟩) → ((𝑥 ∈ 𝐹 ∧ 𝑦 ∈ 𝐹) ↔ (⟨𝑎, 𝑣⟩ ∈ 𝐹 ∧ ⟨𝑏, 𝑤⟩ ∈ 𝐹)))
68	67	anbi2d 629	. . . . . . . . . . . . . . 15 ⊢ (((((𝑎 ∈ 𝐴 ∧ 𝑣 ∈ 𝐵) ∧ 𝑥 = ⟨𝑎, 𝑣⟩) ∧ (𝑏 ∈ 𝐴 ∧ 𝑤 ∈ 𝐵)) ∧ 𝑦 = ⟨𝑏, 𝑤⟩) → ((𝐹 ⊆ (𝐴 × 𝐵) ∧ (𝑥 ∈ 𝐹 ∧ 𝑦 ∈ 𝐹)) ↔ (𝐹 ⊆ (𝐴 × 𝐵) ∧ (⟨𝑎, 𝑣⟩ ∈ 𝐹 ∧ ⟨𝑏, 𝑤⟩ ∈ 𝐹))))
69		fveq2 6888	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑥 = ⟨𝑎, 𝑣⟩ → ((2^nd ↾ 𝐹)‘𝑥) = ((2^nd ↾ 𝐹)‘⟨𝑎, 𝑣⟩))
70	69	ad2antlr 725	. . . . . . . . . . . . . . . . . 18 ⊢ ((((𝑎 ∈ 𝐴 ∧ 𝑣 ∈ 𝐵) ∧ 𝑥 = ⟨𝑎, 𝑣⟩) ∧ (𝑏 ∈ 𝐴 ∧ 𝑤 ∈ 𝐵)) → ((2^nd ↾ 𝐹)‘𝑥) = ((2^nd ↾ 𝐹)‘⟨𝑎, 𝑣⟩))
71		fveq2 6888	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑦 = ⟨𝑏, 𝑤⟩ → ((2^nd ↾ 𝐹)‘𝑦) = ((2^nd ↾ 𝐹)‘⟨𝑏, 𝑤⟩))
72	70, 71	eqeqan12d 2746	. . . . . . . . . . . . . . . . 17 ⊢ (((((𝑎 ∈ 𝐴 ∧ 𝑣 ∈ 𝐵) ∧ 𝑥 = ⟨𝑎, 𝑣⟩) ∧ (𝑏 ∈ 𝐴 ∧ 𝑤 ∈ 𝐵)) ∧ 𝑦 = ⟨𝑏, 𝑤⟩) → (((2^nd ↾ 𝐹)‘𝑥) = ((2^nd ↾ 𝐹)‘𝑦) ↔ ((2^nd ↾ 𝐹)‘⟨𝑎, 𝑣⟩) = ((2^nd ↾ 𝐹)‘⟨𝑏, 𝑤⟩)))
73		simpllr 774	. . . . . . . . . . . . . . . . . 18 ⊢ (((((𝑎 ∈ 𝐴 ∧ 𝑣 ∈ 𝐵) ∧ 𝑥 = ⟨𝑎, 𝑣⟩) ∧ (𝑏 ∈ 𝐴 ∧ 𝑤 ∈ 𝐵)) ∧ 𝑦 = ⟨𝑏, 𝑤⟩) → 𝑥 = ⟨𝑎, 𝑣⟩)
74		simpr 485	. . . . . . . . . . . . . . . . . 18 ⊢ (((((𝑎 ∈ 𝐴 ∧ 𝑣 ∈ 𝐵) ∧ 𝑥 = ⟨𝑎, 𝑣⟩) ∧ (𝑏 ∈ 𝐴 ∧ 𝑤 ∈ 𝐵)) ∧ 𝑦 = ⟨𝑏, 𝑤⟩) → 𝑦 = ⟨𝑏, 𝑤⟩)
75	73, 74	eqeq12d 2748	. . . . . . . . . . . . . . . . 17 ⊢ (((((𝑎 ∈ 𝐴 ∧ 𝑣 ∈ 𝐵) ∧ 𝑥 = ⟨𝑎, 𝑣⟩) ∧ (𝑏 ∈ 𝐴 ∧ 𝑤 ∈ 𝐵)) ∧ 𝑦 = ⟨𝑏, 𝑤⟩) → (𝑥 = 𝑦 ↔ ⟨𝑎, 𝑣⟩ = ⟨𝑏, 𝑤⟩))
76	72, 75	imbi12d 344	. . . . . . . . . . . . . . . 16 ⊢ (((((𝑎 ∈ 𝐴 ∧ 𝑣 ∈ 𝐵) ∧ 𝑥 = ⟨𝑎, 𝑣⟩) ∧ (𝑏 ∈ 𝐴 ∧ 𝑤 ∈ 𝐵)) ∧ 𝑦 = ⟨𝑏, 𝑤⟩) → ((((2^nd ↾ 𝐹)‘𝑥) = ((2^nd ↾ 𝐹)‘𝑦) → 𝑥 = 𝑦) ↔ (((2^nd ↾ 𝐹)‘⟨𝑎, 𝑣⟩) = ((2^nd ↾ 𝐹)‘⟨𝑏, 𝑤⟩) → ⟨𝑎, 𝑣⟩ = ⟨𝑏, 𝑤⟩)))
77	76	imbi2d 340	. . . . . . . . . . . . . . 15 ⊢ (((((𝑎 ∈ 𝐴 ∧ 𝑣 ∈ 𝐵) ∧ 𝑥 = ⟨𝑎, 𝑣⟩) ∧ (𝑏 ∈ 𝐴 ∧ 𝑤 ∈ 𝐵)) ∧ 𝑦 = ⟨𝑏, 𝑤⟩) → ((𝐹:𝐴–1-1→𝐵 → (((2^nd ↾ 𝐹)‘𝑥) = ((2^nd ↾ 𝐹)‘𝑦) → 𝑥 = 𝑦)) ↔ (𝐹:𝐴–1-1→𝐵 → (((2^nd ↾ 𝐹)‘⟨𝑎, 𝑣⟩) = ((2^nd ↾ 𝐹)‘⟨𝑏, 𝑤⟩) → ⟨𝑎, 𝑣⟩ = ⟨𝑏, 𝑤⟩))))
78	63, 68, 77	3imtr4d 293	. . . . . . . . . . . . . 14 ⊢ (((((𝑎 ∈ 𝐴 ∧ 𝑣 ∈ 𝐵) ∧ 𝑥 = ⟨𝑎, 𝑣⟩) ∧ (𝑏 ∈ 𝐴 ∧ 𝑤 ∈ 𝐵)) ∧ 𝑦 = ⟨𝑏, 𝑤⟩) → ((𝐹 ⊆ (𝐴 × 𝐵) ∧ (𝑥 ∈ 𝐹 ∧ 𝑦 ∈ 𝐹)) → (𝐹:𝐴–1-1→𝐵 → (((2^nd ↾ 𝐹)‘𝑥) = ((2^nd ↾ 𝐹)‘𝑦) → 𝑥 = 𝑦))))
79	78	ex 413	. . . . . . . . . . . . 13 ⊢ ((((𝑎 ∈ 𝐴 ∧ 𝑣 ∈ 𝐵) ∧ 𝑥 = ⟨𝑎, 𝑣⟩) ∧ (𝑏 ∈ 𝐴 ∧ 𝑤 ∈ 𝐵)) → (𝑦 = ⟨𝑏, 𝑤⟩ → ((𝐹 ⊆ (𝐴 × 𝐵) ∧ (𝑥 ∈ 𝐹 ∧ 𝑦 ∈ 𝐹)) → (𝐹:𝐴–1-1→𝐵 → (((2^nd ↾ 𝐹)‘𝑥) = ((2^nd ↾ 𝐹)‘𝑦) → 𝑥 = 𝑦)))))
80	79	rexlimdvva 3211	. . . . . . . . . . . 12 ⊢ (((𝑎 ∈ 𝐴 ∧ 𝑣 ∈ 𝐵) ∧ 𝑥 = ⟨𝑎, 𝑣⟩) → (∃𝑏 ∈ 𝐴 ∃𝑤 ∈ 𝐵 𝑦 = ⟨𝑏, 𝑤⟩ → ((𝐹 ⊆ (𝐴 × 𝐵) ∧ (𝑥 ∈ 𝐹 ∧ 𝑦 ∈ 𝐹)) → (𝐹:𝐴–1-1→𝐵 → (((2^nd ↾ 𝐹)‘𝑥) = ((2^nd ↾ 𝐹)‘𝑦) → 𝑥 = 𝑦)))))
81	80	ex 413	. . . . . . . . . . 11 ⊢ ((𝑎 ∈ 𝐴 ∧ 𝑣 ∈ 𝐵) → (𝑥 = ⟨𝑎, 𝑣⟩ → (∃𝑏 ∈ 𝐴 ∃𝑤 ∈ 𝐵 𝑦 = ⟨𝑏, 𝑤⟩ → ((𝐹 ⊆ (𝐴 × 𝐵) ∧ (𝑥 ∈ 𝐹 ∧ 𝑦 ∈ 𝐹)) → (𝐹:𝐴–1-1→𝐵 → (((2^nd ↾ 𝐹)‘𝑥) = ((2^nd ↾ 𝐹)‘𝑦) → 𝑥 = 𝑦))))))
82	81	rexlimivv 3199	. . . . . . . . . 10 ⊢ (∃𝑎 ∈ 𝐴 ∃𝑣 ∈ 𝐵 𝑥 = ⟨𝑎, 𝑣⟩ → (∃𝑏 ∈ 𝐴 ∃𝑤 ∈ 𝐵 𝑦 = ⟨𝑏, 𝑤⟩ → ((𝐹 ⊆ (𝐴 × 𝐵) ∧ (𝑥 ∈ 𝐹 ∧ 𝑦 ∈ 𝐹)) → (𝐹:𝐴–1-1→𝐵 → (((2^nd ↾ 𝐹)‘𝑥) = ((2^nd ↾ 𝐹)‘𝑦) → 𝑥 = 𝑦)))))
83	82	imp 407	. . . . . . . . 9 ⊢ ((∃𝑎 ∈ 𝐴 ∃𝑣 ∈ 𝐵 𝑥 = ⟨𝑎, 𝑣⟩ ∧ ∃𝑏 ∈ 𝐴 ∃𝑤 ∈ 𝐵 𝑦 = ⟨𝑏, 𝑤⟩) → ((𝐹 ⊆ (𝐴 × 𝐵) ∧ (𝑥 ∈ 𝐹 ∧ 𝑦 ∈ 𝐹)) → (𝐹:𝐴–1-1→𝐵 → (((2^nd ↾ 𝐹)‘𝑥) = ((2^nd ↾ 𝐹)‘𝑦) → 𝑥 = 𝑦))))
84	14, 83	mpcom 38	. . . . . . . 8 ⊢ ((𝐹 ⊆ (𝐴 × 𝐵) ∧ (𝑥 ∈ 𝐹 ∧ 𝑦 ∈ 𝐹)) → (𝐹:𝐴–1-1→𝐵 → (((2^nd ↾ 𝐹)‘𝑥) = ((2^nd ↾ 𝐹)‘𝑦) → 𝑥 = 𝑦)))
85	84	ex 413	. . . . . . 7 ⊢ (𝐹 ⊆ (𝐴 × 𝐵) → ((𝑥 ∈ 𝐹 ∧ 𝑦 ∈ 𝐹) → (𝐹:𝐴–1-1→𝐵 → (((2^nd ↾ 𝐹)‘𝑥) = ((2^nd ↾ 𝐹)‘𝑦) → 𝑥 = 𝑦))))
86	85	com23 86	. . . . . 6 ⊢ (𝐹 ⊆ (𝐴 × 𝐵) → (𝐹:𝐴–1-1→𝐵 → ((𝑥 ∈ 𝐹 ∧ 𝑦 ∈ 𝐹) → (((2^nd ↾ 𝐹)‘𝑥) = ((2^nd ↾ 𝐹)‘𝑦) → 𝑥 = 𝑦))))
87	7, 86	mpcom 38	. . . . 5 ⊢ (𝐹:𝐴–1-1→𝐵 → ((𝑥 ∈ 𝐹 ∧ 𝑦 ∈ 𝐹) → (((2^nd ↾ 𝐹)‘𝑥) = ((2^nd ↾ 𝐹)‘𝑦) → 𝑥 = 𝑦)))
88	87	ralrimivv 3198	. . . 4 ⊢ (𝐹:𝐴–1-1→𝐵 → ∀𝑥 ∈ 𝐹 ∀𝑦 ∈ 𝐹 (((2^nd ↾ 𝐹)‘𝑥) = ((2^nd ↾ 𝐹)‘𝑦) → 𝑥 = 𝑦))
89		dff13 7250	. . . 4 ⊢ ((2^nd ↾ 𝐹):𝐹–1-1→𝐵 ↔ ((2^nd ↾ 𝐹):𝐹⟶𝐵 ∧ ∀𝑥 ∈ 𝐹 ∀𝑦 ∈ 𝐹 (((2^nd ↾ 𝐹)‘𝑥) = ((2^nd ↾ 𝐹)‘𝑦) → 𝑥 = 𝑦)))
90	5, 88, 89	sylanbrc 583	. . 3 ⊢ (𝐹:𝐴–1-1→𝐵 → (2^nd ↾ 𝐹):𝐹–1-1→𝐵)
91		df-f1 6545	. . . 4 ⊢ ((2^nd ↾ 𝐹):𝐹–1-1→𝐵 ↔ ((2^nd ↾ 𝐹):𝐹⟶𝐵 ∧ Fun ^◡(2^nd ↾ 𝐹)))
92	91	simprbi 497	. . 3 ⊢ ((2^nd ↾ 𝐹):𝐹–1-1→𝐵 → Fun ^◡(2^nd ↾ 𝐹))
93	90, 92	syl 17	. 2 ⊢ (𝐹:𝐴–1-1→𝐵 → Fun ^◡(2^nd ↾ 𝐹))
94		dff1o3 6836	. 2 ⊢ ((2^nd ↾ 𝐹):𝐹–1-1-onto→ran 𝐹 ↔ ((2^nd ↾ 𝐹):𝐹–onto→ran 𝐹 ∧ Fun ^◡(2^nd ↾ 𝐹)))
95	3, 93, 94	sylanbrc 583	1 ⊢ (𝐹:𝐴–1-1→𝐵 → (2^nd ↾ 𝐹):𝐹–1-1-onto→ran 𝐹)

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 205 ∧ wa 396 = wceq 1541 ∈ wcel 2106 ∀wral 3061 ∃wrex 3070 ⊆ wss 3947 ⟨cop 4633 × cxp 5673 ^◡ccnv 5674 ran crn 5676 ↾ cres 5677 Fun wfun 6534 ⟶wf 6536 –1-1→wf1 6537 –onto→wfo 6538 –1-1-onto→wf1o 6539 ‘cfv 6540 2^nd c2nd 7970

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 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2703 ax-sep 5298 ax-nul 5305 ax-pr 5426 ax-un 7721

This theorem depends on definitions: df-bi 206 df-an 397 df-or 846 df-3an 1089 df-tru 1544 df-fal 1554 df-ex 1782 df-nf 1786 df-sb 2068 df-mo 2534 df-eu 2563 df-clab 2710 df-cleq 2724 df-clel 2810 df-nfc 2885 df-ne 2941 df-ral 3062 df-rex 3071 df-rab 3433 df-v 3476 df-sbc 3777 df-csb 3893 df-dif 3950 df-un 3952 df-in 3954 df-ss 3964 df-nul 4322 df-if 4528 df-sn 4628 df-pr 4630 df-op 4634 df-uni 4908 df-iun 4998 df-br 5148 df-opab 5210 df-mpt 5231 df-id 5573 df-xp 5681 df-rel 5682 df-cnv 5683 df-co 5684 df-dm 5685 df-rn 5686 df-res 5687 df-ima 5688 df-iota 6492 df-fun 6542 df-fn 6543 df-f 6544 df-f1 6545 df-fo 6546 df-f1o 6547 df-fv 6548 df-2nd 7972

This theorem is referenced by: hashf1rn 14308

W3C validator