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

Theorem gruf 10726
Description: A Grothendieck universe contains all functions on its elements. (Contributed by Mario Carneiro, 10-Jun-2013.)
Assertion
Ref Expression
gruf ((𝑈 ∈ Univ ∧ 𝐴𝑈𝐹:𝐴𝑈) → 𝐹𝑈)

Proof of Theorem gruf
Dummy variable 𝑥 is distinct from all other variables.
StepHypRef Expression
1 simp3 1144 . . . 4 ((𝑈 ∈ Univ ∧ 𝐴𝑈𝐹:𝐴𝑈) → 𝐹:𝐴𝑈)
21feqmptd 6896 . . 3 ((𝑈 ∈ Univ ∧ 𝐴𝑈𝐹:𝐴𝑈) → 𝐹 = (𝑥𝐴 ↦ (𝐹𝑥)))
3 fvex 6841 . . . 4 (𝐹𝑥) ∈ V
43fnasrn 7088 . . 3 (𝑥𝐴 ↦ (𝐹𝑥)) = ran (𝑥𝐴 ↦ ⟨𝑥, (𝐹𝑥)⟩)
52, 4eqtrdi 2790 . 2 ((𝑈 ∈ Univ ∧ 𝐴𝑈𝐹:𝐴𝑈) → 𝐹 = ran (𝑥𝐴 ↦ ⟨𝑥, (𝐹𝑥)⟩))
6 simpl1 1198 . . . . 5 (((𝑈 ∈ Univ ∧ 𝐴𝑈𝐹:𝐴𝑈) ∧ 𝑥𝐴) → 𝑈 ∈ Univ)
7 gruel 10718 . . . . . . 7 ((𝑈 ∈ Univ ∧ 𝐴𝑈𝑥𝐴) → 𝑥𝑈)
873expa 1124 . . . . . 6 (((𝑈 ∈ Univ ∧ 𝐴𝑈) ∧ 𝑥𝐴) → 𝑥𝑈)
983adantl3 1175 . . . . 5 (((𝑈 ∈ Univ ∧ 𝐴𝑈𝐹:𝐴𝑈) ∧ 𝑥𝐴) → 𝑥𝑈)
10 ffvelcdm 7023 . . . . . 6 ((𝐹:𝐴𝑈𝑥𝐴) → (𝐹𝑥) ∈ 𝑈)
11103ad2antl3 1194 . . . . 5 (((𝑈 ∈ Univ ∧ 𝐴𝑈𝐹:𝐴𝑈) ∧ 𝑥𝐴) → (𝐹𝑥) ∈ 𝑈)
12 gruop 10720 . . . . 5 ((𝑈 ∈ Univ ∧ 𝑥𝑈 ∧ (𝐹𝑥) ∈ 𝑈) → ⟨𝑥, (𝐹𝑥)⟩ ∈ 𝑈)
136, 9, 11, 12syl3anc 1379 . . . 4 (((𝑈 ∈ Univ ∧ 𝐴𝑈𝐹:𝐴𝑈) ∧ 𝑥𝐴) → ⟨𝑥, (𝐹𝑥)⟩ ∈ 𝑈)
1413fmpttd 7057 . . 3 ((𝑈 ∈ Univ ∧ 𝐴𝑈𝐹:𝐴𝑈) → (𝑥𝐴 ↦ ⟨𝑥, (𝐹𝑥)⟩):𝐴𝑈)
15 grurn 10716 . . 3 ((𝑈 ∈ Univ ∧ 𝐴𝑈 ∧ (𝑥𝐴 ↦ ⟨𝑥, (𝐹𝑥)⟩):𝐴𝑈) → ran (𝑥𝐴 ↦ ⟨𝑥, (𝐹𝑥)⟩) ∈ 𝑈)
1614, 15syld3an3 1417 . 2 ((𝑈 ∈ Univ ∧ 𝐴𝑈𝐹:𝐴𝑈) → ran (𝑥𝐴 ↦ ⟨𝑥, (𝐹𝑥)⟩) ∈ 𝑈)
175, 16eqeltrd 2839 1 ((𝑈 ∈ Univ ∧ 𝐴𝑈𝐹:𝐴𝑈) → 𝐹𝑈)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 396  w3a 1092  wcel 2119  cop 4562  cmpt 5154  ran crn 5620  wf 6482  cfv 6486  Univcgru 10705
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1974  ax-7 2015  ax-8 2121  ax-9 2129  ax-10 2152  ax-11 2168  ax-12 2189  ax-ext 2711  ax-sep 5219  ax-nul 5229  ax-pow 5295  ax-pr 5363  ax-un 7679
This theorem depends on definitions:  df-bi 208  df-an 397  df-or 854  df-3an 1094  df-tru 1550  df-fal 1560  df-ex 1787  df-nf 1791  df-sb 2074  df-mo 2543  df-eu 2573  df-clab 2718  df-cleq 2731  df-clel 2814  df-nfc 2888  df-ne 2935  df-ral 3054  df-rex 3064  df-reu 3345  df-rab 3392  df-v 3433  df-sbc 3724  df-csb 3832  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-nul 4263  df-if 4456  df-pw 4532  df-sn 4557  df-pr 4559  df-op 4563  df-uni 4840  df-iun 4924  df-br 5074  df-opab 5136  df-mpt 5155  df-tr 5181  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 6442  df-fun 6488  df-fn 6489  df-f 6490  df-f1 6491  df-fo 6492  df-f1o 6493  df-fv 6494  df-ov 7360  df-oprab 7361  df-mpo 7362  df-map 8766  df-gru 10706
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator