| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > gruf | Structured version Visualization version GIF version | ||
| Description: A Grothendieck universe contains all functions on its elements. (Contributed by Mario Carneiro, 10-Jun-2013.) |
| Ref | Expression |
|---|---|
| gruf | ⊢ ((𝑈 ∈ Univ ∧ 𝐴 ∈ 𝑈 ∧ 𝐹:𝐴⟶𝑈) → 𝐹 ∈ 𝑈) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | simp3 1138 | . . . 4 ⊢ ((𝑈 ∈ Univ ∧ 𝐴 ∈ 𝑈 ∧ 𝐹:𝐴⟶𝑈) → 𝐹:𝐴⟶𝑈) | |
| 2 | 1 | feqmptd 6900 | . . 3 ⊢ ((𝑈 ∈ Univ ∧ 𝐴 ∈ 𝑈 ∧ 𝐹:𝐴⟶𝑈) → 𝐹 = (𝑥 ∈ 𝐴 ↦ (𝐹‘𝑥))) |
| 3 | fvex 6845 | . . . 4 ⊢ (𝐹‘𝑥) ∈ V | |
| 4 | 3 | fnasrn 7088 | . . 3 ⊢ (𝑥 ∈ 𝐴 ↦ (𝐹‘𝑥)) = ran (𝑥 ∈ 𝐴 ↦ 〈𝑥, (𝐹‘𝑥)〉) |
| 5 | 2, 4 | eqtrdi 2785 | . 2 ⊢ ((𝑈 ∈ Univ ∧ 𝐴 ∈ 𝑈 ∧ 𝐹:𝐴⟶𝑈) → 𝐹 = ran (𝑥 ∈ 𝐴 ↦ 〈𝑥, (𝐹‘𝑥)〉)) |
| 6 | simpl1 1192 | . . . . 5 ⊢ (((𝑈 ∈ Univ ∧ 𝐴 ∈ 𝑈 ∧ 𝐹:𝐴⟶𝑈) ∧ 𝑥 ∈ 𝐴) → 𝑈 ∈ Univ) | |
| 7 | gruel 10712 | . . . . . . 7 ⊢ ((𝑈 ∈ Univ ∧ 𝐴 ∈ 𝑈 ∧ 𝑥 ∈ 𝐴) → 𝑥 ∈ 𝑈) | |
| 8 | 7 | 3expa 1118 | . . . . . 6 ⊢ (((𝑈 ∈ Univ ∧ 𝐴 ∈ 𝑈) ∧ 𝑥 ∈ 𝐴) → 𝑥 ∈ 𝑈) |
| 9 | 8 | 3adantl3 1169 | . . . . 5 ⊢ (((𝑈 ∈ Univ ∧ 𝐴 ∈ 𝑈 ∧ 𝐹:𝐴⟶𝑈) ∧ 𝑥 ∈ 𝐴) → 𝑥 ∈ 𝑈) |
| 10 | ffvelcdm 7024 | . . . . . 6 ⊢ ((𝐹:𝐴⟶𝑈 ∧ 𝑥 ∈ 𝐴) → (𝐹‘𝑥) ∈ 𝑈) | |
| 11 | 10 | 3ad2antl3 1188 | . . . . 5 ⊢ (((𝑈 ∈ Univ ∧ 𝐴 ∈ 𝑈 ∧ 𝐹:𝐴⟶𝑈) ∧ 𝑥 ∈ 𝐴) → (𝐹‘𝑥) ∈ 𝑈) |
| 12 | gruop 10714 | . . . . 5 ⊢ ((𝑈 ∈ Univ ∧ 𝑥 ∈ 𝑈 ∧ (𝐹‘𝑥) ∈ 𝑈) → 〈𝑥, (𝐹‘𝑥)〉 ∈ 𝑈) | |
| 13 | 6, 9, 11, 12 | syl3anc 1373 | . . . 4 ⊢ (((𝑈 ∈ Univ ∧ 𝐴 ∈ 𝑈 ∧ 𝐹:𝐴⟶𝑈) ∧ 𝑥 ∈ 𝐴) → 〈𝑥, (𝐹‘𝑥)〉 ∈ 𝑈) |
| 14 | 13 | fmpttd 7058 | . . 3 ⊢ ((𝑈 ∈ Univ ∧ 𝐴 ∈ 𝑈 ∧ 𝐹:𝐴⟶𝑈) → (𝑥 ∈ 𝐴 ↦ 〈𝑥, (𝐹‘𝑥)〉):𝐴⟶𝑈) |
| 15 | grurn 10710 | . . 3 ⊢ ((𝑈 ∈ Univ ∧ 𝐴 ∈ 𝑈 ∧ (𝑥 ∈ 𝐴 ↦ 〈𝑥, (𝐹‘𝑥)〉):𝐴⟶𝑈) → ran (𝑥 ∈ 𝐴 ↦ 〈𝑥, (𝐹‘𝑥)〉) ∈ 𝑈) | |
| 16 | 14, 15 | syld3an3 1411 | . 2 ⊢ ((𝑈 ∈ Univ ∧ 𝐴 ∈ 𝑈 ∧ 𝐹:𝐴⟶𝑈) → ran (𝑥 ∈ 𝐴 ↦ 〈𝑥, (𝐹‘𝑥)〉) ∈ 𝑈) |
| 17 | 5, 16 | eqeltrd 2834 | 1 ⊢ ((𝑈 ∈ Univ ∧ 𝐴 ∈ 𝑈 ∧ 𝐹:𝐴⟶𝑈) → 𝐹 ∈ 𝑈) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 ∧ w3a 1086 ∈ wcel 2113 〈cop 4584 ↦ cmpt 5177 ran crn 5623 ⟶wf 6486 ‘cfv 6490 Univcgru 10699 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2182 ax-ext 2706 ax-sep 5239 ax-nul 5249 ax-pow 5308 ax-pr 5375 ax-un 7678 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2537 df-eu 2567 df-clab 2713 df-cleq 2726 df-clel 2809 df-nfc 2883 df-ne 2931 df-ral 3050 df-rex 3059 df-reu 3349 df-rab 3398 df-v 3440 df-sbc 3739 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-nul 4284 df-if 4478 df-pw 4554 df-sn 4579 df-pr 4581 df-op 4585 df-uni 4862 df-iun 4946 df-br 5097 df-opab 5159 df-mpt 5178 df-tr 5204 df-id 5517 df-xp 5628 df-rel 5629 df-cnv 5630 df-co 5631 df-dm 5632 df-rn 5633 df-res 5634 df-ima 5635 df-iota 6446 df-fun 6492 df-fn 6493 df-f 6494 df-f1 6495 df-fo 6496 df-f1o 6497 df-fv 6498 df-ov 7359 df-oprab 7360 df-mpo 7361 df-map 8763 df-gru 10700 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |