fo1stres - Metamath Proof Explorer

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

Theorem fo1stres 8039

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

**Assertion**
Ref	Expression
fo1stres	⊢ (𝐵 ≠ ∅ → (1^st ↾ (𝐴 × 𝐵)):(𝐴 × 𝐵)–onto→𝐴)

Proof of Theorem fo1stres Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		n0 4359	. . . . . . 7 ⊢ (𝐵 ≠ ∅ ↔ ∃𝑦 𝑦 ∈ 𝐵)
2		opelxp 5725	. . . . . . . . . 10 ⊢ (⟨𝑥, 𝑦⟩ ∈ (𝐴 × 𝐵) ↔ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵))
3		fvres 6926	. . . . . . . . . . . 12 ⊢ (⟨𝑥, 𝑦⟩ ∈ (𝐴 × 𝐵) → ((1^st ↾ (𝐴 × 𝐵))‘⟨𝑥, 𝑦⟩) = (1^st ‘⟨𝑥, 𝑦⟩))
4		vex 3482	. . . . . . . . . . . . 13 ⊢ 𝑥 ∈ V
5		vex 3482	. . . . . . . . . . . . 13 ⊢ 𝑦 ∈ V
6	4, 5	op1st 8021	. . . . . . . . . . . 12 ⊢ (1^st ‘⟨𝑥, 𝑦⟩) = 𝑥
7	3, 6	eqtr2di 2792	. . . . . . . . . . 11 ⊢ (⟨𝑥, 𝑦⟩ ∈ (𝐴 × 𝐵) → 𝑥 = ((1^st ↾ (𝐴 × 𝐵))‘⟨𝑥, 𝑦⟩))
8		f1stres 8037	. . . . . . . . . . . . 13 ⊢ (1^st ↾ (𝐴 × 𝐵)):(𝐴 × 𝐵)⟶𝐴
9		ffn 6737	. . . . . . . . . . . . 13 ⊢ ((1^st ↾ (𝐴 × 𝐵)):(𝐴 × 𝐵)⟶𝐴 → (1^st ↾ (𝐴 × 𝐵)) Fn (𝐴 × 𝐵))
10	8, 9	ax-mp 5	. . . . . . . . . . . 12 ⊢ (1^st ↾ (𝐴 × 𝐵)) Fn (𝐴 × 𝐵)
11		fnfvelrn 7100	. . . . . . . . . . . 12 ⊢ (((1^st ↾ (𝐴 × 𝐵)) Fn (𝐴 × 𝐵) ∧ ⟨𝑥, 𝑦⟩ ∈ (𝐴 × 𝐵)) → ((1^st ↾ (𝐴 × 𝐵))‘⟨𝑥, 𝑦⟩) ∈ ran (1^st ↾ (𝐴 × 𝐵)))
12	10, 11	mpan 690	. . . . . . . . . . 11 ⊢ (⟨𝑥, 𝑦⟩ ∈ (𝐴 × 𝐵) → ((1^st ↾ (𝐴 × 𝐵))‘⟨𝑥, 𝑦⟩) ∈ ran (1^st ↾ (𝐴 × 𝐵)))
13	7, 12	eqeltrd 2839	. . . . . . . . . 10 ⊢ (⟨𝑥, 𝑦⟩ ∈ (𝐴 × 𝐵) → 𝑥 ∈ ran (1^st ↾ (𝐴 × 𝐵)))
14	2, 13	sylbir 235	. . . . . . . . 9 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) → 𝑥 ∈ ran (1^st ↾ (𝐴 × 𝐵)))
15	14	expcom 413	. . . . . . . 8 ⊢ (𝑦 ∈ 𝐵 → (𝑥 ∈ 𝐴 → 𝑥 ∈ ran (1^st ↾ (𝐴 × 𝐵))))
16	15	exlimiv 1928	. . . . . . 7 ⊢ (∃𝑦 𝑦 ∈ 𝐵 → (𝑥 ∈ 𝐴 → 𝑥 ∈ ran (1^st ↾ (𝐴 × 𝐵))))
17	1, 16	sylbi 217	. . . . . 6 ⊢ (𝐵 ≠ ∅ → (𝑥 ∈ 𝐴 → 𝑥 ∈ ran (1^st ↾ (𝐴 × 𝐵))))
18	17	ssrdv 4001	. . . . 5 ⊢ (𝐵 ≠ ∅ → 𝐴 ⊆ ran (1^st ↾ (𝐴 × 𝐵)))
19		frn 6744	. . . . . 6 ⊢ ((1^st ↾ (𝐴 × 𝐵)):(𝐴 × 𝐵)⟶𝐴 → ran (1^st ↾ (𝐴 × 𝐵)) ⊆ 𝐴)
20	8, 19	ax-mp 5	. . . . 5 ⊢ ran (1^st ↾ (𝐴 × 𝐵)) ⊆ 𝐴
21	18, 20	jctil 519	. . . 4 ⊢ (𝐵 ≠ ∅ → (ran (1^st ↾ (𝐴 × 𝐵)) ⊆ 𝐴 ∧ 𝐴 ⊆ ran (1^st ↾ (𝐴 × 𝐵))))
22		eqss 4011	. . . 4 ⊢ (ran (1^st ↾ (𝐴 × 𝐵)) = 𝐴 ↔ (ran (1^st ↾ (𝐴 × 𝐵)) ⊆ 𝐴 ∧ 𝐴 ⊆ ran (1^st ↾ (𝐴 × 𝐵))))
23	21, 22	sylibr 234	. . 3 ⊢ (𝐵 ≠ ∅ → ran (1^st ↾ (𝐴 × 𝐵)) = 𝐴)
24	23, 8	jctil 519	. 2 ⊢ (𝐵 ≠ ∅ → ((1^st ↾ (𝐴 × 𝐵)):(𝐴 × 𝐵)⟶𝐴 ∧ ran (1^st ↾ (𝐴 × 𝐵)) = 𝐴))
25		dffo2 6825	. 2 ⊢ ((1^st ↾ (𝐴 × 𝐵)):(𝐴 × 𝐵)–onto→𝐴 ↔ ((1^st ↾ (𝐴 × 𝐵)):(𝐴 × 𝐵)⟶𝐴 ∧ ran (1^st ↾ (𝐴 × 𝐵)) = 𝐴))
26	24, 25	sylibr 234	1 ⊢ (𝐵 ≠ ∅ → (1^st ↾ (𝐴 × 𝐵)):(𝐴 × 𝐵)–onto→𝐴)

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 395 = wceq 1537 ∃wex 1776 ∈ wcel 2106 ≠ wne 2938 ⊆ wss 3963 ∅c0 4339 ⟨cop 4637 × cxp 5687 ran crn 5690 ↾ cres 5691 Fn wfn 6558 ⟶wf 6559 –onto→wfo 6561 ‘cfv 6563 1^st c1st 8011

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1908 ax-6 1965 ax-7 2005 ax-8 2108 ax-9 2116 ax-10 2139 ax-11 2155 ax-12 2175 ax-ext 2706 ax-sep 5302 ax-nul 5312 ax-pr 5438 ax-un 7754

This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1540 df-fal 1550 df-ex 1777 df-nf 1781 df-sb 2063 df-mo 2538 df-eu 2567 df-clab 2713 df-cleq 2727 df-clel 2814 df-nfc 2890 df-ne 2939 df-ral 3060 df-rex 3069 df-rab 3434 df-v 3480 df-sbc 3792 df-csb 3909 df-dif 3966 df-un 3968 df-in 3970 df-ss 3980 df-nul 4340 df-if 4532 df-sn 4632 df-pr 4634 df-op 4638 df-uni 4913 df-iun 4998 df-br 5149 df-opab 5211 df-mpt 5232 df-id 5583 df-xp 5695 df-rel 5696 df-cnv 5697 df-co 5698 df-dm 5699 df-rn 5700 df-res 5701 df-ima 5702 df-iota 6516 df-fun 6565 df-fn 6566 df-f 6567 df-fo 6569 df-fv 6571 df-1st 8013

This theorem is referenced by: 1stconst 8124 txcmpb 23668

W3C validator