Theorem gruima 10887

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

Step	Hyp	Ref	Expression
1		simpl2 1211	. . . 4 ⊢ (((𝑈 ∈ Univ ∧ Fun 𝐹 ∧ (𝐹 “ 𝐴) ⊆ 𝑈) ∧ 𝐴 ∈ 𝑈) → Fun 𝐹)
2		funrel 6556	. . . 4 ⊢ (Fun 𝐹 → Rel 𝐹)
3		df-ima 5664	. . . . 5 ⊢ (𝐹 “ 𝐴) = ran (𝐹 ↾ 𝐴)
4		resres 5983	. . . . . . 7 ⊢ ((𝐹 ↾ dom 𝐹) ↾ 𝐴) = (𝐹 ↾ (dom 𝐹 ∩ 𝐴))
5		resdm 6015	. . . . . . . 8 ⊢ (Rel 𝐹 → (𝐹 ↾ dom 𝐹) = 𝐹)
6	5	reseq1d 5969	. . . . . . 7 ⊢ (Rel 𝐹 → ((𝐹 ↾ dom 𝐹) ↾ 𝐴) = (𝐹 ↾ 𝐴))
7	4, 6	eqtr3id 2810	. . . . . 6 ⊢ (Rel 𝐹 → (𝐹 ↾ (dom 𝐹 ∩ 𝐴)) = (𝐹 ↾ 𝐴))
8	7	rneqd 5920	. . . . 5 ⊢ (Rel 𝐹 → ran (𝐹 ↾ (dom 𝐹 ∩ 𝐴)) = ran (𝐹 ↾ 𝐴))
9	3, 8	eqtr4id 2815	. . . 4 ⊢ (Rel 𝐹 → (𝐹 “ 𝐴) = ran (𝐹 ↾ (dom 𝐹 ∩ 𝐴)))
10	1, 2, 9	3syl 19	. . 3 ⊢ (((𝑈 ∈ Univ ∧ Fun 𝐹 ∧ (𝐹 “ 𝐴) ⊆ 𝑈) ∧ 𝐴 ∈ 𝑈) → (𝐹 “ 𝐴) = ran (𝐹 ↾ (dom 𝐹 ∩ 𝐴)))
11		simpl1 1210	. . . 4 ⊢ (((𝑈 ∈ Univ ∧ Fun 𝐹 ∧ (𝐹 “ 𝐴) ⊆ 𝑈) ∧ 𝐴 ∈ 𝑈) → 𝑈 ∈ Univ)
12		simpr 490	. . . . 5 ⊢ (((𝑈 ∈ Univ ∧ Fun 𝐹 ∧ (𝐹 “ 𝐴) ⊆ 𝑈) ∧ 𝐴 ∈ 𝑈) → 𝐴 ∈ 𝑈)
13		inss2 4183	. . . . . 6 ⊢ (dom 𝐹 ∩ 𝐴) ⊆ 𝐴
14	13	a1i 11	. . . . 5 ⊢ (((𝑈 ∈ Univ ∧ Fun 𝐹 ∧ (𝐹 “ 𝐴) ⊆ 𝑈) ∧ 𝐴 ∈ 𝑈) → (dom 𝐹 ∩ 𝐴) ⊆ 𝐴)
15		gruss 10881	. . . . 5 ⊢ ((𝑈 ∈ Univ ∧ 𝐴 ∈ 𝑈 ∧ (dom 𝐹 ∩ 𝐴) ⊆ 𝐴) → (dom 𝐹 ∩ 𝐴) ∈ 𝑈)
16	11, 12, 14, 15	syl3anc 1398	. . . 4 ⊢ (((𝑈 ∈ Univ ∧ Fun 𝐹 ∧ (𝐹 “ 𝐴) ⊆ 𝑈) ∧ 𝐴 ∈ 𝑈) → (dom 𝐹 ∩ 𝐴) ∈ 𝑈)
17		funforn 6803	. . . . . . . 8 ⊢ (Fun 𝐹 ↔ 𝐹:dom 𝐹–onto→ran 𝐹)
18		fof 6796	. . . . . . . 8 ⊢ (𝐹:dom 𝐹–onto→ran 𝐹 → 𝐹:dom 𝐹⟶ran 𝐹)
19	17, 18	sylbi 220	. . . . . . 7 ⊢ (Fun 𝐹 → 𝐹:dom 𝐹⟶ran 𝐹)
20		inss1 4182	. . . . . . 7 ⊢ (dom 𝐹 ∩ 𝐴) ⊆ dom 𝐹
21		fssres 6748	. . . . . . 7 ⊢ ((𝐹:dom 𝐹⟶ran 𝐹 ∧ (dom 𝐹 ∩ 𝐴) ⊆ dom 𝐹) → (𝐹 ↾ (dom 𝐹 ∩ 𝐴)):(dom 𝐹 ∩ 𝐴)⟶ran 𝐹)
22	19, 20, 21	sylancl 598	. . . . . 6 ⊢ (Fun 𝐹 → (𝐹 ↾ (dom 𝐹 ∩ 𝐴)):(dom 𝐹 ∩ 𝐴)⟶ran 𝐹)
23		ffn 6709	. . . . . 6 ⊢ ((𝐹 ↾ (dom 𝐹 ∩ 𝐴)):(dom 𝐹 ∩ 𝐴)⟶ran 𝐹 → (𝐹 ↾ (dom 𝐹 ∩ 𝐴)) Fn (dom 𝐹 ∩ 𝐴))
24	1, 22, 23	3syl 19	. . . . 5 ⊢ (((𝑈 ∈ Univ ∧ Fun 𝐹 ∧ (𝐹 “ 𝐴) ⊆ 𝑈) ∧ 𝐴 ∈ 𝑈) → (𝐹 ↾ (dom 𝐹 ∩ 𝐴)) Fn (dom 𝐹 ∩ 𝐴))
25		simpl3 1212	. . . . . 6 ⊢ (((𝑈 ∈ Univ ∧ Fun 𝐹 ∧ (𝐹 “ 𝐴) ⊆ 𝑈) ∧ 𝐴 ∈ 𝑈) → (𝐹 “ 𝐴) ⊆ 𝑈)
26	10, 25	eqsstrrd 3966	. . . . 5 ⊢ (((𝑈 ∈ Univ ∧ Fun 𝐹 ∧ (𝐹 “ 𝐴) ⊆ 𝑈) ∧ 𝐴 ∈ 𝑈) → ran (𝐹 ↾ (dom 𝐹 ∩ 𝐴)) ⊆ 𝑈)
27		df-f 6542	. . . . 5 ⊢ ((𝐹 ↾ (dom 𝐹 ∩ 𝐴)):(dom 𝐹 ∩ 𝐴)⟶𝑈 ↔ ((𝐹 ↾ (dom 𝐹 ∩ 𝐴)) Fn (dom 𝐹 ∩ 𝐴) ∧ ran (𝐹 ↾ (dom 𝐹 ∩ 𝐴)) ⊆ 𝑈))
28	24, 26, 27	sylanbrc 595	. . . 4 ⊢ (((𝑈 ∈ Univ ∧ Fun 𝐹 ∧ (𝐹 “ 𝐴) ⊆ 𝑈) ∧ 𝐴 ∈ 𝑈) → (𝐹 ↾ (dom 𝐹 ∩ 𝐴)):(dom 𝐹 ∩ 𝐴)⟶𝑈)
29		grurn 10886	. . . 4 ⊢ ((𝑈 ∈ Univ ∧ (dom 𝐹 ∩ 𝐴) ∈ 𝑈 ∧ (𝐹 ↾ (dom 𝐹 ∩ 𝐴)):(dom 𝐹 ∩ 𝐴)⟶𝑈) → ran (𝐹 ↾ (dom 𝐹 ∩ 𝐴)) ∈ 𝑈)
30	11, 16, 28, 29	syl3anc 1398	. . 3 ⊢ (((𝑈 ∈ Univ ∧ Fun 𝐹 ∧ (𝐹 “ 𝐴) ⊆ 𝑈) ∧ 𝐴 ∈ 𝑈) → ran (𝐹 ↾ (dom 𝐹 ∩ 𝐴)) ∈ 𝑈)
31	10, 30	eqeltrd 2861	. 2 ⊢ (((𝑈 ∈ Univ ∧ Fun 𝐹 ∧ (𝐹 “ 𝐴) ⊆ 𝑈) ∧ 𝐴 ∈ 𝑈) → (𝐹 “ 𝐴) ∈ 𝑈)
32	31	ex 418	1 ⊢ ((𝑈 ∈ Univ ∧ Fun 𝐹 ∧ (𝐹 “ 𝐴) ⊆ 𝑈) → (𝐴 ∈ 𝑈 → (𝐹 “ 𝐴) ∈ 𝑈))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2145   ∩ cin 3898   ⊆ wss 3899  dom cdm 5651  ran crn 5652   ↾ cres 5653   “ cima 5654  Rel wrel 5656  Fun wfun 6532   Fn wfn 6533  ⟶wf 6534  –onto→wfo 6536  Univcgru 10875

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 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-sep 5249  ax-pow 5327  ax-pr 5391  ax-un 7751

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 2100  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ral 3078  df-rex 3088  df-rab 3414  df-v 3453  df-sbc 3740  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-br 5104  df-opab 5168  df-tr 5213  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 6494  df-fun 6540  df-fn 6541  df-f 6542  df-fo 6544  df-fv 6546  df-ov 7423  df-oprab 7424  df-mpo 7425  df-map 8849  df-gru 10876

This theorem is used by: (None)