Theorem fo2ndres 7943

Description: Onto mapping of a restriction of the 2^nd (second member of an ordered pair) function. (Contributed by NM, 14-Dec-2008.)

Assertion

Ref	Expression
fo2ndres	⊢ (𝐴 ≠ ∅ → (2nd ↾ (𝐴 × 𝐵)):(𝐴 × 𝐵)–onto→𝐵)

Proof of Theorem fo2ndres

Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		n0 4298	. . . . . . 7 ⊢ (𝐴 ≠ ∅ ↔ ∃𝑥 𝑥 ∈ 𝐴)
2		opelxp 5647	. . . . . . . . . 10 ⊢ (⟨𝑥, 𝑦⟩ ∈ (𝐴 × 𝐵) ↔ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵))
3		fvres 6836	. . . . . . . . . . . 12 ⊢ (⟨𝑥, 𝑦⟩ ∈ (𝐴 × 𝐵) → ((2nd ↾ (𝐴 × 𝐵))‘⟨𝑥, 𝑦⟩) = (2nd ‘⟨𝑥, 𝑦⟩))
4		vex 3440	. . . . . . . . . . . . 13 ⊢ 𝑥 ∈ V
5		vex 3440	. . . . . . . . . . . . 13 ⊢ 𝑦 ∈ V
6	4, 5	op2nd 7925	. . . . . . . . . . . 12 ⊢ (2nd ‘⟨𝑥, 𝑦⟩) = 𝑦
7	3, 6	eqtr2di 2783	. . . . . . . . . . 11 ⊢ (⟨𝑥, 𝑦⟩ ∈ (𝐴 × 𝐵) → 𝑦 = ((2nd ↾ (𝐴 × 𝐵))‘⟨𝑥, 𝑦⟩))
8		f2ndres 7941	. . . . . . . . . . . . 13 ⊢ (2nd ↾ (𝐴 × 𝐵)):(𝐴 × 𝐵)⟶𝐵
9		ffn 6646	. . . . . . . . . . . . 13 ⊢ ((2nd ↾ (𝐴 × 𝐵)):(𝐴 × 𝐵)⟶𝐵 → (2nd ↾ (𝐴 × 𝐵)) Fn (𝐴 × 𝐵))
10	8, 9	ax-mp 5	. . . . . . . . . . . 12 ⊢ (2nd ↾ (𝐴 × 𝐵)) Fn (𝐴 × 𝐵)
11		fnfvelrn 7008	. . . . . . . . . . . 12 ⊢ (((2nd ↾ (𝐴 × 𝐵)) Fn (𝐴 × 𝐵) ∧ ⟨𝑥, 𝑦⟩ ∈ (𝐴 × 𝐵)) → ((2nd ↾ (𝐴 × 𝐵))‘⟨𝑥, 𝑦⟩) ∈ ran (2nd ↾ (𝐴 × 𝐵)))
12	10, 11	mpan 690	. . . . . . . . . . 11 ⊢ (⟨𝑥, 𝑦⟩ ∈ (𝐴 × 𝐵) → ((2nd ↾ (𝐴 × 𝐵))‘⟨𝑥, 𝑦⟩) ∈ ran (2nd ↾ (𝐴 × 𝐵)))
13	7, 12	eqeltrd 2831	. . . . . . . . . 10 ⊢ (⟨𝑥, 𝑦⟩ ∈ (𝐴 × 𝐵) → 𝑦 ∈ ran (2nd ↾ (𝐴 × 𝐵)))
14	2, 13	sylbir 235	. . . . . . . . 9 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) → 𝑦 ∈ ran (2nd ↾ (𝐴 × 𝐵)))
15	14	ex 412	. . . . . . . 8 ⊢ (𝑥 ∈ 𝐴 → (𝑦 ∈ 𝐵 → 𝑦 ∈ ran (2nd ↾ (𝐴 × 𝐵))))
16	15	exlimiv 1931	. . . . . . 7 ⊢ (∃𝑥 𝑥 ∈ 𝐴 → (𝑦 ∈ 𝐵 → 𝑦 ∈ ran (2nd ↾ (𝐴 × 𝐵))))
17	1, 16	sylbi 217	. . . . . 6 ⊢ (𝐴 ≠ ∅ → (𝑦 ∈ 𝐵 → 𝑦 ∈ ran (2nd ↾ (𝐴 × 𝐵))))
18	17	ssrdv 3935	. . . . 5 ⊢ (𝐴 ≠ ∅ → 𝐵 ⊆ ran (2nd ↾ (𝐴 × 𝐵)))
19		frn 6653	. . . . . 6 ⊢ ((2nd ↾ (𝐴 × 𝐵)):(𝐴 × 𝐵)⟶𝐵 → ran (2nd ↾ (𝐴 × 𝐵)) ⊆ 𝐵)
20	8, 19	ax-mp 5	. . . . 5 ⊢ ran (2nd ↾ (𝐴 × 𝐵)) ⊆ 𝐵
21	18, 20	jctil 519	. . . 4 ⊢ (𝐴 ≠ ∅ → (ran (2nd ↾ (𝐴 × 𝐵)) ⊆ 𝐵 ∧ 𝐵 ⊆ ran (2nd ↾ (𝐴 × 𝐵))))
22		eqss 3945	. . . 4 ⊢ (ran (2nd ↾ (𝐴 × 𝐵)) = 𝐵 ↔ (ran (2nd ↾ (𝐴 × 𝐵)) ⊆ 𝐵 ∧ 𝐵 ⊆ ran (2nd ↾ (𝐴 × 𝐵))))
23	21, 22	sylibr 234	. . 3 ⊢ (𝐴 ≠ ∅ → ran (2nd ↾ (𝐴 × 𝐵)) = 𝐵)
24	23, 8	jctil 519	. 2 ⊢ (𝐴 ≠ ∅ → ((2nd ↾ (𝐴 × 𝐵)):(𝐴 × 𝐵)⟶𝐵 ∧ ran (2nd ↾ (𝐴 × 𝐵)) = 𝐵))
25		dffo2 6734	. 2 ⊢ ((2nd ↾ (𝐴 × 𝐵)):(𝐴 × 𝐵)–onto→𝐵 ↔ ((2nd ↾ (𝐴 × 𝐵)):(𝐴 × 𝐵)⟶𝐵 ∧ ran (2nd ↾ (𝐴 × 𝐵)) = 𝐵))
26	24, 25	sylibr 234	1 ⊢ (𝐴 ≠ ∅ → (2nd ↾ (𝐴 × 𝐵)):(𝐴 × 𝐵)–onto→𝐵)

Syntax hints:   → wi 4   ∧ wa 395   = wceq 1541  ∃wex 1780   ∈ wcel 2111   ≠ wne 2928   ⊆ wss 3897  ∅c0 4278  ⟨cop 4577   × cxp 5609  ran crn 5612   ↾ cres 5613   Fn wfn 6471  ⟶wf 6472  –onto→wfo 6474  ‘cfv 6476  2^nd c2nd 7915

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2113  ax-9 2121  ax-10 2144  ax-11 2160  ax-12 2180  ax-ext 2703  ax-sep 5229  ax-nul 5239  ax-pr 5365  ax-un 7663

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2535  df-eu 2564  df-clab 2710  df-cleq 2723  df-clel 2806  df-nfc 2881  df-ne 2929  df-ral 3048  df-rex 3057  df-rab 3396  df-v 3438  df-sbc 3737  df-csb 3846  df-dif 3900  df-un 3902  df-in 3904  df-ss 3914  df-nul 4279  df-if 4471  df-sn 4572  df-pr 4574  df-op 4578  df-uni 4855  df-iun 4938  df-br 5087  df-opab 5149  df-mpt 5168  df-id 5506  df-xp 5617  df-rel 5618  df-cnv 5619  df-co 5620  df-dm 5621  df-rn 5622  df-res 5623  df-ima 5624  df-iota 6432  df-fun 6478  df-fn 6479  df-f 6480  df-fo 6482  df-fv 6484  df-2nd 7917

This theorem is referenced by:  2ndconst  8026  txcmpb  23554