ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  fo1stresm GIF version

Theorem fo1stresm 6368
Description: Onto mapping of a restriction of the 1st (first member of an ordered pair) function. (Contributed by Jim Kingdon, 24-Jan-2019.)
Assertion
Ref Expression
fo1stresm (∃𝑦 𝑦𝐵 → (1st ↾ (𝐴 × 𝐵)):(𝐴 × 𝐵)–onto𝐴)
Distinct variable group:   𝑦,𝐵
Allowed substitution hint:   𝐴(𝑦)

Proof of Theorem fo1stresm
Dummy variables 𝑣 𝑢 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 eleq1 2297 . . 3 (𝑣 = 𝑦 → (𝑣𝐵𝑦𝐵))
21cbvexv 1970 . 2 (∃𝑣 𝑣𝐵 ↔ ∃𝑦 𝑦𝐵)
3 opelxp 4784 . . . . . . . . . 10 (⟨𝑢, 𝑣⟩ ∈ (𝐴 × 𝐵) ↔ (𝑢𝐴𝑣𝐵))
4 fvres 5699 . . . . . . . . . . . 12 (⟨𝑢, 𝑣⟩ ∈ (𝐴 × 𝐵) → ((1st ↾ (𝐴 × 𝐵))‘⟨𝑢, 𝑣⟩) = (1st ‘⟨𝑢, 𝑣⟩))
5 vex 2818 . . . . . . . . . . . . 13 𝑢 ∈ V
6 vex 2818 . . . . . . . . . . . . 13 𝑣 ∈ V
75, 6op1st 6353 . . . . . . . . . . . 12 (1st ‘⟨𝑢, 𝑣⟩) = 𝑢
84, 7eqtr2di 2284 . . . . . . . . . . 11 (⟨𝑢, 𝑣⟩ ∈ (𝐴 × 𝐵) → 𝑢 = ((1st ↾ (𝐴 × 𝐵))‘⟨𝑢, 𝑣⟩))
9 f1stres 6366 . . . . . . . . . . . . 13 (1st ↾ (𝐴 × 𝐵)):(𝐴 × 𝐵)⟶𝐴
10 ffn 5513 . . . . . . . . . . . . 13 ((1st ↾ (𝐴 × 𝐵)):(𝐴 × 𝐵)⟶𝐴 → (1st ↾ (𝐴 × 𝐵)) Fn (𝐴 × 𝐵))
119, 10ax-mp 5 . . . . . . . . . . . 12 (1st ↾ (𝐴 × 𝐵)) Fn (𝐴 × 𝐵)
12 fnfvelrn 5814 . . . . . . . . . . . 12 (((1st ↾ (𝐴 × 𝐵)) Fn (𝐴 × 𝐵) ∧ ⟨𝑢, 𝑣⟩ ∈ (𝐴 × 𝐵)) → ((1st ↾ (𝐴 × 𝐵))‘⟨𝑢, 𝑣⟩) ∈ ran (1st ↾ (𝐴 × 𝐵)))
1311, 12mpan 424 . . . . . . . . . . 11 (⟨𝑢, 𝑣⟩ ∈ (𝐴 × 𝐵) → ((1st ↾ (𝐴 × 𝐵))‘⟨𝑢, 𝑣⟩) ∈ ran (1st ↾ (𝐴 × 𝐵)))
148, 13eqeltrd 2311 . . . . . . . . . 10 (⟨𝑢, 𝑣⟩ ∈ (𝐴 × 𝐵) → 𝑢 ∈ ran (1st ↾ (𝐴 × 𝐵)))
153, 14sylbir 135 . . . . . . . . 9 ((𝑢𝐴𝑣𝐵) → 𝑢 ∈ ran (1st ↾ (𝐴 × 𝐵)))
1615expcom 116 . . . . . . . 8 (𝑣𝐵 → (𝑢𝐴𝑢 ∈ ran (1st ↾ (𝐴 × 𝐵))))
1716exlimiv 1647 . . . . . . 7 (∃𝑣 𝑣𝐵 → (𝑢𝐴𝑢 ∈ ran (1st ↾ (𝐴 × 𝐵))))
1817ssrdv 3248 . . . . . 6 (∃𝑣 𝑣𝐵𝐴 ⊆ ran (1st ↾ (𝐴 × 𝐵)))
19 frn 5522 . . . . . . 7 ((1st ↾ (𝐴 × 𝐵)):(𝐴 × 𝐵)⟶𝐴 → ran (1st ↾ (𝐴 × 𝐵)) ⊆ 𝐴)
209, 19ax-mp 5 . . . . . 6 ran (1st ↾ (𝐴 × 𝐵)) ⊆ 𝐴
2118, 20jctil 312 . . . . 5 (∃𝑣 𝑣𝐵 → (ran (1st ↾ (𝐴 × 𝐵)) ⊆ 𝐴𝐴 ⊆ ran (1st ↾ (𝐴 × 𝐵))))
22 eqss 3257 . . . . 5 (ran (1st ↾ (𝐴 × 𝐵)) = 𝐴 ↔ (ran (1st ↾ (𝐴 × 𝐵)) ⊆ 𝐴𝐴 ⊆ ran (1st ↾ (𝐴 × 𝐵))))
2321, 22sylibr 134 . . . 4 (∃𝑣 𝑣𝐵 → ran (1st ↾ (𝐴 × 𝐵)) = 𝐴)
2423, 9jctil 312 . . 3 (∃𝑣 𝑣𝐵 → ((1st ↾ (𝐴 × 𝐵)):(𝐴 × 𝐵)⟶𝐴 ∧ ran (1st ↾ (𝐴 × 𝐵)) = 𝐴))
25 dffo2 5599 . . 3 ((1st ↾ (𝐴 × 𝐵)):(𝐴 × 𝐵)–onto𝐴 ↔ ((1st ↾ (𝐴 × 𝐵)):(𝐴 × 𝐵)⟶𝐴 ∧ ran (1st ↾ (𝐴 × 𝐵)) = 𝐴))
2624, 25sylibr 134 . 2 (∃𝑣 𝑣𝐵 → (1st ↾ (𝐴 × 𝐵)):(𝐴 × 𝐵)–onto𝐴)
272, 26sylbir 135 1 (∃𝑦 𝑦𝐵 → (1st ↾ (𝐴 × 𝐵)):(𝐴 × 𝐵)–onto𝐴)
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104   = wceq 1398  wex 1541  wcel 2205  wss 3214  cop 3697   × cxp 4752  ran crn 4755  cres 4756   Fn wfn 5352  wf 5353  ontowfo 5355  cfv 5357  1st c1st 6345
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2207  ax-14 2208  ax-ext 2216  ax-sep 4233  ax-pow 4292  ax-pr 4327  ax-un 4559
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1812  df-eu 2085  df-mo 2086  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ral 2527  df-rex 2528  df-rab 2531  df-v 2817  df-sbc 3046  df-csb 3142  df-un 3218  df-in 3220  df-ss 3227  df-pw 3676  df-sn 3700  df-pr 3701  df-op 3703  df-uni 3920  df-iun 3998  df-br 4115  df-opab 4177  df-mpt 4178  df-id 4419  df-xp 4760  df-rel 4761  df-cnv 4762  df-co 4763  df-dm 4764  df-rn 4765  df-res 4766  df-ima 4767  df-iota 5317  df-fun 5359  df-fn 5360  df-f 5361  df-fo 5363  df-fv 5365  df-1st 6347
This theorem is referenced by:  1stconst  6430
  Copyright terms: Public domain W3C validator