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 1134 | . . . 4 ⊢ ((𝑈 ∈ Univ ∧ 𝐴 ∈ 𝑈 ∧ 𝐹:𝐴⟶𝑈) → 𝐹:𝐴⟶𝑈) | |
2 | 1 | feqmptd 6733 | . . 3 ⊢ ((𝑈 ∈ Univ ∧ 𝐴 ∈ 𝑈 ∧ 𝐹:𝐴⟶𝑈) → 𝐹 = (𝑥 ∈ 𝐴 ↦ (𝐹‘𝑥))) |
3 | fvex 6683 | . . . 4 ⊢ (𝐹‘𝑥) ∈ V | |
4 | 3 | fnasrn 6907 | . . 3 ⊢ (𝑥 ∈ 𝐴 ↦ (𝐹‘𝑥)) = ran (𝑥 ∈ 𝐴 ↦ 〈𝑥, (𝐹‘𝑥)〉) |
5 | 2, 4 | syl6eq 2872 | . 2 ⊢ ((𝑈 ∈ Univ ∧ 𝐴 ∈ 𝑈 ∧ 𝐹:𝐴⟶𝑈) → 𝐹 = ran (𝑥 ∈ 𝐴 ↦ 〈𝑥, (𝐹‘𝑥)〉)) |
6 | simpl1 1187 | . . . . 5 ⊢ (((𝑈 ∈ Univ ∧ 𝐴 ∈ 𝑈 ∧ 𝐹:𝐴⟶𝑈) ∧ 𝑥 ∈ 𝐴) → 𝑈 ∈ Univ) | |
7 | gruel 10225 | . . . . . . 7 ⊢ ((𝑈 ∈ Univ ∧ 𝐴 ∈ 𝑈 ∧ 𝑥 ∈ 𝐴) → 𝑥 ∈ 𝑈) | |
8 | 7 | 3expa 1114 | . . . . . 6 ⊢ (((𝑈 ∈ Univ ∧ 𝐴 ∈ 𝑈) ∧ 𝑥 ∈ 𝐴) → 𝑥 ∈ 𝑈) |
9 | 8 | 3adantl3 1164 | . . . . 5 ⊢ (((𝑈 ∈ Univ ∧ 𝐴 ∈ 𝑈 ∧ 𝐹:𝐴⟶𝑈) ∧ 𝑥 ∈ 𝐴) → 𝑥 ∈ 𝑈) |
10 | ffvelrn 6849 | . . . . . 6 ⊢ ((𝐹:𝐴⟶𝑈 ∧ 𝑥 ∈ 𝐴) → (𝐹‘𝑥) ∈ 𝑈) | |
11 | 10 | 3ad2antl3 1183 | . . . . 5 ⊢ (((𝑈 ∈ Univ ∧ 𝐴 ∈ 𝑈 ∧ 𝐹:𝐴⟶𝑈) ∧ 𝑥 ∈ 𝐴) → (𝐹‘𝑥) ∈ 𝑈) |
12 | gruop 10227 | . . . . 5 ⊢ ((𝑈 ∈ Univ ∧ 𝑥 ∈ 𝑈 ∧ (𝐹‘𝑥) ∈ 𝑈) → 〈𝑥, (𝐹‘𝑥)〉 ∈ 𝑈) | |
13 | 6, 9, 11, 12 | syl3anc 1367 | . . . 4 ⊢ (((𝑈 ∈ Univ ∧ 𝐴 ∈ 𝑈 ∧ 𝐹:𝐴⟶𝑈) ∧ 𝑥 ∈ 𝐴) → 〈𝑥, (𝐹‘𝑥)〉 ∈ 𝑈) |
14 | 13 | fmpttd 6879 | . . 3 ⊢ ((𝑈 ∈ Univ ∧ 𝐴 ∈ 𝑈 ∧ 𝐹:𝐴⟶𝑈) → (𝑥 ∈ 𝐴 ↦ 〈𝑥, (𝐹‘𝑥)〉):𝐴⟶𝑈) |
15 | grurn 10223 | . . 3 ⊢ ((𝑈 ∈ Univ ∧ 𝐴 ∈ 𝑈 ∧ (𝑥 ∈ 𝐴 ↦ 〈𝑥, (𝐹‘𝑥)〉):𝐴⟶𝑈) → ran (𝑥 ∈ 𝐴 ↦ 〈𝑥, (𝐹‘𝑥)〉) ∈ 𝑈) | |
16 | 14, 15 | syld3an3 1405 | . 2 ⊢ ((𝑈 ∈ Univ ∧ 𝐴 ∈ 𝑈 ∧ 𝐹:𝐴⟶𝑈) → ran (𝑥 ∈ 𝐴 ↦ 〈𝑥, (𝐹‘𝑥)〉) ∈ 𝑈) |
17 | 5, 16 | eqeltrd 2913 | 1 ⊢ ((𝑈 ∈ Univ ∧ 𝐴 ∈ 𝑈 ∧ 𝐹:𝐴⟶𝑈) → 𝐹 ∈ 𝑈) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 398 ∧ w3a 1083 ∈ wcel 2114 〈cop 4573 ↦ cmpt 5146 ran crn 5556 ⟶wf 6351 ‘cfv 6355 Univcgru 10212 |
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 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2793 ax-sep 5203 ax-nul 5210 ax-pow 5266 ax-pr 5330 ax-un 7461 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3an 1085 df-tru 1540 df-ex 1781 df-nf 1785 df-sb 2070 df-mo 2622 df-eu 2654 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ne 3017 df-ral 3143 df-rex 3144 df-reu 3145 df-rab 3147 df-v 3496 df-sbc 3773 df-csb 3884 df-dif 3939 df-un 3941 df-in 3943 df-ss 3952 df-nul 4292 df-if 4468 df-pw 4541 df-sn 4568 df-pr 4570 df-op 4574 df-uni 4839 df-iun 4921 df-br 5067 df-opab 5129 df-mpt 5147 df-tr 5173 df-id 5460 df-xp 5561 df-rel 5562 df-cnv 5563 df-co 5564 df-dm 5565 df-rn 5566 df-res 5567 df-ima 5568 df-iota 6314 df-fun 6357 df-fn 6358 df-f 6359 df-f1 6360 df-fo 6361 df-f1o 6362 df-fv 6363 df-ov 7159 df-oprab 7160 df-mpo 7161 df-map 8408 df-gru 10213 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |