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

Theorem gruima 10894
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 1211 . . . 4 (((𝑈 ∈ Univ ∧ Fun 𝐹 ∧ (𝐹 “ 𝐴) ⊆ 𝑈) ∧ 𝐴 ∈ 𝑈) → Fun 𝐹)
2 funrel 6561 . . . 4 (Fun 𝐹 → Rel 𝐹)
3 df-ima 5664 . . . . 5 (𝐹 “ 𝐴) = ran (𝐹 ↾ 𝐴)
4 resres 5984 . . . . . . 7 ((𝐹 ↾ dom 𝐹) ↾ 𝐴) = (𝐹 ↾ (dom 𝐹 ∩ 𝐴))
5 resdm 6017 . . . . . . . 8 (Rel 𝐹 → (𝐹 ↾ dom 𝐹) = 𝐹)
65reseq1d 5970 . . . . . . 7 (Rel 𝐹 → ((𝐹 ↾ dom 𝐹) ↾ 𝐴) = (𝐹 ↾ 𝐴))
74, 6eqtr3id 2809 . . . . . 6 (Rel 𝐹 → (𝐹 ↾ (dom 𝐹 ∩ 𝐴)) = (𝐹 ↾ 𝐴))
87rneqd 5921 . . . . 5 (Rel 𝐹 → ran (𝐹 ↾ (dom 𝐹 ∩ 𝐴)) = ran (𝐹 ↾ 𝐴))
93, 8eqtr4id 2814 . . . 4 (Rel 𝐹 → (𝐹 “ 𝐴) = ran (𝐹 ↾ (dom 𝐹 ∩ 𝐴)))
101, 2, 93syl 19 . . 3 (((𝑈 ∈ Univ ∧ Fun 𝐹 ∧ (𝐹 “ 𝐴) ⊆ 𝑈) ∧ 𝐴 ∈ 𝑈) → (𝐹 “ 𝐴) = ran (𝐹 ↾ (dom 𝐹 ∩ 𝐴)))
11 simpl1 1210 . . . 4 (((𝑈 ∈ Univ ∧ Fun 𝐹 ∧ (𝐹 “ 𝐴) ⊆ 𝑈) ∧ 𝐴 ∈ 𝑈) → 𝑈 ∈ Univ)
12 simpr 490 . . . . 5 (((𝑈 ∈ Univ ∧ Fun 𝐹 ∧ (𝐹 “ 𝐴) ⊆ 𝑈) ∧ 𝐴 ∈ 𝑈) → 𝐴 ∈ 𝑈)
13 inss2 4133 . . . . . 6 (dom 𝐹 ∩ 𝐴) ⊆ 𝐴
1413a1i 11 . . . . 5 (((𝑈 ∈ Univ ∧ Fun 𝐹 ∧ (𝐹 “ 𝐴) ⊆ 𝑈) ∧ 𝐴 ∈ 𝑈) → (dom 𝐹 ∩ 𝐴) ⊆ 𝐴)
15 gruss 10888 . . . . 5 ((𝑈 ∈ Univ ∧ 𝐴 ∈ 𝑈 ∧ (dom 𝐹 ∩ 𝐴) ⊆ 𝐴) → (dom 𝐹 ∩ 𝐴) ∈ 𝑈)
1611, 12, 14, 15syl3anc 1398 . . . 4 (((𝑈 ∈ Univ ∧ Fun 𝐹 ∧ (𝐹 “ 𝐴) ⊆ 𝑈) ∧ 𝐴 ∈ 𝑈) → (dom 𝐹 ∩ 𝐴) ∈ 𝑈)
17 funforn 6808 . . . . . . . 8 (Fun 𝐹 ↔ 𝐹:dom 𝐹–onto→ran 𝐹)
18 fof 6801 . . . . . . . 8 (𝐹:dom 𝐹–onto→ran 𝐹 → 𝐹:dom 𝐹⟶ran 𝐹)
1917, 18sylbi 220 . . . . . . 7 (Fun 𝐹 → 𝐹:dom 𝐹⟶ran 𝐹)
20 inss1 4132 . . . . . . 7 (dom 𝐹 ∩ 𝐴) ⊆ dom 𝐹
21 fssres 6753 . . . . . . 7 ((𝐹:dom 𝐹⟶ran 𝐹 ∧ (dom 𝐹 ∩ 𝐴) ⊆ dom 𝐹) → (𝐹 ↾ (dom 𝐹 ∩ 𝐴)):(dom 𝐹 ∩ 𝐴)⟶ran 𝐹)
2219, 20, 21sylancl 598 . . . . . 6 (Fun 𝐹 → (𝐹 ↾ (dom 𝐹 ∩ 𝐴)):(dom 𝐹 ∩ 𝐴)⟶ran 𝐹)
23 ffn 6714 . . . . . 6 ((𝐹 ↾ (dom 𝐹 ∩ 𝐴)):(dom 𝐹 ∩ 𝐴)⟶ran 𝐹 → (𝐹 ↾ (dom 𝐹 ∩ 𝐴)) Fn (dom 𝐹 ∩ 𝐴))
241, 22, 233syl 19 . . . . 5 (((𝑈 ∈ Univ ∧ Fun 𝐹 ∧ (𝐹 “ 𝐴) ⊆ 𝑈) ∧ 𝐴 ∈ 𝑈) → (𝐹 ↾ (dom 𝐹 ∩ 𝐴)) Fn (dom 𝐹 ∩ 𝐴))
25 simpl3 1212 . . . . . 6 (((𝑈 ∈ Univ ∧ Fun 𝐹 ∧ (𝐹 “ 𝐴) ⊆ 𝑈) ∧ 𝐴 ∈ 𝑈) → (𝐹 “ 𝐴) ⊆ 𝑈)
2610, 25eqsstrrd 3944 . . . . 5 (((𝑈 ∈ Univ ∧ Fun 𝐹 ∧ (𝐹 “ 𝐴) ⊆ 𝑈) ∧ 𝐴 ∈ 𝑈) → ran (𝐹 ↾ (dom 𝐹 ∩ 𝐴)) ⊆ 𝑈)
27 df-f 6547 . . . . 5 ((𝐹 ↾ (dom 𝐹 ∩ 𝐴)):(dom 𝐹 ∩ 𝐴)⟶𝑈 ↔ ((𝐹 ↾ (dom 𝐹 ∩ 𝐴)) Fn (dom 𝐹 ∩ 𝐴) ∧ ran (𝐹 ↾ (dom 𝐹 ∩ 𝐴)) ⊆ 𝑈))
2824, 26, 27sylanbrc 595 . . . 4 (((𝑈 ∈ Univ ∧ Fun 𝐹 ∧ (𝐹 “ 𝐴) ⊆ 𝑈) ∧ 𝐴 ∈ 𝑈) → (𝐹 ↾ (dom 𝐹 ∩ 𝐴)):(dom 𝐹 ∩ 𝐴)⟶𝑈)
29 grurn 10893 . . . 4 ((𝑈 ∈ Univ ∧ (dom 𝐹 ∩ 𝐴) ∈ 𝑈 ∧ (𝐹 ↾ (dom 𝐹 ∩ 𝐴)):(dom 𝐹 ∩ 𝐴)⟶𝑈) → ran (𝐹 ↾ (dom 𝐹 ∩ 𝐴)) ∈ 𝑈)
3011, 16, 28, 29syl3anc 1398 . . 3 (((𝑈 ∈ Univ ∧ Fun 𝐹 ∧ (𝐹 “ 𝐴) ⊆ 𝑈) ∧ 𝐴 ∈ 𝑈) → ran (𝐹 ↾ (dom 𝐹 ∩ 𝐴)) ∈ 𝑈)
3110, 30eqeltrd 2860 . 2 (((𝑈 ∈ Univ ∧ Fun 𝐹 ∧ (𝐹 “ 𝐴) ⊆ 𝑈) ∧ 𝐴 ∈ 𝑈) → (𝐹 “ 𝐴) ∈ 𝑈)
3231ex 418 1 ((𝑈 ∈ Univ ∧ Fun 𝐹 ∧ (𝐹 “ 𝐴) ⊆ 𝑈) → (𝐴 ∈ 𝑈 → (𝐹 “ 𝐴) ∈ 𝑈))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∧ w3a 1103   = wceq 1569   ∈ wcel 2144   ⊆ wss 3896   ∩ cin 4088  dom cdm 5651  ran crn 5652   ↾ cres 5653   “ cima 5654  Rel wrel 5656  Fun wfun 6537   Fn wfn 6538  ⟶wf 6539  –onto→wfo 6541  Univcgru 10882
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-sep 5248  ax-pow 5327  ax-pr 5391  ax-un 7755
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-sbc 3739  df-ss 3897  df-dif 4046  df-in 4090  df-un 4150  df-nul 4278  df-if 4482  df-pw 4558  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-br 5103  df-opab 5167  df-tr 5212  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-iota 6497  df-fun 6545  df-fn 6546  df-f 6547  df-fo 6549  df-fv 6551  df-ov 7427  df-oprab 7428  df-mpo 7429  df-map 8857  df-gru 10883
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator