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

Theorem gruima 10416
Description: A Grothendieck universe contains image sets drawn from its members. (Contributed by Mario Carneiro, 9-Jun-2013.)
Assertion
Ref Expression
gruima ((𝑈 ∈ Univ ∧ Fun 𝐹 ∧ (𝐹𝐴) ⊆ 𝑈) → (𝐴𝑈 → (𝐹𝐴) ∈ 𝑈))

Proof of Theorem gruima
StepHypRef Expression
1 simpl2 1194 . . . 4 (((𝑈 ∈ Univ ∧ Fun 𝐹 ∧ (𝐹𝐴) ⊆ 𝑈) ∧ 𝐴𝑈) → Fun 𝐹)
2 funrel 6397 . . . 4 (Fun 𝐹 → Rel 𝐹)
3 df-ima 5564 . . . . 5 (𝐹𝐴) = ran (𝐹𝐴)
4 resres 5864 . . . . . . 7 ((𝐹 ↾ dom 𝐹) ↾ 𝐴) = (𝐹 ↾ (dom 𝐹𝐴))
5 resdm 5896 . . . . . . . 8 (Rel 𝐹 → (𝐹 ↾ dom 𝐹) = 𝐹)
65reseq1d 5850 . . . . . . 7 (Rel 𝐹 → ((𝐹 ↾ dom 𝐹) ↾ 𝐴) = (𝐹𝐴))
74, 6eqtr3id 2792 . . . . . 6 (Rel 𝐹 → (𝐹 ↾ (dom 𝐹𝐴)) = (𝐹𝐴))
87rneqd 5807 . . . . 5 (Rel 𝐹 → ran (𝐹 ↾ (dom 𝐹𝐴)) = ran (𝐹𝐴))
93, 8eqtr4id 2797 . . . 4 (Rel 𝐹 → (𝐹𝐴) = ran (𝐹 ↾ (dom 𝐹𝐴)))
101, 2, 93syl 18 . . 3 (((𝑈 ∈ Univ ∧ Fun 𝐹 ∧ (𝐹𝐴) ⊆ 𝑈) ∧ 𝐴𝑈) → (𝐹𝐴) = ran (𝐹 ↾ (dom 𝐹𝐴)))
11 simpl1 1193 . . . 4 (((𝑈 ∈ Univ ∧ Fun 𝐹 ∧ (𝐹𝐴) ⊆ 𝑈) ∧ 𝐴𝑈) → 𝑈 ∈ Univ)
12 simpr 488 . . . . 5 (((𝑈 ∈ Univ ∧ Fun 𝐹 ∧ (𝐹𝐴) ⊆ 𝑈) ∧ 𝐴𝑈) → 𝐴𝑈)
13 inss2 4144 . . . . . 6 (dom 𝐹𝐴) ⊆ 𝐴
1413a1i 11 . . . . 5 (((𝑈 ∈ Univ ∧ Fun 𝐹 ∧ (𝐹𝐴) ⊆ 𝑈) ∧ 𝐴𝑈) → (dom 𝐹𝐴) ⊆ 𝐴)
15 gruss 10410 . . . . 5 ((𝑈 ∈ Univ ∧ 𝐴𝑈 ∧ (dom 𝐹𝐴) ⊆ 𝐴) → (dom 𝐹𝐴) ∈ 𝑈)
1611, 12, 14, 15syl3anc 1373 . . . 4 (((𝑈 ∈ Univ ∧ Fun 𝐹 ∧ (𝐹𝐴) ⊆ 𝑈) ∧ 𝐴𝑈) → (dom 𝐹𝐴) ∈ 𝑈)
17 funforn 6640 . . . . . . . 8 (Fun 𝐹𝐹:dom 𝐹onto→ran 𝐹)
18 fof 6633 . . . . . . . 8 (𝐹:dom 𝐹onto→ran 𝐹𝐹:dom 𝐹⟶ran 𝐹)
1917, 18sylbi 220 . . . . . . 7 (Fun 𝐹𝐹:dom 𝐹⟶ran 𝐹)
20 inss1 4143 . . . . . . 7 (dom 𝐹𝐴) ⊆ dom 𝐹
21 fssres 6585 . . . . . . 7 ((𝐹:dom 𝐹⟶ran 𝐹 ∧ (dom 𝐹𝐴) ⊆ dom 𝐹) → (𝐹 ↾ (dom 𝐹𝐴)):(dom 𝐹𝐴)⟶ran 𝐹)
2219, 20, 21sylancl 589 . . . . . 6 (Fun 𝐹 → (𝐹 ↾ (dom 𝐹𝐴)):(dom 𝐹𝐴)⟶ran 𝐹)
23 ffn 6545 . . . . . 6 ((𝐹 ↾ (dom 𝐹𝐴)):(dom 𝐹𝐴)⟶ran 𝐹 → (𝐹 ↾ (dom 𝐹𝐴)) Fn (dom 𝐹𝐴))
241, 22, 233syl 18 . . . . 5 (((𝑈 ∈ Univ ∧ Fun 𝐹 ∧ (𝐹𝐴) ⊆ 𝑈) ∧ 𝐴𝑈) → (𝐹 ↾ (dom 𝐹𝐴)) Fn (dom 𝐹𝐴))
25 simpl3 1195 . . . . . 6 (((𝑈 ∈ Univ ∧ Fun 𝐹 ∧ (𝐹𝐴) ⊆ 𝑈) ∧ 𝐴𝑈) → (𝐹𝐴) ⊆ 𝑈)
2610, 25eqsstrrd 3940 . . . . 5 (((𝑈 ∈ Univ ∧ Fun 𝐹 ∧ (𝐹𝐴) ⊆ 𝑈) ∧ 𝐴𝑈) → ran (𝐹 ↾ (dom 𝐹𝐴)) ⊆ 𝑈)
27 df-f 6384 . . . . 5 ((𝐹 ↾ (dom 𝐹𝐴)):(dom 𝐹𝐴)⟶𝑈 ↔ ((𝐹 ↾ (dom 𝐹𝐴)) Fn (dom 𝐹𝐴) ∧ ran (𝐹 ↾ (dom 𝐹𝐴)) ⊆ 𝑈))
2824, 26, 27sylanbrc 586 . . . 4 (((𝑈 ∈ Univ ∧ Fun 𝐹 ∧ (𝐹𝐴) ⊆ 𝑈) ∧ 𝐴𝑈) → (𝐹 ↾ (dom 𝐹𝐴)):(dom 𝐹𝐴)⟶𝑈)
29 grurn 10415 . . . 4 ((𝑈 ∈ Univ ∧ (dom 𝐹𝐴) ∈ 𝑈 ∧ (𝐹 ↾ (dom 𝐹𝐴)):(dom 𝐹𝐴)⟶𝑈) → ran (𝐹 ↾ (dom 𝐹𝐴)) ∈ 𝑈)
3011, 16, 28, 29syl3anc 1373 . . 3 (((𝑈 ∈ Univ ∧ Fun 𝐹 ∧ (𝐹𝐴) ⊆ 𝑈) ∧ 𝐴𝑈) → ran (𝐹 ↾ (dom 𝐹𝐴)) ∈ 𝑈)
3110, 30eqeltrd 2838 . 2 (((𝑈 ∈ Univ ∧ Fun 𝐹 ∧ (𝐹𝐴) ⊆ 𝑈) ∧ 𝐴𝑈) → (𝐹𝐴) ∈ 𝑈)
3231ex 416 1 ((𝑈 ∈ Univ ∧ Fun 𝐹 ∧ (𝐹𝐴) ⊆ 𝑈) → (𝐴𝑈 → (𝐹𝐴) ∈ 𝑈))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 399  w3a 1089   = wceq 1543  wcel 2110  cin 3865  wss 3866  dom cdm 5551  ran crn 5552  cres 5553  cima 5554  Rel wrel 5556  Fun wfun 6374   Fn wfn 6375  wf 6376  ontowfo 6378  Univcgru 10404
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1803  ax-4 1817  ax-5 1918  ax-6 1976  ax-7 2016  ax-8 2112  ax-9 2120  ax-10 2141  ax-11 2158  ax-12 2175  ax-ext 2708  ax-sep 5192  ax-nul 5199  ax-pow 5258  ax-pr 5322  ax-un 7523
This theorem depends on definitions:  df-bi 210  df-an 400  df-or 848  df-3an 1091  df-tru 1546  df-fal 1556  df-ex 1788  df-nf 1792  df-sb 2071  df-mo 2539  df-eu 2568  df-clab 2715  df-cleq 2729  df-clel 2816  df-nfc 2886  df-ral 3066  df-rex 3067  df-rab 3070  df-v 3410  df-sbc 3695  df-dif 3869  df-un 3871  df-in 3873  df-ss 3883  df-nul 4238  df-if 4440  df-pw 4515  df-sn 4542  df-pr 4544  df-op 4548  df-uni 4820  df-br 5054  df-opab 5116  df-tr 5162  df-id 5455  df-xp 5557  df-rel 5558  df-cnv 5559  df-co 5560  df-dm 5561  df-rn 5562  df-res 5563  df-ima 5564  df-iota 6338  df-fun 6382  df-fn 6383  df-f 6384  df-fo 6386  df-fv 6388  df-ov 7216  df-oprab 7217  df-mpo 7218  df-map 8510  df-gru 10405
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator