Theorem fvmptnn04if 22765

Description: The function values of a mapping from the nonnegative integers with four distinct cases. (Contributed by AV, 10-Nov-2019.)

Hypotheses

Ref	Expression
fvmptnn04if.g	⊢ 𝐺 = (𝑛 ∈ ℕ0 ↦ if(𝑛 = 0, 𝐴, if(𝑛 = 𝑆, 𝐶, if(𝑆 < 𝑛, 𝐷, 𝐵))))
fvmptnn04if.s	⊢ (𝜑 → 𝑆 ∈ ℕ)
fvmptnn04if.n	⊢ (𝜑 → 𝑁 ∈ ℕ0)
fvmptnn04if.y	⊢ (𝜑 → 𝑌 ∈ 𝑉)
fvmptnn04if.a	⊢ ((𝜑 ∧ 𝑁 = 0) → 𝑌 = ⦋𝑁 / 𝑛⦌𝐴)
fvmptnn04if.b	⊢ ((𝜑 ∧ 0 < 𝑁 ∧ 𝑁 < 𝑆) → 𝑌 = ⦋𝑁 / 𝑛⦌𝐵)
fvmptnn04if.c	⊢ ((𝜑 ∧ 𝑁 = 𝑆) → 𝑌 = ⦋𝑁 / 𝑛⦌𝐶)
fvmptnn04if.d	⊢ ((𝜑 ∧ 𝑆 < 𝑁) → 𝑌 = ⦋𝑁 / 𝑛⦌𝐷)

Assertion

Ref	Expression
fvmptnn04if	⊢ (𝜑 → (𝐺‘𝑁) = 𝑌)

Distinct variable groups:   𝑛,𝑁   𝑆,𝑛

Allowed substitution hints:   𝜑(𝑛)   𝐴(𝑛)   𝐵(𝑛)   𝐶(𝑛)   𝐷(𝑛)   𝐺(𝑛)   𝑉(𝑛)   𝑌(𝑛)

Proof of Theorem fvmptnn04if

Step	Hyp	Ref	Expression
1		fvmptnn04if.n	. . 3 ⊢ (𝜑 → 𝑁 ∈ ℕ0)
2		csbif 4532	. . . . 5 ⊢ ⦋𝑁 / 𝑛⦌if(𝑛 = 0, 𝐴, if(𝑛 = 𝑆, 𝐶, if(𝑆 < 𝑛, 𝐷, 𝐵))) = if([𝑁 / 𝑛]𝑛 = 0, ⦋𝑁 / 𝑛⦌𝐴, ⦋𝑁 / 𝑛⦌if(𝑛 = 𝑆, 𝐶, if(𝑆 < 𝑛, 𝐷, 𝐵)))
3		eqsbc1 3784	. . . . . . 7 ⊢ (𝑁 ∈ ℕ0 → ([𝑁 / 𝑛]𝑛 = 0 ↔ 𝑁 = 0))
4	1, 3	syl 17	. . . . . 6 ⊢ (𝜑 → ([𝑁 / 𝑛]𝑛 = 0 ↔ 𝑁 = 0))
5		csbif 4532	. . . . . . 7 ⊢ ⦋𝑁 / 𝑛⦌if(𝑛 = 𝑆, 𝐶, if(𝑆 < 𝑛, 𝐷, 𝐵)) = if([𝑁 / 𝑛]𝑛 = 𝑆, ⦋𝑁 / 𝑛⦌𝐶, ⦋𝑁 / 𝑛⦌if(𝑆 < 𝑛, 𝐷, 𝐵))
6		eqsbc1 3784	. . . . . . . . 9 ⊢ (𝑁 ∈ ℕ0 → ([𝑁 / 𝑛]𝑛 = 𝑆 ↔ 𝑁 = 𝑆))
7	1, 6	syl 17	. . . . . . . 8 ⊢ (𝜑 → ([𝑁 / 𝑛]𝑛 = 𝑆 ↔ 𝑁 = 𝑆))
8		csbif 4532	. . . . . . . . 9 ⊢ ⦋𝑁 / 𝑛⦌if(𝑆 < 𝑛, 𝐷, 𝐵) = if([𝑁 / 𝑛]𝑆 < 𝑛, ⦋𝑁 / 𝑛⦌𝐷, ⦋𝑁 / 𝑛⦌𝐵)
9		sbcbr2g 5151	. . . . . . . . . . . 12 ⊢ (𝑁 ∈ ℕ0 → ([𝑁 / 𝑛]𝑆 < 𝑛 ↔ 𝑆 < ⦋𝑁 / 𝑛⦌𝑛))
10	1, 9	syl 17	. . . . . . . . . . 11 ⊢ (𝜑 → ([𝑁 / 𝑛]𝑆 < 𝑛 ↔ 𝑆 < ⦋𝑁 / 𝑛⦌𝑛))
11		csbvarg 4383	. . . . . . . . . . . . 13 ⊢ (𝑁 ∈ ℕ0 → ⦋𝑁 / 𝑛⦌𝑛 = 𝑁)
12	1, 11	syl 17	. . . . . . . . . . . 12 ⊢ (𝜑 → ⦋𝑁 / 𝑛⦌𝑛 = 𝑁)
13	12	breq2d 5105	. . . . . . . . . . 11 ⊢ (𝜑 → (𝑆 < ⦋𝑁 / 𝑛⦌𝑛 ↔ 𝑆 < 𝑁))
14	10, 13	bitrd 279	. . . . . . . . . 10 ⊢ (𝜑 → ([𝑁 / 𝑛]𝑆 < 𝑛 ↔ 𝑆 < 𝑁))
15	14	ifbid 4498	. . . . . . . . 9 ⊢ (𝜑 → if([𝑁 / 𝑛]𝑆 < 𝑛, ⦋𝑁 / 𝑛⦌𝐷, ⦋𝑁 / 𝑛⦌𝐵) = if(𝑆 < 𝑁, ⦋𝑁 / 𝑛⦌𝐷, ⦋𝑁 / 𝑛⦌𝐵))
16	8, 15	eqtrid 2780	. . . . . . . 8 ⊢ (𝜑 → ⦋𝑁 / 𝑛⦌if(𝑆 < 𝑛, 𝐷, 𝐵) = if(𝑆 < 𝑁, ⦋𝑁 / 𝑛⦌𝐷, ⦋𝑁 / 𝑛⦌𝐵))
17	7, 16	ifbieq2d 4501	. . . . . . 7 ⊢ (𝜑 → if([𝑁 / 𝑛]𝑛 = 𝑆, ⦋𝑁 / 𝑛⦌𝐶, ⦋𝑁 / 𝑛⦌if(𝑆 < 𝑛, 𝐷, 𝐵)) = if(𝑁 = 𝑆, ⦋𝑁 / 𝑛⦌𝐶, if(𝑆 < 𝑁, ⦋𝑁 / 𝑛⦌𝐷, ⦋𝑁 / 𝑛⦌𝐵)))
18	5, 17	eqtrid 2780	. . . . . 6 ⊢ (𝜑 → ⦋𝑁 / 𝑛⦌if(𝑛 = 𝑆, 𝐶, if(𝑆 < 𝑛, 𝐷, 𝐵)) = if(𝑁 = 𝑆, ⦋𝑁 / 𝑛⦌𝐶, if(𝑆 < 𝑁, ⦋𝑁 / 𝑛⦌𝐷, ⦋𝑁 / 𝑛⦌𝐵)))
19	4, 18	ifbieq2d 4501	. . . . 5 ⊢ (𝜑 → if([𝑁 / 𝑛]𝑛 = 0, ⦋𝑁 / 𝑛⦌𝐴, ⦋𝑁 / 𝑛⦌if(𝑛 = 𝑆, 𝐶, if(𝑆 < 𝑛, 𝐷, 𝐵))) = if(𝑁 = 0, ⦋𝑁 / 𝑛⦌𝐴, if(𝑁 = 𝑆, ⦋𝑁 / 𝑛⦌𝐶, if(𝑆 < 𝑁, ⦋𝑁 / 𝑛⦌𝐷, ⦋𝑁 / 𝑛⦌𝐵))))
20	2, 19	eqtrid 2780	. . . 4 ⊢ (𝜑 → ⦋𝑁 / 𝑛⦌if(𝑛 = 0, 𝐴, if(𝑛 = 𝑆, 𝐶, if(𝑆 < 𝑛, 𝐷, 𝐵))) = if(𝑁 = 0, ⦋𝑁 / 𝑛⦌𝐴, if(𝑁 = 𝑆, ⦋𝑁 / 𝑛⦌𝐶, if(𝑆 < 𝑁, ⦋𝑁 / 𝑛⦌𝐷, ⦋𝑁 / 𝑛⦌𝐵))))
21		fvmptnn04if.a	. . . . . 6 ⊢ ((𝜑 ∧ 𝑁 = 0) → 𝑌 = ⦋𝑁 / 𝑛⦌𝐴)
22		fvmptnn04if.y	. . . . . . 7 ⊢ (𝜑 → 𝑌 ∈ 𝑉)
23	22	adantr 480	. . . . . 6 ⊢ ((𝜑 ∧ 𝑁 = 0) → 𝑌 ∈ 𝑉)
24	21, 23	eqeltrrd 2834	. . . . 5 ⊢ ((𝜑 ∧ 𝑁 = 0) → ⦋𝑁 / 𝑛⦌𝐴 ∈ 𝑉)
25		fvmptnn04if.c	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑁 = 𝑆) → 𝑌 = ⦋𝑁 / 𝑛⦌𝐶)
26	25	eqcomd 2739	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑁 = 𝑆) → ⦋𝑁 / 𝑛⦌𝐶 = 𝑌)
27	26	adantlr 715	. . . . . . 7 ⊢ (((𝜑 ∧ ¬ 𝑁 = 0) ∧ 𝑁 = 𝑆) → ⦋𝑁 / 𝑛⦌𝐶 = 𝑌)
28	22	ad2antrr 726	. . . . . . 7 ⊢ (((𝜑 ∧ ¬ 𝑁 = 0) ∧ 𝑁 = 𝑆) → 𝑌 ∈ 𝑉)
29	27, 28	eqeltrd 2833	. . . . . 6 ⊢ (((𝜑 ∧ ¬ 𝑁 = 0) ∧ 𝑁 = 𝑆) → ⦋𝑁 / 𝑛⦌𝐶 ∈ 𝑉)
30		fvmptnn04if.d	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑆 < 𝑁) → 𝑌 = ⦋𝑁 / 𝑛⦌𝐷)
31	30	eqcomd 2739	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑆 < 𝑁) → ⦋𝑁 / 𝑛⦌𝐷 = 𝑌)
32	31	ad4ant14 752	. . . . . . . 8 ⊢ ((((𝜑 ∧ ¬ 𝑁 = 0) ∧ ¬ 𝑁 = 𝑆) ∧ 𝑆 < 𝑁) → ⦋𝑁 / 𝑛⦌𝐷 = 𝑌)
33	22	ad3antrrr 730	. . . . . . . 8 ⊢ ((((𝜑 ∧ ¬ 𝑁 = 0) ∧ ¬ 𝑁 = 𝑆) ∧ 𝑆 < 𝑁) → 𝑌 ∈ 𝑉)
34	32, 33	eqeltrd 2833	. . . . . . 7 ⊢ ((((𝜑 ∧ ¬ 𝑁 = 0) ∧ ¬ 𝑁 = 𝑆) ∧ 𝑆 < 𝑁) → ⦋𝑁 / 𝑛⦌𝐷 ∈ 𝑉)
35		simplll 774	. . . . . . . . 9 ⊢ ((((𝜑 ∧ ¬ 𝑁 = 0) ∧ ¬ 𝑁 = 𝑆) ∧ ¬ 𝑆 < 𝑁) → 𝜑)
36		anass 468	. . . . . . . . . . . . 13 ⊢ (((¬ 𝑁 = 0 ∧ ¬ 𝑁 = 𝑆) ∧ ¬ 𝑆 < 𝑁) ↔ (¬ 𝑁 = 0 ∧ (¬ 𝑁 = 𝑆 ∧ ¬ 𝑆 < 𝑁)))
37	36	bicomi 224	. . . . . . . . . . . 12 ⊢ ((¬ 𝑁 = 0 ∧ (¬ 𝑁 = 𝑆 ∧ ¬ 𝑆 < 𝑁)) ↔ ((¬ 𝑁 = 0 ∧ ¬ 𝑁 = 𝑆) ∧ ¬ 𝑆 < 𝑁))
38	37	bianassc 643	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (¬ 𝑁 = 0 ∧ (¬ 𝑁 = 𝑆 ∧ ¬ 𝑆 < 𝑁))) ↔ (((¬ 𝑁 = 0 ∧ ¬ 𝑁 = 𝑆) ∧ 𝜑) ∧ ¬ 𝑆 < 𝑁))
39		an32 646	. . . . . . . . . . . . 13 ⊢ (((¬ 𝑁 = 0 ∧ ¬ 𝑁 = 𝑆) ∧ 𝜑) ↔ ((¬ 𝑁 = 0 ∧ 𝜑) ∧ ¬ 𝑁 = 𝑆))
40		ancom 460	. . . . . . . . . . . . . 14 ⊢ ((¬ 𝑁 = 0 ∧ 𝜑) ↔ (𝜑 ∧ ¬ 𝑁 = 0))
41	40	anbi1i 624	. . . . . . . . . . . . 13 ⊢ (((¬ 𝑁 = 0 ∧ 𝜑) ∧ ¬ 𝑁 = 𝑆) ↔ ((𝜑 ∧ ¬ 𝑁 = 0) ∧ ¬ 𝑁 = 𝑆))
42	39, 41	bitri 275	. . . . . . . . . . . 12 ⊢ (((¬ 𝑁 = 0 ∧ ¬ 𝑁 = 𝑆) ∧ 𝜑) ↔ ((𝜑 ∧ ¬ 𝑁 = 0) ∧ ¬ 𝑁 = 𝑆))
43	42	anbi1i 624	. . . . . . . . . . 11 ⊢ ((((¬ 𝑁 = 0 ∧ ¬ 𝑁 = 𝑆) ∧ 𝜑) ∧ ¬ 𝑆 < 𝑁) ↔ (((𝜑 ∧ ¬ 𝑁 = 0) ∧ ¬ 𝑁 = 𝑆) ∧ ¬ 𝑆 < 𝑁))
44	38, 43	bitri 275	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (¬ 𝑁 = 0 ∧ (¬ 𝑁 = 𝑆 ∧ ¬ 𝑆 < 𝑁))) ↔ (((𝜑 ∧ ¬ 𝑁 = 0) ∧ ¬ 𝑁 = 𝑆) ∧ ¬ 𝑆 < 𝑁))
45		df-ne 2930	. . . . . . . . . . . . 13 ⊢ (𝑁 ≠ 0 ↔ ¬ 𝑁 = 0)
46		elnnne0 12402	. . . . . . . . . . . . . . 15 ⊢ (𝑁 ∈ ℕ ↔ (𝑁 ∈ ℕ0 ∧ 𝑁 ≠ 0))
47		nngt0 12163	. . . . . . . . . . . . . . 15 ⊢ (𝑁 ∈ ℕ → 0 < 𝑁)
48	46, 47	sylbir 235	. . . . . . . . . . . . . 14 ⊢ ((𝑁 ∈ ℕ0 ∧ 𝑁 ≠ 0) → 0 < 𝑁)
49	48	expcom 413	. . . . . . . . . . . . 13 ⊢ (𝑁 ≠ 0 → (𝑁 ∈ ℕ0 → 0 < 𝑁))
50	45, 49	sylbir 235	. . . . . . . . . . . 12 ⊢ (¬ 𝑁 = 0 → (𝑁 ∈ ℕ0 → 0 < 𝑁))
51	50	adantr 480	. . . . . . . . . . 11 ⊢ ((¬ 𝑁 = 0 ∧ (¬ 𝑁 = 𝑆 ∧ ¬ 𝑆 < 𝑁)) → (𝑁 ∈ ℕ0 → 0 < 𝑁))
52	1, 51	mpan9 506	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (¬ 𝑁 = 0 ∧ (¬ 𝑁 = 𝑆 ∧ ¬ 𝑆 < 𝑁))) → 0 < 𝑁)
53	44, 52	sylbir 235	. . . . . . . . 9 ⊢ ((((𝜑 ∧ ¬ 𝑁 = 0) ∧ ¬ 𝑁 = 𝑆) ∧ ¬ 𝑆 < 𝑁) → 0 < 𝑁)
54	1	nn0red 12450	. . . . . . . . . . . 12 ⊢ (𝜑 → 𝑁 ∈ ℝ)
55	54	adantr 480	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (¬ 𝑁 = 0 ∧ (¬ 𝑁 = 𝑆 ∧ ¬ 𝑆 < 𝑁))) → 𝑁 ∈ ℝ)
56		fvmptnn04if.s	. . . . . . . . . . . . 13 ⊢ (𝜑 → 𝑆 ∈ ℕ)
57	56	nnred 12147	. . . . . . . . . . . 12 ⊢ (𝜑 → 𝑆 ∈ ℝ)
58	57	adantr 480	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (¬ 𝑁 = 0 ∧ (¬ 𝑁 = 𝑆 ∧ ¬ 𝑆 < 𝑁))) → 𝑆 ∈ ℝ)
59	54, 57	lenltd 11266	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → (𝑁 ≤ 𝑆 ↔ ¬ 𝑆 < 𝑁))
60	59	biimprd 248	. . . . . . . . . . . . . 14 ⊢ (𝜑 → (¬ 𝑆 < 𝑁 → 𝑁 ≤ 𝑆))
61	60	adantld 490	. . . . . . . . . . . . 13 ⊢ (𝜑 → ((¬ 𝑁 = 𝑆 ∧ ¬ 𝑆 < 𝑁) → 𝑁 ≤ 𝑆))
62	61	adantld 490	. . . . . . . . . . . 12 ⊢ (𝜑 → ((¬ 𝑁 = 0 ∧ (¬ 𝑁 = 𝑆 ∧ ¬ 𝑆 < 𝑁)) → 𝑁 ≤ 𝑆))
63	62	imp 406	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (¬ 𝑁 = 0 ∧ (¬ 𝑁 = 𝑆 ∧ ¬ 𝑆 < 𝑁))) → 𝑁 ≤ 𝑆)
64		nesym 2985	. . . . . . . . . . . . . 14 ⊢ (𝑆 ≠ 𝑁 ↔ ¬ 𝑁 = 𝑆)
65	64	biimpri 228	. . . . . . . . . . . . 13 ⊢ (¬ 𝑁 = 𝑆 → 𝑆 ≠ 𝑁)
66	65	adantr 480	. . . . . . . . . . . 12 ⊢ ((¬ 𝑁 = 𝑆 ∧ ¬ 𝑆 < 𝑁) → 𝑆 ≠ 𝑁)
67	66	ad2antll 729	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (¬ 𝑁 = 0 ∧ (¬ 𝑁 = 𝑆 ∧ ¬ 𝑆 < 𝑁))) → 𝑆 ≠ 𝑁)
68	55, 58, 63, 67	leneltd 11274	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (¬ 𝑁 = 0 ∧ (¬ 𝑁 = 𝑆 ∧ ¬ 𝑆 < 𝑁))) → 𝑁 < 𝑆)
69	44, 68	sylbir 235	. . . . . . . . 9 ⊢ ((((𝜑 ∧ ¬ 𝑁 = 0) ∧ ¬ 𝑁 = 𝑆) ∧ ¬ 𝑆 < 𝑁) → 𝑁 < 𝑆)
70		fvmptnn04if.b	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 0 < 𝑁 ∧ 𝑁 < 𝑆) → 𝑌 = ⦋𝑁 / 𝑛⦌𝐵)
71	70	eqcomd 2739	. . . . . . . . 9 ⊢ ((𝜑 ∧ 0 < 𝑁 ∧ 𝑁 < 𝑆) → ⦋𝑁 / 𝑛⦌𝐵 = 𝑌)
72	35, 53, 69, 71	syl3anc 1373	. . . . . . . 8 ⊢ ((((𝜑 ∧ ¬ 𝑁 = 0) ∧ ¬ 𝑁 = 𝑆) ∧ ¬ 𝑆 < 𝑁) → ⦋𝑁 / 𝑛⦌𝐵 = 𝑌)
73	22	ad3antrrr 730	. . . . . . . 8 ⊢ ((((𝜑 ∧ ¬ 𝑁 = 0) ∧ ¬ 𝑁 = 𝑆) ∧ ¬ 𝑆 < 𝑁) → 𝑌 ∈ 𝑉)
74	72, 73	eqeltrd 2833	. . . . . . 7 ⊢ ((((𝜑 ∧ ¬ 𝑁 = 0) ∧ ¬ 𝑁 = 𝑆) ∧ ¬ 𝑆 < 𝑁) → ⦋𝑁 / 𝑛⦌𝐵 ∈ 𝑉)
75	34, 74	ifclda 4510	. . . . . 6 ⊢ (((𝜑 ∧ ¬ 𝑁 = 0) ∧ ¬ 𝑁 = 𝑆) → if(𝑆 < 𝑁, ⦋𝑁 / 𝑛⦌𝐷, ⦋𝑁 / 𝑛⦌𝐵) ∈ 𝑉)
76	29, 75	ifclda 4510	. . . . 5 ⊢ ((𝜑 ∧ ¬ 𝑁 = 0) → if(𝑁 = 𝑆, ⦋𝑁 / 𝑛⦌𝐶, if(𝑆 < 𝑁, ⦋𝑁 / 𝑛⦌𝐷, ⦋𝑁 / 𝑛⦌𝐵)) ∈ 𝑉)
77	24, 76	ifclda 4510	. . . 4 ⊢ (𝜑 → if(𝑁 = 0, ⦋𝑁 / 𝑛⦌𝐴, if(𝑁 = 𝑆, ⦋𝑁 / 𝑛⦌𝐶, if(𝑆 < 𝑁, ⦋𝑁 / 𝑛⦌𝐷, ⦋𝑁 / 𝑛⦌𝐵))) ∈ 𝑉)
78	20, 77	eqeltrd 2833	. . 3 ⊢ (𝜑 → ⦋𝑁 / 𝑛⦌if(𝑛 = 0, 𝐴, if(𝑛 = 𝑆, 𝐶, if(𝑆 < 𝑛, 𝐷, 𝐵))) ∈ 𝑉)
79		fvmptnn04if.g	. . . 4 ⊢ 𝐺 = (𝑛 ∈ ℕ0 ↦ if(𝑛 = 0, 𝐴, if(𝑛 = 𝑆, 𝐶, if(𝑆 < 𝑛, 𝐷, 𝐵))))
80	79	fvmpts 6938	. . 3 ⊢ ((𝑁 ∈ ℕ0 ∧ ⦋𝑁 / 𝑛⦌if(𝑛 = 0, 𝐴, if(𝑛 = 𝑆, 𝐶, if(𝑆 < 𝑛, 𝐷, 𝐵))) ∈ 𝑉) → (𝐺‘𝑁) = ⦋𝑁 / 𝑛⦌if(𝑛 = 0, 𝐴, if(𝑛 = 𝑆, 𝐶, if(𝑆 < 𝑛, 𝐷, 𝐵))))
81	1, 78, 80	syl2anc 584	. 2 ⊢ (𝜑 → (𝐺‘𝑁) = ⦋𝑁 / 𝑛⦌if(𝑛 = 0, 𝐴, if(𝑛 = 𝑆, 𝐶, if(𝑆 < 𝑛, 𝐷, 𝐵))))
82	21	eqcomd 2739	. . 3 ⊢ ((𝜑 ∧ 𝑁 = 0) → ⦋𝑁 / 𝑛⦌𝐴 = 𝑌)
83	32, 72	ifeqda 4511	. . . 4 ⊢ (((𝜑 ∧ ¬ 𝑁 = 0) ∧ ¬ 𝑁 = 𝑆) → if(𝑆 < 𝑁, ⦋𝑁 / 𝑛⦌𝐷, ⦋𝑁 / 𝑛⦌𝐵) = 𝑌)
84	27, 83	ifeqda 4511	. . 3 ⊢ ((𝜑 ∧ ¬ 𝑁 = 0) → if(𝑁 = 𝑆, ⦋𝑁 / 𝑛⦌𝐶, if(𝑆 < 𝑁, ⦋𝑁 / 𝑛⦌𝐷, ⦋𝑁 / 𝑛⦌𝐵)) = 𝑌)
85	82, 84	ifeqda 4511	. 2 ⊢ (𝜑 → if(𝑁 = 0, ⦋𝑁 / 𝑛⦌𝐴, if(𝑁 = 𝑆, ⦋𝑁 / 𝑛⦌𝐶, if(𝑆 < 𝑁, ⦋𝑁 / 𝑛⦌𝐷, ⦋𝑁 / 𝑛⦌𝐵))) = 𝑌)
86	81, 20, 85	3eqtrd 2772	1 ⊢ (𝜑 → (𝐺‘𝑁) = 𝑌)

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 206   ∧ wa 395   ∧ w3a 1086   = wceq 1541   ∈ wcel 2113   ≠ wne 2929  [wsbc 3737  ⦋csb 3846  ifcif 4474   class class class wbr 5093   ↦ cmpt 5174  ‘cfv 6486  ℝcr 11012  0cc0 11013   < clt 11153   ≤ cle 11154  ℕcn 12132  ℕ₀cn0 12388

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-10 2146  ax-11 2162  ax-12 2182  ax-ext 2705  ax-sep 5236  ax-nul 5246  ax-pow 5305  ax-pr 5372  ax-un 7674  ax-resscn 11070  ax-1cn 11071  ax-icn 11072  ax-addcl 11073  ax-addrcl 11074  ax-mulcl 11075  ax-mulrcl 11076  ax-mulcom 11077  ax-addass 11078  ax-mulass 11079  ax-distr 11080  ax-i2m1 11081  ax-1ne0 11082  ax-1rid 11083  ax-rnegex 11084  ax-rrecex 11085  ax-cnre 11086  ax-pre-lttri 11087  ax-pre-lttrn 11088  ax-pre-ltadd 11089  ax-pre-mulgt0 11090

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2537  df-eu 2566  df-clab 2712  df-cleq 2725  df-clel 2808  df-nfc 2882  df-ne 2930  df-nel 3034  df-ral 3049  df-rex 3058  df-reu 3348  df-rab 3397  df-v 3439  df-sbc 3738  df-csb 3847  df-dif 3901  df-un 3903  df-in 3905  df-ss 3915  df-pss 3918  df-nul 4283  df-if 4475  df-pw 4551  df-sn 4576  df-pr 4578  df-op 4582  df-uni 4859  df-iun 4943  df-br 5094  df-opab 5156  df-mpt 5175  df-tr 5201  df-id 5514  df-eprel 5519  df-po 5527  df-so 5528  df-fr 5572  df-we 5574  df-xp 5625  df-rel 5626  df-cnv 5627  df-co 5628  df-dm 5629  df-rn 5630  df-res 5631  df-ima 5632  df-pred 6253  df-ord 6314  df-on 6315  df-lim 6316  df-suc 6317  df-iota 6442  df-fun 6488  df-fn 6489  df-f 6490  df-f1 6491  df-fo 6492  df-f1o 6493  df-fv 6494  df-riota 7309  df-ov 7355  df-oprab 7356  df-mpo 7357  df-om 7803  df-2nd 7928  df-frecs 8217  df-wrecs 8248  df-recs 8297  df-rdg 8335  df-er 8628  df-en 8876  df-dom 8877  df-sdom 8878  df-pnf 11155  df-mnf 11156  df-xr 11157  df-ltxr 11158  df-le 11159  df-sub 11353  df-neg 11354  df-nn 12133  df-n0 12389

This theorem is referenced by:  fvmptnn04ifa  22766  fvmptnn04ifb  22767  fvmptnn04ifc  22768  fvmptnn04ifd  22769