Database
SUPPLEMENTARY MATERIAL (USERS' MATHBOXES)
Mathbox for Richard Penner
Exploring Higher Homotopy via Kerodon
Simplicial Sets
k0004lem1
Next ⟩
k0004lem2
Metamath Proof Explorer
Ascii
Unicode
Theorem
k0004lem1
Description:
Application of
ssin
to range of a function.
(Contributed by
RP
, 1-Apr-2021)
Ref
Expression
Assertion
k0004lem1
⊢
D
=
B
∩
C
→
F
:
A
⟶
B
∧
F
A
⊆
C
↔
F
:
A
⟶
D
Proof
Step
Hyp
Ref
Expression
1
fnima
⊢
F
Fn
A
→
F
A
=
ran
⁡
F
2
1
sseq1d
⊢
F
Fn
A
→
F
A
⊆
C
↔
ran
⁡
F
⊆
C
3
2
anbi2d
⊢
F
Fn
A
→
ran
⁡
F
⊆
B
∧
F
A
⊆
C
↔
ran
⁡
F
⊆
B
∧
ran
⁡
F
⊆
C
4
ssin
⊢
ran
⁡
F
⊆
B
∧
ran
⁡
F
⊆
C
↔
ran
⁡
F
⊆
B
∩
C
5
3
4
bitrdi
⊢
F
Fn
A
→
ran
⁡
F
⊆
B
∧
F
A
⊆
C
↔
ran
⁡
F
⊆
B
∩
C
6
5
pm5.32i
⊢
F
Fn
A
∧
ran
⁡
F
⊆
B
∧
F
A
⊆
C
↔
F
Fn
A
∧
ran
⁡
F
⊆
B
∩
C
7
df-f
⊢
F
:
A
⟶
B
↔
F
Fn
A
∧
ran
⁡
F
⊆
B
8
7
anbi1i
⊢
F
:
A
⟶
B
∧
F
A
⊆
C
↔
F
Fn
A
∧
ran
⁡
F
⊆
B
∧
F
A
⊆
C
9
anass
⊢
F
Fn
A
∧
ran
⁡
F
⊆
B
∧
F
A
⊆
C
↔
F
Fn
A
∧
ran
⁡
F
⊆
B
∧
F
A
⊆
C
10
8
9
bitri
⊢
F
:
A
⟶
B
∧
F
A
⊆
C
↔
F
Fn
A
∧
ran
⁡
F
⊆
B
∧
F
A
⊆
C
11
df-f
⊢
F
:
A
⟶
B
∩
C
↔
F
Fn
A
∧
ran
⁡
F
⊆
B
∩
C
12
6
10
11
3bitr4i
⊢
F
:
A
⟶
B
∧
F
A
⊆
C
↔
F
:
A
⟶
B
∩
C
13
feq3
⊢
D
=
B
∩
C
→
F
:
A
⟶
D
↔
F
:
A
⟶
B
∩
C
14
12
13
bitr4id
⊢
D
=
B
∩
C
→
F
:
A
⟶
B
∧
F
A
⊆
C
↔
F
:
A
⟶
D