Metamath Proof Explorer


Theorem ofoaid1

Description: Identity law for component wise addition of ordinal-yielding functions. (Contributed by RP, 5-Jan-2025)

Ref Expression
Assertion ofoaid1 ⊢ A ∈ V ∧ B ∈ On ∧ F ∈ B A → F + 𝑜 f A × ∅ = F

Proof

Step Hyp Ref Expression
1 simpll ⊢ A ∈ V ∧ B ∈ On ∧ F ∈ B A → A ∈ V
2 onss ⊢ B ∈ On → B ⊆ On
3 sstr ⊢ ran ⁡ F ⊆ B ∧ B ⊆ On → ran ⁡ F ⊆ On
4 3 expcom ⊢ B ⊆ On → ran ⁡ F ⊆ B → ran ⁡ F ⊆ On
5 2 4 syl ⊢ B ∈ On → ran ⁡ F ⊆ B → ran ⁡ F ⊆ On
6 5 anim2d ⊢ B ∈ On → F Fn A ∧ ran ⁡ F ⊆ B → F Fn A ∧ ran ⁡ F ⊆ On
7 df-f ⊢ F : A ⟶ B ↔ F Fn A ∧ ran ⁡ F ⊆ B
8 df-f ⊢ F : A ⟶ On ↔ F Fn A ∧ ran ⁡ F ⊆ On
9 6 7 8 3imtr4g ⊢ B ∈ On → F : A ⟶ B → F : A ⟶ On
10 elmapi ⊢ F ∈ B A → F : A ⟶ B
11 9 10 impel ⊢ B ∈ On ∧ F ∈ B A → F : A ⟶ On
12 11 adantll ⊢ A ∈ V ∧ B ∈ On ∧ F ∈ B A → F : A ⟶ On
13 peano1 ⊢ ∅ ∈ ω
14 fnconstg ⊢ ∅ ∈ ω → A × ∅ Fn A
15 13 14 mp1i ⊢ A ∈ V ∧ B ∈ On ∧ F ∈ B A → A × ∅ Fn A
16 simp2 ⊢ A ∈ V ∧ F : A ⟶ On ∧ A × ∅ Fn A → F : A ⟶ On
17 16 ffnd ⊢ A ∈ V ∧ F : A ⟶ On ∧ A × ∅ Fn A → F Fn A
18 simp3 ⊢ A ∈ V ∧ F : A ⟶ On ∧ A × ∅ Fn A → A × ∅ Fn A
19 simp1 ⊢ A ∈ V ∧ F : A ⟶ On ∧ A × ∅ Fn A → A ∈ V
20 inidm ⊢ A ∩ A = A
21 17 18 19 19 20 offn ⊢ A ∈ V ∧ F : A ⟶ On ∧ A × ∅ Fn A → F + 𝑜 f A × ∅ Fn A
22 17 18 jca ⊢ A ∈ V ∧ F : A ⟶ On ∧ A × ∅ Fn A → F Fn A ∧ A × ∅ Fn A
23 22 adantr ⊢ A ∈ V ∧ F : A ⟶ On ∧ A × ∅ Fn A ∧ a ∈ A → F Fn A ∧ A × ∅ Fn A
24 19 adantr ⊢ A ∈ V ∧ F : A ⟶ On ∧ A × ∅ Fn A ∧ a ∈ A → A ∈ V
25 simpr ⊢ A ∈ V ∧ F : A ⟶ On ∧ A × ∅ Fn A ∧ a ∈ A → a ∈ A
26 fnfvof ⊢ F Fn A ∧ A × ∅ Fn A ∧ A ∈ V ∧ a ∈ A → F + 𝑜 f A × ∅ ⁡ a = F ⁡ a + 𝑜 A × ∅ ⁡ a
27 23 24 25 26 syl12anc ⊢ A ∈ V ∧ F : A ⟶ On ∧ A × ∅ Fn A ∧ a ∈ A → F + 𝑜 f A × ∅ ⁡ a = F ⁡ a + 𝑜 A × ∅ ⁡ a
28 fvconst2g ⊢ ∅ ∈ ω ∧ a ∈ A → A × ∅ ⁡ a = ∅
29 13 25 28 sylancr ⊢ A ∈ V ∧ F : A ⟶ On ∧ A × ∅ Fn A ∧ a ∈ A → A × ∅ ⁡ a = ∅
30 29 oveq2d ⊢ A ∈ V ∧ F : A ⟶ On ∧ A × ∅ Fn A ∧ a ∈ A → F ⁡ a + 𝑜 A × ∅ ⁡ a = F ⁡ a + 𝑜 ∅
31 16 ffvelcdmda ⊢ A ∈ V ∧ F : A ⟶ On ∧ A × ∅ Fn A ∧ a ∈ A → F ⁡ a ∈ On
32 oa0 ⊢ F ⁡ a ∈ On → F ⁡ a + 𝑜 ∅ = F ⁡ a
33 31 32 syl ⊢ A ∈ V ∧ F : A ⟶ On ∧ A × ∅ Fn A ∧ a ∈ A → F ⁡ a + 𝑜 ∅ = F ⁡ a
34 27 30 33 3eqtrd ⊢ A ∈ V ∧ F : A ⟶ On ∧ A × ∅ Fn A ∧ a ∈ A → F + 𝑜 f A × ∅ ⁡ a = F ⁡ a
35 21 17 34 eqfnfvd ⊢ A ∈ V ∧ F : A ⟶ On ∧ A × ∅ Fn A → F + 𝑜 f A × ∅ = F
36 1 12 15 35 syl3anc ⊢ A ∈ V ∧ B ∈ On ∧ F ∈ B A → F + 𝑜 f A × ∅ = F