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

Theorem gruf 10796
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 1154 . . . 4 ((𝑈 ∈ Univ ∧ 𝐴𝑈𝐹:𝐴𝑈) → 𝐹:𝐴𝑈)
21feqmptd 6950 . . 3 ((𝑈 ∈ Univ ∧ 𝐴𝑈𝐹:𝐴𝑈) → 𝐹 = (𝑥𝐴 ↦ (𝐹𝑥)))
3 fvex 6895 . . . 4 (𝐹𝑥) ∈ V
43fnasrn 7142 . . 3 (𝑥𝐴 ↦ (𝐹𝑥)) = ran (𝑥𝐴 ↦ ⟨𝑥, (𝐹𝑥)⟩)
52, 4eqtrdi 2820 . 2 ((𝑈 ∈ Univ ∧ 𝐴𝑈𝐹:𝐴𝑈) → 𝐹 = ran (𝑥𝐴 ↦ ⟨𝑥, (𝐹𝑥)⟩))
6 simpl1 1208 . . . . 5 (((𝑈 ∈ Univ ∧ 𝐴𝑈𝐹:𝐴𝑈) ∧ 𝑥𝐴) → 𝑈 ∈ Univ)
7 gruel 10788 . . . . . . 7 ((𝑈 ∈ Univ ∧ 𝐴𝑈𝑥𝐴) → 𝑥𝑈)
873expa 1134 . . . . . 6 (((𝑈 ∈ Univ ∧ 𝐴𝑈) ∧ 𝑥𝐴) → 𝑥𝑈)
983adantl3 1185 . . . . 5 (((𝑈 ∈ Univ ∧ 𝐴𝑈𝐹:𝐴𝑈) ∧ 𝑥𝐴) → 𝑥𝑈)
10 ffvelcdm 7077 . . . . . 6 ((𝐹:𝐴𝑈𝑥𝐴) → (𝐹𝑥) ∈ 𝑈)
11103ad2antl3 1204 . . . . 5 (((𝑈 ∈ Univ ∧ 𝐴𝑈𝐹:𝐴𝑈) ∧ 𝑥𝐴) → (𝐹𝑥) ∈ 𝑈)
12 gruop 10790 . . . . 5 ((𝑈 ∈ Univ ∧ 𝑥𝑈 ∧ (𝐹𝑥) ∈ 𝑈) → ⟨𝑥, (𝐹𝑥)⟩ ∈ 𝑈)
136, 9, 11, 12syl3anc 1396 . . . 4 (((𝑈 ∈ Univ ∧ 𝐴𝑈𝐹:𝐴𝑈) ∧ 𝑥𝐴) → ⟨𝑥, (𝐹𝑥)⟩ ∈ 𝑈)
1413fmpttd 7111 . . 3 ((𝑈 ∈ Univ ∧ 𝐴𝑈𝐹:𝐴𝑈) → (𝑥𝐴 ↦ ⟨𝑥, (𝐹𝑥)⟩):𝐴𝑈)
15 grurn 10786 . . 3 ((𝑈 ∈ Univ ∧ 𝐴𝑈 ∧ (𝑥𝐴 ↦ ⟨𝑥, (𝐹𝑥)⟩):𝐴𝑈) → ran (𝑥𝐴 ↦ ⟨𝑥, (𝐹𝑥)⟩) ∈ 𝑈)
1614, 15syld3an3 1434 . 2 ((𝑈 ∈ Univ ∧ 𝐴𝑈𝐹:𝐴𝑈) → ran (𝑥𝐴 ↦ ⟨𝑥, (𝐹𝑥)⟩) ∈ 𝑈)
175, 16eqeltrd 2869 1 ((𝑈 ∈ Univ ∧ 𝐴𝑈𝐹:𝐴𝑈) → 𝐹𝑈)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 400  w3a 1101  wcel 2149  cop 4600  cmpt 5196  ran crn 5663  wf 6533  cfv 6537  Univcgru 10775
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1822  ax-4 1836  ax-5 1937  ax-6 1994  ax-7 2035  ax-8 2151  ax-9 2159  ax-10 2182  ax-11 2198  ax-12 2219  ax-ext 2741  ax-sep 5261  ax-nul 5271  ax-pow 5337  ax-pr 5405  ax-un 7733
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1103  df-tru 1570  df-fal 1580  df-ex 1807  df-nf 1811  df-sb 2098  df-mo 2573  df-eu 2603  df-clab 2748  df-cleq 2761  df-clel 2844  df-nfc 2918  df-ne 2965  df-ral 3086  df-rex 3096  df-reu 3377  df-rab 3424  df-v 3465  df-sbc 3754  df-csb 3862  df-dif 3916  df-un 3918  df-in 3920  df-ss 3930  df-nul 4295  df-if 4493  df-pw 4569  df-sn 4595  df-pr 4597  df-op 4601  df-uni 4877  df-iun 4962  df-br 5114  df-opab 5178  df-mpt 5197  df-tr 5223  df-id 5557  df-xp 5668  df-rel 5669  df-cnv 5670  df-co 5671  df-dm 5672  df-rn 5673  df-res 5674  df-ima 5675  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-ov 7414  df-oprab 7415  df-mpo 7416  df-map 8826  df-gru 10776
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator