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

Theorem gruima 10871
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 1192 . . . 4 (((𝑈 ∈ Univ ∧ Fun 𝐹 ∧ (𝐹𝐴) ⊆ 𝑈) ∧ 𝐴𝑈) → Fun 𝐹)
2 funrel 6595 . . . 4 (Fun 𝐹 → Rel 𝐹)
3 df-ima 5713 . . . . 5 (𝐹𝐴) = ran (𝐹𝐴)
4 resres 6022 . . . . . . 7 ((𝐹 ↾ dom 𝐹) ↾ 𝐴) = (𝐹 ↾ (dom 𝐹𝐴))
5 resdm 6055 . . . . . . . 8 (Rel 𝐹 → (𝐹 ↾ dom 𝐹) = 𝐹)
65reseq1d 6008 . . . . . . 7 (Rel 𝐹 → ((𝐹 ↾ dom 𝐹) ↾ 𝐴) = (𝐹𝐴))
74, 6eqtr3id 2794 . . . . . 6 (Rel 𝐹 → (𝐹 ↾ (dom 𝐹𝐴)) = (𝐹𝐴))
87rneqd 5963 . . . . 5 (Rel 𝐹 → ran (𝐹 ↾ (dom 𝐹𝐴)) = ran (𝐹𝐴))
93, 8eqtr4id 2799 . . . 4 (Rel 𝐹 → (𝐹𝐴) = ran (𝐹 ↾ (dom 𝐹𝐴)))
101, 2, 93syl 18 . . 3 (((𝑈 ∈ Univ ∧ Fun 𝐹 ∧ (𝐹𝐴) ⊆ 𝑈) ∧ 𝐴𝑈) → (𝐹𝐴) = ran (𝐹 ↾ (dom 𝐹𝐴)))
11 simpl1 1191 . . . 4 (((𝑈 ∈ Univ ∧ Fun 𝐹 ∧ (𝐹𝐴) ⊆ 𝑈) ∧ 𝐴𝑈) → 𝑈 ∈ Univ)
12 simpr 484 . . . . 5 (((𝑈 ∈ Univ ∧ Fun 𝐹 ∧ (𝐹𝐴) ⊆ 𝑈) ∧ 𝐴𝑈) → 𝐴𝑈)
13 inss2 4259 . . . . . 6 (dom 𝐹𝐴) ⊆ 𝐴
1413a1i 11 . . . . 5 (((𝑈 ∈ Univ ∧ Fun 𝐹 ∧ (𝐹𝐴) ⊆ 𝑈) ∧ 𝐴𝑈) → (dom 𝐹𝐴) ⊆ 𝐴)
15 gruss 10865 . . . . 5 ((𝑈 ∈ Univ ∧ 𝐴𝑈 ∧ (dom 𝐹𝐴) ⊆ 𝐴) → (dom 𝐹𝐴) ∈ 𝑈)
1611, 12, 14, 15syl3anc 1371 . . . 4 (((𝑈 ∈ Univ ∧ Fun 𝐹 ∧ (𝐹𝐴) ⊆ 𝑈) ∧ 𝐴𝑈) → (dom 𝐹𝐴) ∈ 𝑈)
17 funforn 6841 . . . . . . . 8 (Fun 𝐹𝐹:dom 𝐹onto→ran 𝐹)
18 fof 6834 . . . . . . . 8 (𝐹:dom 𝐹onto→ran 𝐹𝐹:dom 𝐹⟶ran 𝐹)
1917, 18sylbi 217 . . . . . . 7 (Fun 𝐹𝐹:dom 𝐹⟶ran 𝐹)
20 inss1 4258 . . . . . . 7 (dom 𝐹𝐴) ⊆ dom 𝐹
21 fssres 6787 . . . . . . 7 ((𝐹:dom 𝐹⟶ran 𝐹 ∧ (dom 𝐹𝐴) ⊆ dom 𝐹) → (𝐹 ↾ (dom 𝐹𝐴)):(dom 𝐹𝐴)⟶ran 𝐹)
2219, 20, 21sylancl 585 . . . . . 6 (Fun 𝐹 → (𝐹 ↾ (dom 𝐹𝐴)):(dom 𝐹𝐴)⟶ran 𝐹)
23 ffn 6747 . . . . . 6 ((𝐹 ↾ (dom 𝐹𝐴)):(dom 𝐹𝐴)⟶ran 𝐹 → (𝐹 ↾ (dom 𝐹𝐴)) Fn (dom 𝐹𝐴))
241, 22, 233syl 18 . . . . 5 (((𝑈 ∈ Univ ∧ Fun 𝐹 ∧ (𝐹𝐴) ⊆ 𝑈) ∧ 𝐴𝑈) → (𝐹 ↾ (dom 𝐹𝐴)) Fn (dom 𝐹𝐴))
25 simpl3 1193 . . . . . 6 (((𝑈 ∈ Univ ∧ Fun 𝐹 ∧ (𝐹𝐴) ⊆ 𝑈) ∧ 𝐴𝑈) → (𝐹𝐴) ⊆ 𝑈)
2610, 25eqsstrrd 4048 . . . . 5 (((𝑈 ∈ Univ ∧ Fun 𝐹 ∧ (𝐹𝐴) ⊆ 𝑈) ∧ 𝐴𝑈) → ran (𝐹 ↾ (dom 𝐹𝐴)) ⊆ 𝑈)
27 df-f 6577 . . . . 5 ((𝐹 ↾ (dom 𝐹𝐴)):(dom 𝐹𝐴)⟶𝑈 ↔ ((𝐹 ↾ (dom 𝐹𝐴)) Fn (dom 𝐹𝐴) ∧ ran (𝐹 ↾ (dom 𝐹𝐴)) ⊆ 𝑈))
2824, 26, 27sylanbrc 582 . . . 4 (((𝑈 ∈ Univ ∧ Fun 𝐹 ∧ (𝐹𝐴) ⊆ 𝑈) ∧ 𝐴𝑈) → (𝐹 ↾ (dom 𝐹𝐴)):(dom 𝐹𝐴)⟶𝑈)
29 grurn 10870 . . . 4 ((𝑈 ∈ Univ ∧ (dom 𝐹𝐴) ∈ 𝑈 ∧ (𝐹 ↾ (dom 𝐹𝐴)):(dom 𝐹𝐴)⟶𝑈) → ran (𝐹 ↾ (dom 𝐹𝐴)) ∈ 𝑈)
3011, 16, 28, 29syl3anc 1371 . . 3 (((𝑈 ∈ Univ ∧ Fun 𝐹 ∧ (𝐹𝐴) ⊆ 𝑈) ∧ 𝐴𝑈) → ran (𝐹 ↾ (dom 𝐹𝐴)) ∈ 𝑈)
3110, 30eqeltrd 2844 . 2 (((𝑈 ∈ Univ ∧ Fun 𝐹 ∧ (𝐹𝐴) ⊆ 𝑈) ∧ 𝐴𝑈) → (𝐹𝐴) ∈ 𝑈)
3231ex 412 1 ((𝑈 ∈ Univ ∧ Fun 𝐹 ∧ (𝐹𝐴) ⊆ 𝑈) → (𝐴𝑈 → (𝐹𝐴) ∈ 𝑈))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395  w3a 1087   = wceq 1537  wcel 2108  cin 3975  wss 3976  dom cdm 5700  ran crn 5701  cres 5702  cima 5703  Rel wrel 5705  Fun wfun 6567   Fn wfn 6568  wf 6569  ontowfo 6571  Univcgru 10859
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1793  ax-4 1807  ax-5 1909  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2158  ax-12 2178  ax-ext 2711  ax-sep 5317  ax-nul 5324  ax-pow 5383  ax-pr 5447  ax-un 7770
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 847  df-3an 1089  df-tru 1540  df-fal 1550  df-ex 1778  df-nf 1782  df-sb 2065  df-mo 2543  df-eu 2572  df-clab 2718  df-cleq 2732  df-clel 2819  df-nfc 2895  df-ral 3068  df-rex 3077  df-rab 3444  df-v 3490  df-sbc 3805  df-dif 3979  df-un 3981  df-in 3983  df-ss 3993  df-nul 4353  df-if 4549  df-pw 4624  df-sn 4649  df-pr 4651  df-op 4655  df-uni 4932  df-br 5167  df-opab 5229  df-tr 5284  df-id 5593  df-xp 5706  df-rel 5707  df-cnv 5708  df-co 5709  df-dm 5710  df-rn 5711  df-res 5712  df-ima 5713  df-iota 6525  df-fun 6575  df-fn 6576  df-f 6577  df-fo 6579  df-fv 6581  df-ov 7451  df-oprab 7452  df-mpo 7453  df-map 8886  df-gru 10860
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator