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

Theorem gruf 10830
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 1138 . . . 4 ((𝑈 ∈ Univ ∧ 𝐴𝑈𝐹:𝐴𝑈) → 𝐹:𝐴𝑈)
21feqmptd 6952 . . 3 ((𝑈 ∈ Univ ∧ 𝐴𝑈𝐹:𝐴𝑈) → 𝐹 = (𝑥𝐴 ↦ (𝐹𝑥)))
3 fvex 6894 . . . 4 (𝐹𝑥) ∈ V
43fnasrn 7140 . . 3 (𝑥𝐴 ↦ (𝐹𝑥)) = ran (𝑥𝐴 ↦ ⟨𝑥, (𝐹𝑥)⟩)
52, 4eqtrdi 2787 . 2 ((𝑈 ∈ Univ ∧ 𝐴𝑈𝐹:𝐴𝑈) → 𝐹 = ran (𝑥𝐴 ↦ ⟨𝑥, (𝐹𝑥)⟩))
6 simpl1 1192 . . . . 5 (((𝑈 ∈ Univ ∧ 𝐴𝑈𝐹:𝐴𝑈) ∧ 𝑥𝐴) → 𝑈 ∈ Univ)
7 gruel 10822 . . . . . . 7 ((𝑈 ∈ Univ ∧ 𝐴𝑈𝑥𝐴) → 𝑥𝑈)
873expa 1118 . . . . . 6 (((𝑈 ∈ Univ ∧ 𝐴𝑈) ∧ 𝑥𝐴) → 𝑥𝑈)
983adantl3 1169 . . . . 5 (((𝑈 ∈ Univ ∧ 𝐴𝑈𝐹:𝐴𝑈) ∧ 𝑥𝐴) → 𝑥𝑈)
10 ffvelcdm 7076 . . . . . 6 ((𝐹:𝐴𝑈𝑥𝐴) → (𝐹𝑥) ∈ 𝑈)
11103ad2antl3 1188 . . . . 5 (((𝑈 ∈ Univ ∧ 𝐴𝑈𝐹:𝐴𝑈) ∧ 𝑥𝐴) → (𝐹𝑥) ∈ 𝑈)
12 gruop 10824 . . . . 5 ((𝑈 ∈ Univ ∧ 𝑥𝑈 ∧ (𝐹𝑥) ∈ 𝑈) → ⟨𝑥, (𝐹𝑥)⟩ ∈ 𝑈)
136, 9, 11, 12syl3anc 1373 . . . 4 (((𝑈 ∈ Univ ∧ 𝐴𝑈𝐹:𝐴𝑈) ∧ 𝑥𝐴) → ⟨𝑥, (𝐹𝑥)⟩ ∈ 𝑈)
1413fmpttd 7110 . . 3 ((𝑈 ∈ Univ ∧ 𝐴𝑈𝐹:𝐴𝑈) → (𝑥𝐴 ↦ ⟨𝑥, (𝐹𝑥)⟩):𝐴𝑈)
15 grurn 10820 . . 3 ((𝑈 ∈ Univ ∧ 𝐴𝑈 ∧ (𝑥𝐴 ↦ ⟨𝑥, (𝐹𝑥)⟩):𝐴𝑈) → ran (𝑥𝐴 ↦ ⟨𝑥, (𝐹𝑥)⟩) ∈ 𝑈)
1614, 15syld3an3 1411 . 2 ((𝑈 ∈ Univ ∧ 𝐴𝑈𝐹:𝐴𝑈) → ran (𝑥𝐴 ↦ ⟨𝑥, (𝐹𝑥)⟩) ∈ 𝑈)
175, 16eqeltrd 2835 1 ((𝑈 ∈ Univ ∧ 𝐴𝑈𝐹:𝐴𝑈) → 𝐹𝑈)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395  w3a 1086  wcel 2109  cop 4612  cmpt 5206  ran crn 5660  wf 6532  cfv 6536  Univcgru 10809
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2708  ax-sep 5271  ax-nul 5281  ax-pow 5340  ax-pr 5407  ax-un 7734
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2540  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2810  df-nfc 2886  df-ne 2934  df-ral 3053  df-rex 3062  df-reu 3365  df-rab 3421  df-v 3466  df-sbc 3771  df-csb 3880  df-dif 3934  df-un 3936  df-in 3938  df-ss 3948  df-nul 4314  df-if 4506  df-pw 4582  df-sn 4607  df-pr 4609  df-op 4613  df-uni 4889  df-iun 4974  df-br 5125  df-opab 5187  df-mpt 5207  df-tr 5235  df-id 5553  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-res 5671  df-ima 5672  df-iota 6489  df-fun 6538  df-fn 6539  df-f 6540  df-f1 6541  df-fo 6542  df-f1o 6543  df-fv 6544  df-ov 7413  df-oprab 7414  df-mpo 7415  df-map 8847  df-gru 10810
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator