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

Theorem fo1stres 7720
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 4246 . . . . . . 7 (𝐵 ≠ ∅ ↔ ∃𝑦 𝑦𝐵)
2 opelxp 5561 . . . . . . . . . 10 (⟨𝑥, 𝑦⟩ ∈ (𝐴 × 𝐵) ↔ (𝑥𝐴𝑦𝐵))
3 fvres 6678 . . . . . . . . . . . 12 (⟨𝑥, 𝑦⟩ ∈ (𝐴 × 𝐵) → ((1st ↾ (𝐴 × 𝐵))‘⟨𝑥, 𝑦⟩) = (1st ‘⟨𝑥, 𝑦⟩))
4 vex 3414 . . . . . . . . . . . . 13 𝑥 ∈ V
5 vex 3414 . . . . . . . . . . . . 13 𝑦 ∈ V
64, 5op1st 7702 . . . . . . . . . . . 12 (1st ‘⟨𝑥, 𝑦⟩) = 𝑥
73, 6eqtr2di 2811 . . . . . . . . . . 11 (⟨𝑥, 𝑦⟩ ∈ (𝐴 × 𝐵) → 𝑥 = ((1st ↾ (𝐴 × 𝐵))‘⟨𝑥, 𝑦⟩))
8 f1stres 7718 . . . . . . . . . . . . 13 (1st ↾ (𝐴 × 𝐵)):(𝐴 × 𝐵)⟶𝐴
9 ffn 6499 . . . . . . . . . . . . 13 ((1st ↾ (𝐴 × 𝐵)):(𝐴 × 𝐵)⟶𝐴 → (1st ↾ (𝐴 × 𝐵)) Fn (𝐴 × 𝐵))
108, 9ax-mp 5 . . . . . . . . . . . 12 (1st ↾ (𝐴 × 𝐵)) Fn (𝐴 × 𝐵)
11 fnfvelrn 6840 . . . . . . . . . . . 12 (((1st ↾ (𝐴 × 𝐵)) Fn (𝐴 × 𝐵) ∧ ⟨𝑥, 𝑦⟩ ∈ (𝐴 × 𝐵)) → ((1st ↾ (𝐴 × 𝐵))‘⟨𝑥, 𝑦⟩) ∈ ran (1st ↾ (𝐴 × 𝐵)))
1210, 11mpan 690 . . . . . . . . . . 11 (⟨𝑥, 𝑦⟩ ∈ (𝐴 × 𝐵) → ((1st ↾ (𝐴 × 𝐵))‘⟨𝑥, 𝑦⟩) ∈ ran (1st ↾ (𝐴 × 𝐵)))
137, 12eqeltrd 2853 . . . . . . . . . 10 (⟨𝑥, 𝑦⟩ ∈ (𝐴 × 𝐵) → 𝑥 ∈ ran (1st ↾ (𝐴 × 𝐵)))
142, 13sylbir 238 . . . . . . . . 9 ((𝑥𝐴𝑦𝐵) → 𝑥 ∈ ran (1st ↾ (𝐴 × 𝐵)))
1514expcom 418 . . . . . . . 8 (𝑦𝐵 → (𝑥𝐴𝑥 ∈ ran (1st ↾ (𝐴 × 𝐵))))
1615exlimiv 1932 . . . . . . 7 (∃𝑦 𝑦𝐵 → (𝑥𝐴𝑥 ∈ ran (1st ↾ (𝐴 × 𝐵))))
171, 16sylbi 220 . . . . . 6 (𝐵 ≠ ∅ → (𝑥𝐴𝑥 ∈ ran (1st ↾ (𝐴 × 𝐵))))
1817ssrdv 3899 . . . . 5 (𝐵 ≠ ∅ → 𝐴 ⊆ ran (1st ↾ (𝐴 × 𝐵)))
19 frn 6505 . . . . . 6 ((1st ↾ (𝐴 × 𝐵)):(𝐴 × 𝐵)⟶𝐴 → ran (1st ↾ (𝐴 × 𝐵)) ⊆ 𝐴)
208, 19ax-mp 5 . . . . 5 ran (1st ↾ (𝐴 × 𝐵)) ⊆ 𝐴
2118, 20jctil 524 . . . 4 (𝐵 ≠ ∅ → (ran (1st ↾ (𝐴 × 𝐵)) ⊆ 𝐴𝐴 ⊆ ran (1st ↾ (𝐴 × 𝐵))))
22 eqss 3908 . . . 4 (ran (1st ↾ (𝐴 × 𝐵)) = 𝐴 ↔ (ran (1st ↾ (𝐴 × 𝐵)) ⊆ 𝐴𝐴 ⊆ ran (1st ↾ (𝐴 × 𝐵))))
2321, 22sylibr 237 . . 3 (𝐵 ≠ ∅ → ran (1st ↾ (𝐴 × 𝐵)) = 𝐴)
2423, 8jctil 524 . 2 (𝐵 ≠ ∅ → ((1st ↾ (𝐴 × 𝐵)):(𝐴 × 𝐵)⟶𝐴 ∧ ran (1st ↾ (𝐴 × 𝐵)) = 𝐴))
25 dffo2 6581 . 2 ((1st ↾ (𝐴 × 𝐵)):(𝐴 × 𝐵)–onto𝐴 ↔ ((1st ↾ (𝐴 × 𝐵)):(𝐴 × 𝐵)⟶𝐴 ∧ ran (1st ↾ (𝐴 × 𝐵)) = 𝐴))
2624, 25sylibr 237 1 (𝐵 ≠ ∅ → (1st ↾ (𝐴 × 𝐵)):(𝐴 × 𝐵)–onto𝐴)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 400   = wceq 1539  wex 1782  wcel 2112  wne 2952  wss 3859  c0 4226  cop 4529   × cxp 5523  ran crn 5526  cres 5527   Fn wfn 6331  wf 6332  ontowfo 6334  cfv 6336  1st c1st 7692
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1912  ax-6 1971  ax-7 2016  ax-8 2114  ax-9 2122  ax-10 2143  ax-11 2159  ax-12 2176  ax-ext 2730  ax-sep 5170  ax-nul 5177  ax-pr 5299  ax-un 7460
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 846  df-3an 1087  df-tru 1542  df-fal 1552  df-ex 1783  df-nf 1787  df-sb 2071  df-mo 2558  df-eu 2589  df-clab 2737  df-cleq 2751  df-clel 2831  df-nfc 2902  df-ne 2953  df-ral 3076  df-rex 3077  df-rab 3080  df-v 3412  df-sbc 3698  df-csb 3807  df-dif 3862  df-un 3864  df-in 3866  df-ss 3876  df-nul 4227  df-if 4422  df-sn 4524  df-pr 4526  df-op 4530  df-uni 4800  df-iun 4886  df-br 5034  df-opab 5096  df-mpt 5114  df-id 5431  df-xp 5531  df-rel 5532  df-cnv 5533  df-co 5534  df-dm 5535  df-rn 5536  df-res 5537  df-ima 5538  df-iota 6295  df-fun 6338  df-fn 6339  df-f 6340  df-fo 6342  df-fv 6344  df-1st 7694
This theorem is referenced by:  1stconst  7801  txcmpb  22337
  Copyright terms: Public domain W3C validator