| 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 1156 | . . . 4 ⊢ ((𝑈 ∈ Univ ∧ 𝐴 ∈ 𝑈 ∧ 𝐹:𝐴⟶𝑈) → 𝐹:𝐴⟶𝑈) | |
| 2 | 1 | feqmptd 6984 | . . 3 ⊢ ((𝑈 ∈ Univ ∧ 𝐴 ∈ 𝑈 ∧ 𝐹:𝐴⟶𝑈) → 𝐹 = (𝑥 ∈ 𝐴 ↦ (𝐹‘𝑥))) |
| 3 | fvex 6929 | . . . 4 ⊢ (𝐹‘𝑥) ∈ V | |
| 4 | 3 | fnasrn 7180 | . . 3 ⊢ (𝑥 ∈ 𝐴 ↦ (𝐹‘𝑥)) = ran (𝑥 ∈ 𝐴 ↦ 〈𝑥, (𝐹‘𝑥)〉) |
| 5 | 2, 4 | eqtrdi 2814 | . 2 ⊢ ((𝑈 ∈ Univ ∧ 𝐴 ∈ 𝑈 ∧ 𝐹:𝐴⟶𝑈) → 𝐹 = ran (𝑥 ∈ 𝐴 ↦ 〈𝑥, (𝐹‘𝑥)〉)) |
| 6 | simpl1 1210 | . . . . 5 ⊢ (((𝑈 ∈ Univ ∧ 𝐴 ∈ 𝑈 ∧ 𝐹:𝐴⟶𝑈) ∧ 𝑥 ∈ 𝐴) → 𝑈 ∈ Univ) | |
| 7 | gruel 10927 | . . . . . . 7 ⊢ ((𝑈 ∈ Univ ∧ 𝐴 ∈ 𝑈 ∧ 𝑥 ∈ 𝐴) → 𝑥 ∈ 𝑈) | |
| 8 | 7 | 3expa 1136 | . . . . . 6 ⊢ (((𝑈 ∈ Univ ∧ 𝐴 ∈ 𝑈) ∧ 𝑥 ∈ 𝐴) → 𝑥 ∈ 𝑈) |
| 9 | 8 | 3adantl3 1187 | . . . . 5 ⊢ (((𝑈 ∈ Univ ∧ 𝐴 ∈ 𝑈 ∧ 𝐹:𝐴⟶𝑈) ∧ 𝑥 ∈ 𝐴) → 𝑥 ∈ 𝑈) |
| 10 | ffvelcdm 7113 | . . . . . 6 ⊢ ((𝐹:𝐴⟶𝑈 ∧ 𝑥 ∈ 𝐴) → (𝐹‘𝑥) ∈ 𝑈) | |
| 11 | 10 | 3ad2antl3 1206 | . . . . 5 ⊢ (((𝑈 ∈ Univ ∧ 𝐴 ∈ 𝑈 ∧ 𝐹:𝐴⟶𝑈) ∧ 𝑥 ∈ 𝐴) → (𝐹‘𝑥) ∈ 𝑈) |
| 12 | gruop 10929 | . . . . 5 ⊢ ((𝑈 ∈ Univ ∧ 𝑥 ∈ 𝑈 ∧ (𝐹‘𝑥) ∈ 𝑈) → 〈𝑥, (𝐹‘𝑥)〉 ∈ 𝑈) | |
| 13 | 6, 9, 11, 12 | syl3anc 1399 | . . . 4 ⊢ (((𝑈 ∈ Univ ∧ 𝐴 ∈ 𝑈 ∧ 𝐹:𝐴⟶𝑈) ∧ 𝑥 ∈ 𝐴) → 〈𝑥, (𝐹‘𝑥)〉 ∈ 𝑈) |
| 14 | 13 | fmpttd 7147 | . . 3 ⊢ ((𝑈 ∈ Univ ∧ 𝐴 ∈ 𝑈 ∧ 𝐹:𝐴⟶𝑈) → (𝑥 ∈ 𝐴 ↦ 〈𝑥, (𝐹‘𝑥)〉):𝐴⟶𝑈) |
| 15 | grurn 10925 | . . 3 ⊢ ((𝑈 ∈ Univ ∧ 𝐴 ∈ 𝑈 ∧ (𝑥 ∈ 𝐴 ↦ 〈𝑥, (𝐹‘𝑥)〉):𝐴⟶𝑈) → ran (𝑥 ∈ 𝐴 ↦ 〈𝑥, (𝐹‘𝑥)〉) ∈ 𝑈) | |
| 16 | 14, 15 | syld3an3 1437 | . 2 ⊢ ((𝑈 ∈ Univ ∧ 𝐴 ∈ 𝑈 ∧ 𝐹:𝐴⟶𝑈) → ran (𝑥 ∈ 𝐴 ↦ 〈𝑥, (𝐹‘𝑥)〉) ∈ 𝑈) |
| 17 | 5, 16 | eqeltrd 2864 | 1 ⊢ ((𝑈 ∈ Univ ∧ 𝐴 ∈ 𝑈 ∧ 𝐹:𝐴⟶𝑈) → 𝐹 ∈ 𝑈) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 ∧ w3a 1103 ∈ wcel 2147 〈cop 4840 ↦ cmpt 5192 ran crn 5659 ⟶wf 6562 ‘cfv 6566 Univcgru 10914 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-sep 5255 ax-nul 5266 ax-pow 5334 ax-pr 5398 ax-un 7783 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-ral 3081 df-rex 3091 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4841 df-uni 4873 df-iun 4958 df-br 5109 df-opab 5174 df-mpt 5193 df-tr 5219 df-id 5553 df-xp 5664 df-rel 5665 df-cnv 5666 df-co 5667 df-dm 5668 df-rn 5669 df-res 5670 df-ima 5671 df-iota 6520 df-fun 6568 df-fn 6569 df-f 6570 df-f1 6571 df-fo 6572 df-f1o 6573 df-fv 6574 df-ov 7454 df-oprab 7455 df-mpo 7456 df-map 8887 df-gru 10915 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |