Theorem gsumbagdiaglem 21837

Description: Lemma for gsumbagdiag 21838. (Contributed by Mario Carneiro, 5-Jan-2015.) Remove a sethood hypothesis. (Revised by SN, 6-Aug-2024.)

Hypotheses

Ref	Expression
gsumbagdiag.d	⊢ 𝐷 = {𝑓 ∈ (ℕ0 ↑m 𝐼) ∣ (◡𝑓 “ ℕ) ∈ Fin}
gsumbagdiag.s	⊢ 𝑆 = {𝑦 ∈ 𝐷 ∣ 𝑦 ∘r ≤ 𝐹}
gsumbagdiag.f	⊢ (𝜑 → 𝐹 ∈ 𝐷)

Assertion

Ref	Expression
gsumbagdiaglem	⊢ ((𝜑 ∧ (𝑋 ∈ 𝑆 ∧ 𝑌 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ (𝐹 ∘f − 𝑋)})) → (𝑌 ∈ 𝑆 ∧ 𝑋 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ (𝐹 ∘f − 𝑌)}))

Distinct variable groups:   𝑥,𝐷   𝑦,𝐷   𝑓,𝐹   𝑥,𝐹   𝑦,𝐹   𝑓,𝐼   𝑓,𝑋   𝑥,𝑋   𝑦,𝑋   𝑓,𝑌   𝑥,𝑌   𝑦,𝑌

Allowed substitution hints:   𝜑(𝑥,𝑦,𝑓)   𝐷(𝑓)   𝑆(𝑥,𝑦,𝑓)   𝐼(𝑥,𝑦)

Proof of Theorem gsumbagdiaglem

Dummy variables 𝑢 𝑣 𝑤 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		simprr 772	. . . . 5 ⊢ ((𝜑 ∧ (𝑋 ∈ 𝑆 ∧ 𝑌 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ (𝐹 ∘f − 𝑋)})) → 𝑌 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ (𝐹 ∘f − 𝑋)})
2		breq1 5095	. . . . . 6 ⊢ (𝑥 = 𝑌 → (𝑥 ∘r ≤ (𝐹 ∘f − 𝑋) ↔ 𝑌 ∘r ≤ (𝐹 ∘f − 𝑋)))
3	2	elrab 3648	. . . . 5 ⊢ (𝑌 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ (𝐹 ∘f − 𝑋)} ↔ (𝑌 ∈ 𝐷 ∧ 𝑌 ∘r ≤ (𝐹 ∘f − 𝑋)))
4	1, 3	sylib 218	. . . 4 ⊢ ((𝜑 ∧ (𝑋 ∈ 𝑆 ∧ 𝑌 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ (𝐹 ∘f − 𝑋)})) → (𝑌 ∈ 𝐷 ∧ 𝑌 ∘r ≤ (𝐹 ∘f − 𝑋)))
5	4	simpld 494	. . 3 ⊢ ((𝜑 ∧ (𝑋 ∈ 𝑆 ∧ 𝑌 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ (𝐹 ∘f − 𝑋)})) → 𝑌 ∈ 𝐷)
6	4	simprd 495	. . . 4 ⊢ ((𝜑 ∧ (𝑋 ∈ 𝑆 ∧ 𝑌 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ (𝐹 ∘f − 𝑋)})) → 𝑌 ∘r ≤ (𝐹 ∘f − 𝑋))
7		gsumbagdiag.f	. . . . . . 7 ⊢ (𝜑 → 𝐹 ∈ 𝐷)
8	7	adantr 480	. . . . . 6 ⊢ ((𝜑 ∧ (𝑋 ∈ 𝑆 ∧ 𝑌 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ (𝐹 ∘f − 𝑋)})) → 𝐹 ∈ 𝐷)
9		simprl 770	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑋 ∈ 𝑆 ∧ 𝑌 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ (𝐹 ∘f − 𝑋)})) → 𝑋 ∈ 𝑆)
10		breq1 5095	. . . . . . . . . 10 ⊢ (𝑦 = 𝑋 → (𝑦 ∘r ≤ 𝐹 ↔ 𝑋 ∘r ≤ 𝐹))
11		gsumbagdiag.s	. . . . . . . . . 10 ⊢ 𝑆 = {𝑦 ∈ 𝐷 ∣ 𝑦 ∘r ≤ 𝐹}
12	10, 11	elrab2 3651	. . . . . . . . 9 ⊢ (𝑋 ∈ 𝑆 ↔ (𝑋 ∈ 𝐷 ∧ 𝑋 ∘r ≤ 𝐹))
13	9, 12	sylib 218	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑋 ∈ 𝑆 ∧ 𝑌 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ (𝐹 ∘f − 𝑋)})) → (𝑋 ∈ 𝐷 ∧ 𝑋 ∘r ≤ 𝐹))
14	13	simpld 494	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑋 ∈ 𝑆 ∧ 𝑌 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ (𝐹 ∘f − 𝑋)})) → 𝑋 ∈ 𝐷)
15		gsumbagdiag.d	. . . . . . . 8 ⊢ 𝐷 = {𝑓 ∈ (ℕ0 ↑m 𝐼) ∣ (◡𝑓 “ ℕ) ∈ Fin}
16	15	psrbagf 21825	. . . . . . 7 ⊢ (𝑋 ∈ 𝐷 → 𝑋:𝐼⟶ℕ0)
17	14, 16	syl 17	. . . . . 6 ⊢ ((𝜑 ∧ (𝑋 ∈ 𝑆 ∧ 𝑌 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ (𝐹 ∘f − 𝑋)})) → 𝑋:𝐼⟶ℕ0)
18	13	simprd 495	. . . . . 6 ⊢ ((𝜑 ∧ (𝑋 ∈ 𝑆 ∧ 𝑌 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ (𝐹 ∘f − 𝑋)})) → 𝑋 ∘r ≤ 𝐹)
19	15	psrbagcon 21832	. . . . . 6 ⊢ ((𝐹 ∈ 𝐷 ∧ 𝑋:𝐼⟶ℕ0 ∧ 𝑋 ∘r ≤ 𝐹) → ((𝐹 ∘f − 𝑋) ∈ 𝐷 ∧ (𝐹 ∘f − 𝑋) ∘r ≤ 𝐹))
20	8, 17, 18, 19	syl3anc 1373	. . . . 5 ⊢ ((𝜑 ∧ (𝑋 ∈ 𝑆 ∧ 𝑌 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ (𝐹 ∘f − 𝑋)})) → ((𝐹 ∘f − 𝑋) ∈ 𝐷 ∧ (𝐹 ∘f − 𝑋) ∘r ≤ 𝐹))
21	20	simprd 495	. . . 4 ⊢ ((𝜑 ∧ (𝑋 ∈ 𝑆 ∧ 𝑌 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ (𝐹 ∘f − 𝑋)})) → (𝐹 ∘f − 𝑋) ∘r ≤ 𝐹)
22	15	psrbagf 21825	. . . . . . . 8 ⊢ (𝐹 ∈ 𝐷 → 𝐹:𝐼⟶ℕ0)
23	8, 22	syl 17	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑋 ∈ 𝑆 ∧ 𝑌 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ (𝐹 ∘f − 𝑋)})) → 𝐹:𝐼⟶ℕ0)
24	23	ffnd 6653	. . . . . 6 ⊢ ((𝜑 ∧ (𝑋 ∈ 𝑆 ∧ 𝑌 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ (𝐹 ∘f − 𝑋)})) → 𝐹 Fn 𝐼)
25	8, 24	fndmexd 7837	. . . . 5 ⊢ ((𝜑 ∧ (𝑋 ∈ 𝑆 ∧ 𝑌 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ (𝐹 ∘f − 𝑋)})) → 𝐼 ∈ V)
26	15	psrbagf 21825	. . . . . 6 ⊢ (𝑌 ∈ 𝐷 → 𝑌:𝐼⟶ℕ0)
27	5, 26	syl 17	. . . . 5 ⊢ ((𝜑 ∧ (𝑋 ∈ 𝑆 ∧ 𝑌 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ (𝐹 ∘f − 𝑋)})) → 𝑌:𝐼⟶ℕ0)
28	20	simpld 494	. . . . . 6 ⊢ ((𝜑 ∧ (𝑋 ∈ 𝑆 ∧ 𝑌 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ (𝐹 ∘f − 𝑋)})) → (𝐹 ∘f − 𝑋) ∈ 𝐷)
29	15	psrbagf 21825	. . . . . 6 ⊢ ((𝐹 ∘f − 𝑋) ∈ 𝐷 → (𝐹 ∘f − 𝑋):𝐼⟶ℕ0)
30	28, 29	syl 17	. . . . 5 ⊢ ((𝜑 ∧ (𝑋 ∈ 𝑆 ∧ 𝑌 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ (𝐹 ∘f − 𝑋)})) → (𝐹 ∘f − 𝑋):𝐼⟶ℕ0)
31		nn0re 12393	. . . . . . 7 ⊢ (𝑢 ∈ ℕ0 → 𝑢 ∈ ℝ)
32		nn0re 12393	. . . . . . 7 ⊢ (𝑣 ∈ ℕ0 → 𝑣 ∈ ℝ)
33		nn0re 12393	. . . . . . 7 ⊢ (𝑤 ∈ ℕ0 → 𝑤 ∈ ℝ)
34		letr 11210	. . . . . . 7 ⊢ ((𝑢 ∈ ℝ ∧ 𝑣 ∈ ℝ ∧ 𝑤 ∈ ℝ) → ((𝑢 ≤ 𝑣 ∧ 𝑣 ≤ 𝑤) → 𝑢 ≤ 𝑤))
35	31, 32, 33, 34	syl3an 1160	. . . . . 6 ⊢ ((𝑢 ∈ ℕ0 ∧ 𝑣 ∈ ℕ0 ∧ 𝑤 ∈ ℕ0) → ((𝑢 ≤ 𝑣 ∧ 𝑣 ≤ 𝑤) → 𝑢 ≤ 𝑤))
36	35	adantl 481	. . . . 5 ⊢ (((𝜑 ∧ (𝑋 ∈ 𝑆 ∧ 𝑌 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ (𝐹 ∘f − 𝑋)})) ∧ (𝑢 ∈ ℕ0 ∧ 𝑣 ∈ ℕ0 ∧ 𝑤 ∈ ℕ0)) → ((𝑢 ≤ 𝑣 ∧ 𝑣 ≤ 𝑤) → 𝑢 ≤ 𝑤))
37	25, 27, 30, 23, 36	caoftrn 7654	. . . 4 ⊢ ((𝜑 ∧ (𝑋 ∈ 𝑆 ∧ 𝑌 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ (𝐹 ∘f − 𝑋)})) → ((𝑌 ∘r ≤ (𝐹 ∘f − 𝑋) ∧ (𝐹 ∘f − 𝑋) ∘r ≤ 𝐹) → 𝑌 ∘r ≤ 𝐹))
38	6, 21, 37	mp2and 699	. . 3 ⊢ ((𝜑 ∧ (𝑋 ∈ 𝑆 ∧ 𝑌 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ (𝐹 ∘f − 𝑋)})) → 𝑌 ∘r ≤ 𝐹)
39		breq1 5095	. . . 4 ⊢ (𝑦 = 𝑌 → (𝑦 ∘r ≤ 𝐹 ↔ 𝑌 ∘r ≤ 𝐹))
40	39, 11	elrab2 3651	. . 3 ⊢ (𝑌 ∈ 𝑆 ↔ (𝑌 ∈ 𝐷 ∧ 𝑌 ∘r ≤ 𝐹))
41	5, 38, 40	sylanbrc 583	. 2 ⊢ ((𝜑 ∧ (𝑋 ∈ 𝑆 ∧ 𝑌 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ (𝐹 ∘f − 𝑋)})) → 𝑌 ∈ 𝑆)
42		breq1 5095	. . 3 ⊢ (𝑥 = 𝑋 → (𝑥 ∘r ≤ (𝐹 ∘f − 𝑌) ↔ 𝑋 ∘r ≤ (𝐹 ∘f − 𝑌)))
43	17	ffvelcdmda 7018	. . . . . . 7 ⊢ (((𝜑 ∧ (𝑋 ∈ 𝑆 ∧ 𝑌 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ (𝐹 ∘f − 𝑋)})) ∧ 𝑧 ∈ 𝐼) → (𝑋‘𝑧) ∈ ℕ0)
44	27	ffvelcdmda 7018	. . . . . . 7 ⊢ (((𝜑 ∧ (𝑋 ∈ 𝑆 ∧ 𝑌 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ (𝐹 ∘f − 𝑋)})) ∧ 𝑧 ∈ 𝐼) → (𝑌‘𝑧) ∈ ℕ0)
45	23	ffvelcdmda 7018	. . . . . . 7 ⊢ (((𝜑 ∧ (𝑋 ∈ 𝑆 ∧ 𝑌 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ (𝐹 ∘f − 𝑋)})) ∧ 𝑧 ∈ 𝐼) → (𝐹‘𝑧) ∈ ℕ0)
46		nn0re 12393	. . . . . . . 8 ⊢ ((𝑋‘𝑧) ∈ ℕ0 → (𝑋‘𝑧) ∈ ℝ)
47		nn0re 12393	. . . . . . . 8 ⊢ ((𝑌‘𝑧) ∈ ℕ0 → (𝑌‘𝑧) ∈ ℝ)
48		nn0re 12393	. . . . . . . 8 ⊢ ((𝐹‘𝑧) ∈ ℕ0 → (𝐹‘𝑧) ∈ ℝ)
49		leaddsub2 11597	. . . . . . . . 9 ⊢ (((𝑋‘𝑧) ∈ ℝ ∧ (𝑌‘𝑧) ∈ ℝ ∧ (𝐹‘𝑧) ∈ ℝ) → (((𝑋‘𝑧) + (𝑌‘𝑧)) ≤ (𝐹‘𝑧) ↔ (𝑌‘𝑧) ≤ ((𝐹‘𝑧) − (𝑋‘𝑧))))
50		leaddsub 11596	. . . . . . . . 9 ⊢ (((𝑋‘𝑧) ∈ ℝ ∧ (𝑌‘𝑧) ∈ ℝ ∧ (𝐹‘𝑧) ∈ ℝ) → (((𝑋‘𝑧) + (𝑌‘𝑧)) ≤ (𝐹‘𝑧) ↔ (𝑋‘𝑧) ≤ ((𝐹‘𝑧) − (𝑌‘𝑧))))
51	49, 50	bitr3d 281	. . . . . . . 8 ⊢ (((𝑋‘𝑧) ∈ ℝ ∧ (𝑌‘𝑧) ∈ ℝ ∧ (𝐹‘𝑧) ∈ ℝ) → ((𝑌‘𝑧) ≤ ((𝐹‘𝑧) − (𝑋‘𝑧)) ↔ (𝑋‘𝑧) ≤ ((𝐹‘𝑧) − (𝑌‘𝑧))))
52	46, 47, 48, 51	syl3an 1160	. . . . . . 7 ⊢ (((𝑋‘𝑧) ∈ ℕ0 ∧ (𝑌‘𝑧) ∈ ℕ0 ∧ (𝐹‘𝑧) ∈ ℕ0) → ((𝑌‘𝑧) ≤ ((𝐹‘𝑧) − (𝑋‘𝑧)) ↔ (𝑋‘𝑧) ≤ ((𝐹‘𝑧) − (𝑌‘𝑧))))
53	43, 44, 45, 52	syl3anc 1373	. . . . . 6 ⊢ (((𝜑 ∧ (𝑋 ∈ 𝑆 ∧ 𝑌 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ (𝐹 ∘f − 𝑋)})) ∧ 𝑧 ∈ 𝐼) → ((𝑌‘𝑧) ≤ ((𝐹‘𝑧) − (𝑋‘𝑧)) ↔ (𝑋‘𝑧) ≤ ((𝐹‘𝑧) − (𝑌‘𝑧))))
54	53	ralbidva 3150	. . . . 5 ⊢ ((𝜑 ∧ (𝑋 ∈ 𝑆 ∧ 𝑌 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ (𝐹 ∘f − 𝑋)})) → (∀𝑧 ∈ 𝐼 (𝑌‘𝑧) ≤ ((𝐹‘𝑧) − (𝑋‘𝑧)) ↔ ∀𝑧 ∈ 𝐼 (𝑋‘𝑧) ≤ ((𝐹‘𝑧) − (𝑌‘𝑧))))
55		ovexd 7384	. . . . . 6 ⊢ (((𝜑 ∧ (𝑋 ∈ 𝑆 ∧ 𝑌 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ (𝐹 ∘f − 𝑋)})) ∧ 𝑧 ∈ 𝐼) → ((𝐹‘𝑧) − (𝑋‘𝑧)) ∈ V)
56	27	feqmptd 6891	. . . . . 6 ⊢ ((𝜑 ∧ (𝑋 ∈ 𝑆 ∧ 𝑌 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ (𝐹 ∘f − 𝑋)})) → 𝑌 = (𝑧 ∈ 𝐼 ↦ (𝑌‘𝑧)))
57	17	ffnd 6653	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑋 ∈ 𝑆 ∧ 𝑌 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ (𝐹 ∘f − 𝑋)})) → 𝑋 Fn 𝐼)
58		inidm 4178	. . . . . . 7 ⊢ (𝐼 ∩ 𝐼) = 𝐼
59		eqidd 2730	. . . . . . 7 ⊢ (((𝜑 ∧ (𝑋 ∈ 𝑆 ∧ 𝑌 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ (𝐹 ∘f − 𝑋)})) ∧ 𝑧 ∈ 𝐼) → (𝐹‘𝑧) = (𝐹‘𝑧))
60		eqidd 2730	. . . . . . 7 ⊢ (((𝜑 ∧ (𝑋 ∈ 𝑆 ∧ 𝑌 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ (𝐹 ∘f − 𝑋)})) ∧ 𝑧 ∈ 𝐼) → (𝑋‘𝑧) = (𝑋‘𝑧))
61	24, 57, 25, 25, 58, 59, 60	offval 7622	. . . . . 6 ⊢ ((𝜑 ∧ (𝑋 ∈ 𝑆 ∧ 𝑌 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ (𝐹 ∘f − 𝑋)})) → (𝐹 ∘f − 𝑋) = (𝑧 ∈ 𝐼 ↦ ((𝐹‘𝑧) − (𝑋‘𝑧))))
62	25, 44, 55, 56, 61	ofrfval2 7634	. . . . 5 ⊢ ((𝜑 ∧ (𝑋 ∈ 𝑆 ∧ 𝑌 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ (𝐹 ∘f − 𝑋)})) → (𝑌 ∘r ≤ (𝐹 ∘f − 𝑋) ↔ ∀𝑧 ∈ 𝐼 (𝑌‘𝑧) ≤ ((𝐹‘𝑧) − (𝑋‘𝑧))))
63		ovexd 7384	. . . . . 6 ⊢ (((𝜑 ∧ (𝑋 ∈ 𝑆 ∧ 𝑌 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ (𝐹 ∘f − 𝑋)})) ∧ 𝑧 ∈ 𝐼) → ((𝐹‘𝑧) − (𝑌‘𝑧)) ∈ V)
64	17	feqmptd 6891	. . . . . 6 ⊢ ((𝜑 ∧ (𝑋 ∈ 𝑆 ∧ 𝑌 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ (𝐹 ∘f − 𝑋)})) → 𝑋 = (𝑧 ∈ 𝐼 ↦ (𝑋‘𝑧)))
65	27	ffnd 6653	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑋 ∈ 𝑆 ∧ 𝑌 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ (𝐹 ∘f − 𝑋)})) → 𝑌 Fn 𝐼)
66		eqidd 2730	. . . . . . 7 ⊢ (((𝜑 ∧ (𝑋 ∈ 𝑆 ∧ 𝑌 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ (𝐹 ∘f − 𝑋)})) ∧ 𝑧 ∈ 𝐼) → (𝑌‘𝑧) = (𝑌‘𝑧))
67	24, 65, 25, 25, 58, 59, 66	offval 7622	. . . . . 6 ⊢ ((𝜑 ∧ (𝑋 ∈ 𝑆 ∧ 𝑌 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ (𝐹 ∘f − 𝑋)})) → (𝐹 ∘f − 𝑌) = (𝑧 ∈ 𝐼 ↦ ((𝐹‘𝑧) − (𝑌‘𝑧))))
68	25, 43, 63, 64, 67	ofrfval2 7634	. . . . 5 ⊢ ((𝜑 ∧ (𝑋 ∈ 𝑆 ∧ 𝑌 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ (𝐹 ∘f − 𝑋)})) → (𝑋 ∘r ≤ (𝐹 ∘f − 𝑌) ↔ ∀𝑧 ∈ 𝐼 (𝑋‘𝑧) ≤ ((𝐹‘𝑧) − (𝑌‘𝑧))))
69	54, 62, 68	3bitr4d 311	. . . 4 ⊢ ((𝜑 ∧ (𝑋 ∈ 𝑆 ∧ 𝑌 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ (𝐹 ∘f − 𝑋)})) → (𝑌 ∘r ≤ (𝐹 ∘f − 𝑋) ↔ 𝑋 ∘r ≤ (𝐹 ∘f − 𝑌)))
70	6, 69	mpbid 232	. . 3 ⊢ ((𝜑 ∧ (𝑋 ∈ 𝑆 ∧ 𝑌 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ (𝐹 ∘f − 𝑋)})) → 𝑋 ∘r ≤ (𝐹 ∘f − 𝑌))
71	42, 14, 70	elrabd 3650	. 2 ⊢ ((𝜑 ∧ (𝑋 ∈ 𝑆 ∧ 𝑌 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ (𝐹 ∘f − 𝑋)})) → 𝑋 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ (𝐹 ∘f − 𝑌)})
72	41, 71	jca 511	1 ⊢ ((𝜑 ∧ (𝑋 ∈ 𝑆 ∧ 𝑌 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ (𝐹 ∘f − 𝑋)})) → (𝑌 ∈ 𝑆 ∧ 𝑋 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ (𝐹 ∘f − 𝑌)}))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   ∧ w3a 1086   = wceq 1540   ∈ wcel 2109  ∀wral 3044  {crab 3394  Vcvv 3436   class class class wbr 5092  ^◡ccnv 5618   “ cima 5622  ⟶wf 6478  ‘cfv 6482  (class class class)co 7349   ∘_f cof 7611   ∘_r cofr 7612   ↑_m cmap 8753  Fincfn 8872  ℝcr 11008   + caddc 11012   ≤ cle 11150   − cmin 11347  ℕcn 12128  ℕ₀cn0 12384

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2701  ax-rep 5218  ax-sep 5235  ax-nul 5245  ax-pow 5304  ax-pr 5371  ax-un 7671  ax-cnex 11065  ax-resscn 11066  ax-1cn 11067  ax-icn 11068  ax-addcl 11069  ax-addrcl 11070  ax-mulcl 11071  ax-mulrcl 11072  ax-mulcom 11073  ax-addass 11074  ax-mulass 11075  ax-distr 11076  ax-i2m1 11077  ax-1ne0 11078  ax-1rid 11079  ax-rnegex 11080  ax-rrecex 11081  ax-cnre 11082  ax-pre-lttri 11083  ax-pre-lttrn 11084  ax-pre-ltadd 11085  ax-pre-mulgt0 11086

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2533  df-eu 2562  df-clab 2708  df-cleq 2721  df-clel 2803  df-nfc 2878  df-ne 2926  df-nel 3030  df-ral 3045  df-rex 3054  df-reu 3344  df-rab 3395  df-v 3438  df-sbc 3743  df-csb 3852  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-pss 3923  df-nul 4285  df-if 4477  df-pw 4553  df-sn 4578  df-pr 4580  df-op 4584  df-uni 4859  df-iun 4943  df-br 5093  df-opab 5155  df-mpt 5174  df-tr 5200  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 6249  df-ord 6310  df-on 6311  df-lim 6312  df-suc 6313  df-iota 6438  df-fun 6484  df-fn 6485  df-f 6486  df-f1 6487  df-fo 6488  df-f1o 6489  df-fv 6490  df-riota 7306  df-ov 7352  df-oprab 7353  df-mpo 7354  df-of 7613  df-ofr 7614  df-om 7800  df-1st 7924  df-2nd 7925  df-supp 8094  df-frecs 8214  df-wrecs 8245  df-recs 8294  df-rdg 8332  df-1o 8388  df-er 8625  df-map 8755  df-en 8873  df-dom 8874  df-sdom 8875  df-fin 8876  df-pnf 11151  df-mnf 11152  df-xr 11153  df-ltxr 11154  df-le 11155  df-sub 11349  df-neg 11350  df-nn 12129  df-n0 12385

This theorem is referenced by:  gsumbagdiag  21838  psrass1lem  21839