Proof of Theorem gruima
Step | Hyp | Ref
| Expression |
1 | | simpl2 1085 |
. . . 4
⊢ (((𝑈 ∈ Univ ∧ Fun 𝐹 ∧ (𝐹 “ 𝐴) ⊆ 𝑈) ∧ 𝐴 ∈ 𝑈) → Fun 𝐹) |
2 | | funrel 5943 |
. . . 4
⊢ (Fun
𝐹 → Rel 𝐹) |
3 | | resres 5444 |
. . . . . . 7
⊢ ((𝐹 ↾ dom 𝐹) ↾ 𝐴) = (𝐹 ↾ (dom 𝐹 ∩ 𝐴)) |
4 | | resdm 5476 |
. . . . . . . 8
⊢ (Rel
𝐹 → (𝐹 ↾ dom 𝐹) = 𝐹) |
5 | 4 | reseq1d 5427 |
. . . . . . 7
⊢ (Rel
𝐹 → ((𝐹 ↾ dom 𝐹) ↾ 𝐴) = (𝐹 ↾ 𝐴)) |
6 | 3, 5 | syl5eqr 2699 |
. . . . . 6
⊢ (Rel
𝐹 → (𝐹 ↾ (dom 𝐹 ∩ 𝐴)) = (𝐹 ↾ 𝐴)) |
7 | 6 | rneqd 5385 |
. . . . 5
⊢ (Rel
𝐹 → ran (𝐹 ↾ (dom 𝐹 ∩ 𝐴)) = ran (𝐹 ↾ 𝐴)) |
8 | | df-ima 5156 |
. . . . 5
⊢ (𝐹 “ 𝐴) = ran (𝐹 ↾ 𝐴) |
9 | 7, 8 | syl6reqr 2704 |
. . . 4
⊢ (Rel
𝐹 → (𝐹 “ 𝐴) = ran (𝐹 ↾ (dom 𝐹 ∩ 𝐴))) |
10 | 1, 2, 9 | 3syl 18 |
. . 3
⊢ (((𝑈 ∈ Univ ∧ Fun 𝐹 ∧ (𝐹 “ 𝐴) ⊆ 𝑈) ∧ 𝐴 ∈ 𝑈) → (𝐹 “ 𝐴) = ran (𝐹 ↾ (dom 𝐹 ∩ 𝐴))) |
11 | | simpl1 1084 |
. . . 4
⊢ (((𝑈 ∈ Univ ∧ Fun 𝐹 ∧ (𝐹 “ 𝐴) ⊆ 𝑈) ∧ 𝐴 ∈ 𝑈) → 𝑈 ∈ Univ) |
12 | | simpr 476 |
. . . . 5
⊢ (((𝑈 ∈ Univ ∧ Fun 𝐹 ∧ (𝐹 “ 𝐴) ⊆ 𝑈) ∧ 𝐴 ∈ 𝑈) → 𝐴 ∈ 𝑈) |
13 | | inss2 3867 |
. . . . . 6
⊢ (dom
𝐹 ∩ 𝐴) ⊆ 𝐴 |
14 | 13 | a1i 11 |
. . . . 5
⊢ (((𝑈 ∈ Univ ∧ Fun 𝐹 ∧ (𝐹 “ 𝐴) ⊆ 𝑈) ∧ 𝐴 ∈ 𝑈) → (dom 𝐹 ∩ 𝐴) ⊆ 𝐴) |
15 | | gruss 9656 |
. . . . 5
⊢ ((𝑈 ∈ Univ ∧ 𝐴 ∈ 𝑈 ∧ (dom 𝐹 ∩ 𝐴) ⊆ 𝐴) → (dom 𝐹 ∩ 𝐴) ∈ 𝑈) |
16 | 11, 12, 14, 15 | syl3anc 1366 |
. . . 4
⊢ (((𝑈 ∈ Univ ∧ Fun 𝐹 ∧ (𝐹 “ 𝐴) ⊆ 𝑈) ∧ 𝐴 ∈ 𝑈) → (dom 𝐹 ∩ 𝐴) ∈ 𝑈) |
17 | | funforn 6160 |
. . . . . . . 8
⊢ (Fun
𝐹 ↔ 𝐹:dom 𝐹–onto→ran 𝐹) |
18 | | fof 6153 |
. . . . . . . 8
⊢ (𝐹:dom 𝐹–onto→ran 𝐹 → 𝐹:dom 𝐹⟶ran 𝐹) |
19 | 17, 18 | sylbi 207 |
. . . . . . 7
⊢ (Fun
𝐹 → 𝐹:dom 𝐹⟶ran 𝐹) |
20 | | inss1 3866 |
. . . . . . 7
⊢ (dom
𝐹 ∩ 𝐴) ⊆ dom 𝐹 |
21 | | fssres 6108 |
. . . . . . 7
⊢ ((𝐹:dom 𝐹⟶ran 𝐹 ∧ (dom 𝐹 ∩ 𝐴) ⊆ dom 𝐹) → (𝐹 ↾ (dom 𝐹 ∩ 𝐴)):(dom 𝐹 ∩ 𝐴)⟶ran 𝐹) |
22 | 19, 20, 21 | sylancl 695 |
. . . . . 6
⊢ (Fun
𝐹 → (𝐹 ↾ (dom 𝐹 ∩ 𝐴)):(dom 𝐹 ∩ 𝐴)⟶ran 𝐹) |
23 | | ffn 6083 |
. . . . . 6
⊢ ((𝐹 ↾ (dom 𝐹 ∩ 𝐴)):(dom 𝐹 ∩ 𝐴)⟶ran 𝐹 → (𝐹 ↾ (dom 𝐹 ∩ 𝐴)) Fn (dom 𝐹 ∩ 𝐴)) |
24 | 1, 22, 23 | 3syl 18 |
. . . . 5
⊢ (((𝑈 ∈ Univ ∧ Fun 𝐹 ∧ (𝐹 “ 𝐴) ⊆ 𝑈) ∧ 𝐴 ∈ 𝑈) → (𝐹 ↾ (dom 𝐹 ∩ 𝐴)) Fn (dom 𝐹 ∩ 𝐴)) |
25 | | simpl3 1086 |
. . . . . 6
⊢ (((𝑈 ∈ Univ ∧ Fun 𝐹 ∧ (𝐹 “ 𝐴) ⊆ 𝑈) ∧ 𝐴 ∈ 𝑈) → (𝐹 “ 𝐴) ⊆ 𝑈) |
26 | 10, 25 | eqsstr3d 3673 |
. . . . 5
⊢ (((𝑈 ∈ Univ ∧ Fun 𝐹 ∧ (𝐹 “ 𝐴) ⊆ 𝑈) ∧ 𝐴 ∈ 𝑈) → ran (𝐹 ↾ (dom 𝐹 ∩ 𝐴)) ⊆ 𝑈) |
27 | | df-f 5930 |
. . . . 5
⊢ ((𝐹 ↾ (dom 𝐹 ∩ 𝐴)):(dom 𝐹 ∩ 𝐴)⟶𝑈 ↔ ((𝐹 ↾ (dom 𝐹 ∩ 𝐴)) Fn (dom 𝐹 ∩ 𝐴) ∧ ran (𝐹 ↾ (dom 𝐹 ∩ 𝐴)) ⊆ 𝑈)) |
28 | 24, 26, 27 | sylanbrc 699 |
. . . 4
⊢ (((𝑈 ∈ Univ ∧ Fun 𝐹 ∧ (𝐹 “ 𝐴) ⊆ 𝑈) ∧ 𝐴 ∈ 𝑈) → (𝐹 ↾ (dom 𝐹 ∩ 𝐴)):(dom 𝐹 ∩ 𝐴)⟶𝑈) |
29 | | grurn 9661 |
. . . 4
⊢ ((𝑈 ∈ Univ ∧ (dom 𝐹 ∩ 𝐴) ∈ 𝑈 ∧ (𝐹 ↾ (dom 𝐹 ∩ 𝐴)):(dom 𝐹 ∩ 𝐴)⟶𝑈) → ran (𝐹 ↾ (dom 𝐹 ∩ 𝐴)) ∈ 𝑈) |
30 | 11, 16, 28, 29 | syl3anc 1366 |
. . 3
⊢ (((𝑈 ∈ Univ ∧ Fun 𝐹 ∧ (𝐹 “ 𝐴) ⊆ 𝑈) ∧ 𝐴 ∈ 𝑈) → ran (𝐹 ↾ (dom 𝐹 ∩ 𝐴)) ∈ 𝑈) |
31 | 10, 30 | eqeltrd 2730 |
. 2
⊢ (((𝑈 ∈ Univ ∧ Fun 𝐹 ∧ (𝐹 “ 𝐴) ⊆ 𝑈) ∧ 𝐴 ∈ 𝑈) → (𝐹 “ 𝐴) ∈ 𝑈) |
32 | 31 | ex 449 |
1
⊢ ((𝑈 ∈ Univ ∧ Fun 𝐹 ∧ (𝐹 “ 𝐴) ⊆ 𝑈) → (𝐴 ∈ 𝑈 → (𝐹 “ 𝐴) ∈ 𝑈)) |