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

Theorem fo1stres 7961
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 4306 . . . . . . 7 (𝐵 ≠ ∅ ↔ ∃𝑦 𝑦𝐵)
2 opelxp 5661 . . . . . . . . . 10 (⟨𝑥, 𝑦⟩ ∈ (𝐴 × 𝐵) ↔ (𝑥𝐴𝑦𝐵))
3 fvres 6854 . . . . . . . . . . . 12 (⟨𝑥, 𝑦⟩ ∈ (𝐴 × 𝐵) → ((1st ↾ (𝐴 × 𝐵))‘⟨𝑥, 𝑦⟩) = (1st ‘⟨𝑥, 𝑦⟩))
4 vex 3445 . . . . . . . . . . . . 13 𝑥 ∈ V
5 vex 3445 . . . . . . . . . . . . 13 𝑦 ∈ V
64, 5op1st 7943 . . . . . . . . . . . 12 (1st ‘⟨𝑥, 𝑦⟩) = 𝑥
73, 6eqtr2di 2789 . . . . . . . . . . 11 (⟨𝑥, 𝑦⟩ ∈ (𝐴 × 𝐵) → 𝑥 = ((1st ↾ (𝐴 × 𝐵))‘⟨𝑥, 𝑦⟩))
8 f1stres 7959 . . . . . . . . . . . . 13 (1st ↾ (𝐴 × 𝐵)):(𝐴 × 𝐵)⟶𝐴
9 ffn 6663 . . . . . . . . . . . . 13 ((1st ↾ (𝐴 × 𝐵)):(𝐴 × 𝐵)⟶𝐴 → (1st ↾ (𝐴 × 𝐵)) Fn (𝐴 × 𝐵))
108, 9ax-mp 5 . . . . . . . . . . . 12 (1st ↾ (𝐴 × 𝐵)) Fn (𝐴 × 𝐵)
11 fnfvelrn 7027 . . . . . . . . . . . 12 (((1st ↾ (𝐴 × 𝐵)) Fn (𝐴 × 𝐵) ∧ ⟨𝑥, 𝑦⟩ ∈ (𝐴 × 𝐵)) → ((1st ↾ (𝐴 × 𝐵))‘⟨𝑥, 𝑦⟩) ∈ ran (1st ↾ (𝐴 × 𝐵)))
1210, 11mpan 691 . . . . . . . . . . 11 (⟨𝑥, 𝑦⟩ ∈ (𝐴 × 𝐵) → ((1st ↾ (𝐴 × 𝐵))‘⟨𝑥, 𝑦⟩) ∈ ran (1st ↾ (𝐴 × 𝐵)))
137, 12eqeltrd 2837 . . . . . . . . . 10 (⟨𝑥, 𝑦⟩ ∈ (𝐴 × 𝐵) → 𝑥 ∈ ran (1st ↾ (𝐴 × 𝐵)))
142, 13sylbir 235 . . . . . . . . 9 ((𝑥𝐴𝑦𝐵) → 𝑥 ∈ ran (1st ↾ (𝐴 × 𝐵)))
1514expcom 413 . . . . . . . 8 (𝑦𝐵 → (𝑥𝐴𝑥 ∈ ran (1st ↾ (𝐴 × 𝐵))))
1615exlimiv 1932 . . . . . . 7 (∃𝑦 𝑦𝐵 → (𝑥𝐴𝑥 ∈ ran (1st ↾ (𝐴 × 𝐵))))
171, 16sylbi 217 . . . . . 6 (𝐵 ≠ ∅ → (𝑥𝐴𝑥 ∈ ran (1st ↾ (𝐴 × 𝐵))))
1817ssrdv 3940 . . . . 5 (𝐵 ≠ ∅ → 𝐴 ⊆ ran (1st ↾ (𝐴 × 𝐵)))
19 frn 6670 . . . . . 6 ((1st ↾ (𝐴 × 𝐵)):(𝐴 × 𝐵)⟶𝐴 → ran (1st ↾ (𝐴 × 𝐵)) ⊆ 𝐴)
208, 19ax-mp 5 . . . . 5 ran (1st ↾ (𝐴 × 𝐵)) ⊆ 𝐴
2118, 20jctil 519 . . . 4 (𝐵 ≠ ∅ → (ran (1st ↾ (𝐴 × 𝐵)) ⊆ 𝐴𝐴 ⊆ ran (1st ↾ (𝐴 × 𝐵))))
22 eqss 3950 . . . 4 (ran (1st ↾ (𝐴 × 𝐵)) = 𝐴 ↔ (ran (1st ↾ (𝐴 × 𝐵)) ⊆ 𝐴𝐴 ⊆ ran (1st ↾ (𝐴 × 𝐵))))
2321, 22sylibr 234 . . 3 (𝐵 ≠ ∅ → ran (1st ↾ (𝐴 × 𝐵)) = 𝐴)
2423, 8jctil 519 . 2 (𝐵 ≠ ∅ → ((1st ↾ (𝐴 × 𝐵)):(𝐴 × 𝐵)⟶𝐴 ∧ ran (1st ↾ (𝐴 × 𝐵)) = 𝐴))
25 dffo2 6751 . 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 1542  wex 1781  wcel 2114  wne 2933  wss 3902  c0 4286  cop 4587   × cxp 5623  ran crn 5626  cres 5627   Fn wfn 6488  wf 6489  ontowfo 6491  cfv 6493  1st c1st 7933
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 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-sep 5242  ax-nul 5252  ax-pr 5378  ax-un 7682
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-ral 3053  df-rex 3062  df-rab 3401  df-v 3443  df-sbc 3742  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4287  df-if 4481  df-sn 4582  df-pr 4584  df-op 4588  df-uni 4865  df-iun 4949  df-br 5100  df-opab 5162  df-mpt 5181  df-id 5520  df-xp 5631  df-rel 5632  df-cnv 5633  df-co 5634  df-dm 5635  df-rn 5636  df-res 5637  df-ima 5638  df-iota 6449  df-fun 6495  df-fn 6496  df-f 6497  df-fo 6499  df-fv 6501  df-1st 7935
This theorem is referenced by:  1stconst  8044  txcmpb  23592
  Copyright terms: Public domain W3C validator