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

Theorem gruf 10734
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 1139 . . . 4 ((𝑈 ∈ Univ ∧ 𝐴𝑈𝐹:𝐴𝑈) → 𝐹:𝐴𝑈)
21feqmptd 6910 . . 3 ((𝑈 ∈ Univ ∧ 𝐴𝑈𝐹:𝐴𝑈) → 𝐹 = (𝑥𝐴 ↦ (𝐹𝑥)))
3 fvex 6855 . . . 4 (𝐹𝑥) ∈ V
43fnasrn 7100 . . 3 (𝑥𝐴 ↦ (𝐹𝑥)) = ran (𝑥𝐴 ↦ ⟨𝑥, (𝐹𝑥)⟩)
52, 4eqtrdi 2788 . 2 ((𝑈 ∈ Univ ∧ 𝐴𝑈𝐹:𝐴𝑈) → 𝐹 = ran (𝑥𝐴 ↦ ⟨𝑥, (𝐹𝑥)⟩))
6 simpl1 1193 . . . . 5 (((𝑈 ∈ Univ ∧ 𝐴𝑈𝐹:𝐴𝑈) ∧ 𝑥𝐴) → 𝑈 ∈ Univ)
7 gruel 10726 . . . . . . 7 ((𝑈 ∈ Univ ∧ 𝐴𝑈𝑥𝐴) → 𝑥𝑈)
873expa 1119 . . . . . 6 (((𝑈 ∈ Univ ∧ 𝐴𝑈) ∧ 𝑥𝐴) → 𝑥𝑈)
983adantl3 1170 . . . . 5 (((𝑈 ∈ Univ ∧ 𝐴𝑈𝐹:𝐴𝑈) ∧ 𝑥𝐴) → 𝑥𝑈)
10 ffvelcdm 7035 . . . . . 6 ((𝐹:𝐴𝑈𝑥𝐴) → (𝐹𝑥) ∈ 𝑈)
11103ad2antl3 1189 . . . . 5 (((𝑈 ∈ Univ ∧ 𝐴𝑈𝐹:𝐴𝑈) ∧ 𝑥𝐴) → (𝐹𝑥) ∈ 𝑈)
12 gruop 10728 . . . . 5 ((𝑈 ∈ Univ ∧ 𝑥𝑈 ∧ (𝐹𝑥) ∈ 𝑈) → ⟨𝑥, (𝐹𝑥)⟩ ∈ 𝑈)
136, 9, 11, 12syl3anc 1374 . . . 4 (((𝑈 ∈ Univ ∧ 𝐴𝑈𝐹:𝐴𝑈) ∧ 𝑥𝐴) → ⟨𝑥, (𝐹𝑥)⟩ ∈ 𝑈)
1413fmpttd 7069 . . 3 ((𝑈 ∈ Univ ∧ 𝐴𝑈𝐹:𝐴𝑈) → (𝑥𝐴 ↦ ⟨𝑥, (𝐹𝑥)⟩):𝐴𝑈)
15 grurn 10724 . . 3 ((𝑈 ∈ Univ ∧ 𝐴𝑈 ∧ (𝑥𝐴 ↦ ⟨𝑥, (𝐹𝑥)⟩):𝐴𝑈) → ran (𝑥𝐴 ↦ ⟨𝑥, (𝐹𝑥)⟩) ∈ 𝑈)
1614, 15syld3an3 1412 . 2 ((𝑈 ∈ Univ ∧ 𝐴𝑈𝐹:𝐴𝑈) → ran (𝑥𝐴 ↦ ⟨𝑥, (𝐹𝑥)⟩) ∈ 𝑈)
175, 16eqeltrd 2837 1 ((𝑈 ∈ Univ ∧ 𝐴𝑈𝐹:𝐴𝑈) → 𝐹𝑈)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395  w3a 1087  wcel 2114  cop 4588  cmpt 5181  ran crn 5633  wf 6496  cfv 6500  Univcgru 10713
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 5243  ax-nul 5253  ax-pow 5312  ax-pr 5379  ax-un 7690
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 3063  df-reu 3353  df-rab 3402  df-v 3444  df-sbc 3743  df-csb 3852  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-nul 4288  df-if 4482  df-pw 4558  df-sn 4583  df-pr 4585  df-op 4589  df-uni 4866  df-iun 4950  df-br 5101  df-opab 5163  df-mpt 5182  df-tr 5208  df-id 5527  df-xp 5638  df-rel 5639  df-cnv 5640  df-co 5641  df-dm 5642  df-rn 5643  df-res 5644  df-ima 5645  df-iota 6456  df-fun 6502  df-fn 6503  df-f 6504  df-f1 6505  df-fo 6506  df-f1o 6507  df-fv 6508  df-ov 7371  df-oprab 7372  df-mpo 7373  df-map 8777  df-gru 10714
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator