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

Theorem fo1stres 7953
Description: Onto mapping of a restriction of the 1st (first member of an ordered pair) function. (Contributed by NM, 14-Dec-2008.)
Assertion
Ref Expression
fo1stres (𝐵 ≠ ∅ → (1st ↾ (𝐴 × 𝐵)):(𝐴 × 𝐵)–onto𝐴)

Proof of Theorem fo1stres
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 n0 4302 . . . . . . 7 (𝐵 ≠ ∅ ↔ ∃𝑦 𝑦𝐵)
2 opelxp 5655 . . . . . . . . . 10 (⟨𝑥, 𝑦⟩ ∈ (𝐴 × 𝐵) ↔ (𝑥𝐴𝑦𝐵))
3 fvres 6847 . . . . . . . . . . . 12 (⟨𝑥, 𝑦⟩ ∈ (𝐴 × 𝐵) → ((1st ↾ (𝐴 × 𝐵))‘⟨𝑥, 𝑦⟩) = (1st ‘⟨𝑥, 𝑦⟩))
4 vex 3440 . . . . . . . . . . . . 13 𝑥 ∈ V
5 vex 3440 . . . . . . . . . . . . 13 𝑦 ∈ V
64, 5op1st 7935 . . . . . . . . . . . 12 (1st ‘⟨𝑥, 𝑦⟩) = 𝑥
73, 6eqtr2di 2783 . . . . . . . . . . 11 (⟨𝑥, 𝑦⟩ ∈ (𝐴 × 𝐵) → 𝑥 = ((1st ↾ (𝐴 × 𝐵))‘⟨𝑥, 𝑦⟩))
8 f1stres 7951 . . . . . . . . . . . . 13 (1st ↾ (𝐴 × 𝐵)):(𝐴 × 𝐵)⟶𝐴
9 ffn 6657 . . . . . . . . . . . . 13 ((1st ↾ (𝐴 × 𝐵)):(𝐴 × 𝐵)⟶𝐴 → (1st ↾ (𝐴 × 𝐵)) Fn (𝐴 × 𝐵))
108, 9ax-mp 5 . . . . . . . . . . . 12 (1st ↾ (𝐴 × 𝐵)) Fn (𝐴 × 𝐵)
11 fnfvelrn 7019 . . . . . . . . . . . 12 (((1st ↾ (𝐴 × 𝐵)) Fn (𝐴 × 𝐵) ∧ ⟨𝑥, 𝑦⟩ ∈ (𝐴 × 𝐵)) → ((1st ↾ (𝐴 × 𝐵))‘⟨𝑥, 𝑦⟩) ∈ ran (1st ↾ (𝐴 × 𝐵)))
1210, 11mpan 690 . . . . . . . . . . 11 (⟨𝑥, 𝑦⟩ ∈ (𝐴 × 𝐵) → ((1st ↾ (𝐴 × 𝐵))‘⟨𝑥, 𝑦⟩) ∈ ran (1st ↾ (𝐴 × 𝐵)))
137, 12eqeltrd 2831 . . . . . . . . . 10 (⟨𝑥, 𝑦⟩ ∈ (𝐴 × 𝐵) → 𝑥 ∈ ran (1st ↾ (𝐴 × 𝐵)))
142, 13sylbir 235 . . . . . . . . 9 ((𝑥𝐴𝑦𝐵) → 𝑥 ∈ ran (1st ↾ (𝐴 × 𝐵)))
1514expcom 413 . . . . . . . 8 (𝑦𝐵 → (𝑥𝐴𝑥 ∈ ran (1st ↾ (𝐴 × 𝐵))))
1615exlimiv 1931 . . . . . . 7 (∃𝑦 𝑦𝐵 → (𝑥𝐴𝑥 ∈ ran (1st ↾ (𝐴 × 𝐵))))
171, 16sylbi 217 . . . . . 6 (𝐵 ≠ ∅ → (𝑥𝐴𝑥 ∈ ran (1st ↾ (𝐴 × 𝐵))))
1817ssrdv 3935 . . . . 5 (𝐵 ≠ ∅ → 𝐴 ⊆ ran (1st ↾ (𝐴 × 𝐵)))
19 frn 6664 . . . . . 6 ((1st ↾ (𝐴 × 𝐵)):(𝐴 × 𝐵)⟶𝐴 → ran (1st ↾ (𝐴 × 𝐵)) ⊆ 𝐴)
208, 19ax-mp 5 . . . . 5 ran (1st ↾ (𝐴 × 𝐵)) ⊆ 𝐴
2118, 20jctil 519 . . . 4 (𝐵 ≠ ∅ → (ran (1st ↾ (𝐴 × 𝐵)) ⊆ 𝐴𝐴 ⊆ ran (1st ↾ (𝐴 × 𝐵))))
22 eqss 3945 . . . 4 (ran (1st ↾ (𝐴 × 𝐵)) = 𝐴 ↔ (ran (1st ↾ (𝐴 × 𝐵)) ⊆ 𝐴𝐴 ⊆ ran (1st ↾ (𝐴 × 𝐵))))
2321, 22sylibr 234 . . 3 (𝐵 ≠ ∅ → ran (1st ↾ (𝐴 × 𝐵)) = 𝐴)
2423, 8jctil 519 . 2 (𝐵 ≠ ∅ → ((1st ↾ (𝐴 × 𝐵)):(𝐴 × 𝐵)⟶𝐴 ∧ ran (1st ↾ (𝐴 × 𝐵)) = 𝐴))
25 dffo2 6745 . 2 ((1st ↾ (𝐴 × 𝐵)):(𝐴 × 𝐵)–onto𝐴 ↔ ((1st ↾ (𝐴 × 𝐵)):(𝐴 × 𝐵)⟶𝐴 ∧ ran (1st ↾ (𝐴 × 𝐵)) = 𝐴))
2624, 25sylibr 234 1 (𝐵 ≠ ∅ → (1st ↾ (𝐴 × 𝐵)):(𝐴 × 𝐵)–onto𝐴)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395   = wceq 1541  wex 1780  wcel 2111  wne 2928  wss 3897  c0 4282  cop 4581   × cxp 5617  ran crn 5620  cres 5621   Fn wfn 6482  wf 6483  ontowfo 6485  cfv 6487  1st c1st 7925
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 5236  ax-nul 5246  ax-pr 5372  ax-un 7674
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 4283  df-if 4475  df-sn 4576  df-pr 4578  df-op 4582  df-uni 4859  df-iun 4943  df-br 5094  df-opab 5156  df-mpt 5175  df-id 5514  df-xp 5625  df-rel 5626  df-cnv 5627  df-co 5628  df-dm 5629  df-rn 5630  df-res 5631  df-ima 5632  df-iota 6443  df-fun 6489  df-fn 6490  df-f 6491  df-fo 6493  df-fv 6495  df-1st 7927
This theorem is referenced by:  1stconst  8036  txcmpb  23565
  Copyright terms: Public domain W3C validator