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

Theorem gruima 10926
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 6584 . . . 4 (Fun 𝐹 → Rel 𝐹)
3 df-ima 5671 . . . . 5 (𝐹 “ 𝐴) = ran (𝐹 ↾ 𝐴)
4 resres 5999 . . . . . . 7 ((𝐹 ↾ dom 𝐹) ↾ 𝐴) = (𝐹 ↾ (dom 𝐹 ∩ 𝐴))
5 resdm 6033 . . . . . . . 8 (Rel 𝐹 → (𝐹 ↾ dom 𝐹) = 𝐹)
65reseq1d 5985 . . . . . . 7 (Rel 𝐹 → ((𝐹 ↾ dom 𝐹) ↾ 𝐴) = (𝐹 ↾ 𝐴))
74, 6eqtr3id 2812 . . . . . 6 (Rel 𝐹 → (𝐹 ↾ (dom 𝐹 ∩ 𝐴)) = (𝐹 ↾ 𝐴))
87rneqd 5932 . . . . 5 (Rel 𝐹 → ran (𝐹 ↾ (dom 𝐹 ∩ 𝐴)) = ran (𝐹 ↾ 𝐴))
93, 8eqtr4id 2817 . . . 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 4137 . . . . . 6 (dom 𝐹 ∩ 𝐴) ⊆ 𝐴
1413a1i 11 . . . . 5 (((𝑈 ∈ Univ ∧ Fun 𝐹 ∧ (𝐹 “ 𝐴) ⊆ 𝑈) ∧ 𝐴 ∈ 𝑈) → (dom 𝐹 ∩ 𝐴) ⊆ 𝐴)
15 gruss 10920 . . . . 5 ((𝑈 ∈ Univ ∧ 𝐴 ∈ 𝑈 ∧ (dom 𝐹 ∩ 𝐴) ⊆ 𝐴) → (dom 𝐹 ∩ 𝐴) ∈ 𝑈)
1611, 12, 14, 15syl3anc 1399 . . . 4 (((𝑈 ∈ Univ ∧ Fun 𝐹 ∧ (𝐹 “ 𝐴) ⊆ 𝑈) ∧ 𝐴 ∈ 𝑈) → (dom 𝐹 ∩ 𝐴) ∈ 𝑈)
17 funforn 6833 . . . . . . . 8 (Fun 𝐹 ↔ 𝐹:dom 𝐹⟶ontoran 𝐹)
18 fof 6826 . . . . . . . 8 (𝐹:dom 𝐹⟶ontoran 𝐹 → 𝐹:dom 𝐹⟶ran 𝐹)
1917, 18sylbi 220 . . . . . . 7 (Fun 𝐹 → 𝐹:dom 𝐹⟶ran 𝐹)
20 inss1 4136 . . . . . . 7 (dom 𝐹 ∩ 𝐴) ⊆ dom 𝐹
21 fssres 6778 . . . . . . 7 ((𝐹:dom 𝐹⟶ran 𝐹 ∧ (dom 𝐹 ∩ 𝐴) ⊆ dom 𝐹) → (𝐹 ↾ (dom 𝐹 ∩ 𝐴)):(dom 𝐹 ∩ 𝐴)⟶ran 𝐹)
2219, 20, 21sylancl 598 . . . . . 6 (Fun 𝐹 → (𝐹 ↾ (dom 𝐹 ∩ 𝐴)):(dom 𝐹 ∩ 𝐴)⟶ran 𝐹)
23 ffn 6739 . . . . . 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 3948 . . . . 5 (((𝑈 ∈ Univ ∧ Fun 𝐹 ∧ (𝐹 “ 𝐴) ⊆ 𝑈) ∧ 𝐴 ∈ 𝑈) → ran (𝐹 ↾ (dom 𝐹 ∩ 𝐴)) ⊆ 𝑈)
27 df-f 6570 . . . . 5 ((𝐹 ↾ (dom 𝐹 ∩ 𝐴)):(dom 𝐹 ∩ 𝐴)⟶𝑈 ↔ ((𝐹 ↾ (dom 𝐹 ∩ 𝐴)) Fn (dom 𝐹 ∩ 𝐴) ∧ ran (𝐹 ↾ (dom 𝐹 ∩ 𝐴)) ⊆ 𝑈))
2824, 26, 27sylanbrc 595 . . . 4 (((𝑈 ∈ Univ ∧ Fun 𝐹 ∧ (𝐹 “ 𝐴) ⊆ 𝑈) ∧ 𝐴 ∈ 𝑈) → (𝐹 ↾ (dom 𝐹 ∩ 𝐴)):(dom 𝐹 ∩ 𝐴)⟶𝑈)
29 grurn 10925 . . . 4 ((𝑈 ∈ Univ ∧ (dom 𝐹 ∩ 𝐴) ∈ 𝑈 ∧ (𝐹 ↾ (dom 𝐹 ∩ 𝐴)):(dom 𝐹 ∩ 𝐴)⟶𝑈) → ran (𝐹 ↾ (dom 𝐹 ∩ 𝐴)) ∈ 𝑈)
3011, 16, 28, 29syl3anc 1399 . . 3 (((𝑈 ∈ Univ ∧ Fun 𝐹 ∧ (𝐹 “ 𝐴) ⊆ 𝑈) ∧ 𝐴 ∈ 𝑈) → ran (𝐹 ↾ (dom 𝐹 ∩ 𝐴)) ∈ 𝑈)
3110, 30eqeltrd 2864 . 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 1570   ∈ wcel 2147   ⊆ wss 3900   ∩ cin 4092  dom cdm 5658  ran crn 5659   ↾ cres 5660   “ cima 5661  Rel wrel 5663  Fun wfun 6560   Fn wfn 6561  ⟶wf 6562  ⟶ontowfo 6564  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-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-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-sbc 3743  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-br 5109  df-opab 5174  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-fo 6572  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