| 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 1152 | . . . 4 ⊢ ((𝑈 ∈ Univ ∧ 𝐴 ∈ 𝑈 ∧ 𝐹:𝐴⟶𝑈) → 𝐹:𝐴⟶𝑈) | |
| 2 | 1 | feqmptd 6936 | . . 3 ⊢ ((𝑈 ∈ Univ ∧ 𝐴 ∈ 𝑈 ∧ 𝐹:𝐴⟶𝑈) → 𝐹 = (𝑥 ∈ 𝐴 ↦ (𝐹‘𝑥))) |
| 3 | fvex 6881 | . . . 4 ⊢ (𝐹‘𝑥) ∈ V | |
| 4 | 3 | fnasrn 7128 | . . 3 ⊢ (𝑥 ∈ 𝐴 ↦ (𝐹‘𝑥)) = ran (𝑥 ∈ 𝐴 ↦ 〈𝑥, (𝐹‘𝑥)〉) |
| 5 | 2, 4 | eqtrdi 2814 | . 2 ⊢ ((𝑈 ∈ Univ ∧ 𝐴 ∈ 𝑈 ∧ 𝐹:𝐴⟶𝑈) → 𝐹 = ran (𝑥 ∈ 𝐴 ↦ 〈𝑥, (𝐹‘𝑥)〉)) |
| 6 | simpl1 1206 | . . . . 5 ⊢ (((𝑈 ∈ Univ ∧ 𝐴 ∈ 𝑈 ∧ 𝐹:𝐴⟶𝑈) ∧ 𝑥 ∈ 𝐴) → 𝑈 ∈ Univ) | |
| 7 | gruel 10762 | . . . . . . 7 ⊢ ((𝑈 ∈ Univ ∧ 𝐴 ∈ 𝑈 ∧ 𝑥 ∈ 𝐴) → 𝑥 ∈ 𝑈) | |
| 8 | 7 | 3expa 1132 | . . . . . 6 ⊢ (((𝑈 ∈ Univ ∧ 𝐴 ∈ 𝑈) ∧ 𝑥 ∈ 𝐴) → 𝑥 ∈ 𝑈) |
| 9 | 8 | 3adantl3 1183 | . . . . 5 ⊢ (((𝑈 ∈ Univ ∧ 𝐴 ∈ 𝑈 ∧ 𝐹:𝐴⟶𝑈) ∧ 𝑥 ∈ 𝐴) → 𝑥 ∈ 𝑈) |
| 10 | ffvelcdm 7063 | . . . . . 6 ⊢ ((𝐹:𝐴⟶𝑈 ∧ 𝑥 ∈ 𝐴) → (𝐹‘𝑥) ∈ 𝑈) | |
| 11 | 10 | 3ad2antl3 1202 | . . . . 5 ⊢ (((𝑈 ∈ Univ ∧ 𝐴 ∈ 𝑈 ∧ 𝐹:𝐴⟶𝑈) ∧ 𝑥 ∈ 𝐴) → (𝐹‘𝑥) ∈ 𝑈) |
| 12 | gruop 10764 | . . . . 5 ⊢ ((𝑈 ∈ Univ ∧ 𝑥 ∈ 𝑈 ∧ (𝐹‘𝑥) ∈ 𝑈) → 〈𝑥, (𝐹‘𝑥)〉 ∈ 𝑈) | |
| 13 | 6, 9, 11, 12 | syl3anc 1391 | . . . 4 ⊢ (((𝑈 ∈ Univ ∧ 𝐴 ∈ 𝑈 ∧ 𝐹:𝐴⟶𝑈) ∧ 𝑥 ∈ 𝐴) → 〈𝑥, (𝐹‘𝑥)〉 ∈ 𝑈) |
| 14 | 13 | fmpttd 7097 | . . 3 ⊢ ((𝑈 ∈ Univ ∧ 𝐴 ∈ 𝑈 ∧ 𝐹:𝐴⟶𝑈) → (𝑥 ∈ 𝐴 ↦ 〈𝑥, (𝐹‘𝑥)〉):𝐴⟶𝑈) |
| 15 | grurn 10760 | . . 3 ⊢ ((𝑈 ∈ Univ ∧ 𝐴 ∈ 𝑈 ∧ (𝑥 ∈ 𝐴 ↦ 〈𝑥, (𝐹‘𝑥)〉):𝐴⟶𝑈) → ran (𝑥 ∈ 𝐴 ↦ 〈𝑥, (𝐹‘𝑥)〉) ∈ 𝑈) | |
| 16 | 14, 15 | syld3an3 1429 | . 2 ⊢ ((𝑈 ∈ Univ ∧ 𝐴 ∈ 𝑈 ∧ 𝐹:𝐴⟶𝑈) → ran (𝑥 ∈ 𝐴 ↦ 〈𝑥, (𝐹‘𝑥)〉) ∈ 𝑈) |
| 17 | 5, 16 | eqeltrd 2863 | 1 ⊢ ((𝑈 ∈ Univ ∧ 𝐴 ∈ 𝑈 ∧ 𝐹:𝐴⟶𝑈) → 𝐹 ∈ 𝑈) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 399 ∧ w3a 1099 ∈ wcel 2143 〈cop 4589 ↦ cmpt 5182 ran crn 5649 ⟶wf 6518 ‘cfv 6522 Univcgru 10749 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1816 ax-4 1830 ax-5 1931 ax-6 1988 ax-7 2029 ax-8 2145 ax-9 2153 ax-10 2176 ax-11 2192 ax-12 2213 ax-ext 2735 ax-sep 5247 ax-nul 5257 ax-pow 5323 ax-pr 5391 ax-un 7719 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3an 1101 df-tru 1564 df-fal 1574 df-ex 1801 df-nf 1805 df-sb 2092 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2838 df-nfc 2912 df-ne 2959 df-ral 3078 df-rex 3088 df-reu 3369 df-rab 3416 df-v 3457 df-sbc 3746 df-csb 3854 df-dif 3908 df-un 3910 df-in 3912 df-ss 3922 df-nul 4287 df-if 4482 df-pw 4558 df-sn 4584 df-pr 4586 df-op 4590 df-uni 4867 df-iun 4952 df-br 5102 df-opab 5164 df-mpt 5183 df-tr 5209 df-id 5543 df-xp 5654 df-rel 5655 df-cnv 5656 df-co 5657 df-dm 5658 df-rn 5659 df-res 5660 df-ima 5661 df-iota 6478 df-fun 6524 df-fn 6525 df-f 6526 df-f1 6527 df-fo 6528 df-f1o 6529 df-fv 6530 df-ov 7400 df-oprab 7401 df-mpo 7402 df-map 8811 df-gru 10750 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |