Theorem gsumbagdiaglem 21950

Description: Lemma for gsumbagdiag 21951. (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 773	. . . . 5 ⊢ ((𝜑 ∧ (𝑋 ∈ 𝑆 ∧ 𝑌 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ (𝐹 ∘f − 𝑋)})) → 𝑌 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ (𝐹 ∘f − 𝑋)})
2		breq1 5146	. . . . . 6 ⊢ (𝑥 = 𝑌 → (𝑥 ∘r ≤ (𝐹 ∘f − 𝑋) ↔ 𝑌 ∘r ≤ (𝐹 ∘f − 𝑋)))
3	2	elrab 3692	. . . . 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 771	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑋 ∈ 𝑆 ∧ 𝑌 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ (𝐹 ∘f − 𝑋)})) → 𝑋 ∈ 𝑆)
10		breq1 5146	. . . . . . . . . 10 ⊢ (𝑦 = 𝑋 → (𝑦 ∘r ≤ 𝐹 ↔ 𝑋 ∘r ≤ 𝐹))
11		gsumbagdiag.s	. . . . . . . . . 10 ⊢ 𝑆 = {𝑦 ∈ 𝐷 ∣ 𝑦 ∘r ≤ 𝐹}
12	10, 11	elrab2 3695	. . . . . . . . 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 21938	. . . . . . 7 ⊢ (𝑋 ∈ 𝐷 → 𝑋:𝐼⟶ℕ0)
17	14, 16	syl 17	. . . . . 6 ⊢ ((𝜑 ∧ (𝑋 ∈ 𝑆 ∧ 𝑌 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ (𝐹 ∘f − 𝑋)})) → 𝑋:𝐼⟶ℕ0)
18	13	simprd 495	. . . . . 6 ⊢ ((𝜑 ∧ (𝑋 ∈ 𝑆 ∧ 𝑌 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ (𝐹 ∘f − 𝑋)})) → 𝑋 ∘r ≤ 𝐹)
19	15	psrbagcon 21945	. . . . . 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 21938	. . . . . . . 8 ⊢ (𝐹 ∈ 𝐷 → 𝐹:𝐼⟶ℕ0)
23	8, 22	syl 17	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑋 ∈ 𝑆 ∧ 𝑌 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ (𝐹 ∘f − 𝑋)})) → 𝐹:𝐼⟶ℕ0)
24	23	ffnd 6737	. . . . . 6 ⊢ ((𝜑 ∧ (𝑋 ∈ 𝑆 ∧ 𝑌 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ (𝐹 ∘f − 𝑋)})) → 𝐹 Fn 𝐼)
25	8, 24	fndmexd 7926	. . . . 5 ⊢ ((𝜑 ∧ (𝑋 ∈ 𝑆 ∧ 𝑌 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ (𝐹 ∘f − 𝑋)})) → 𝐼 ∈ V)
26	15	psrbagf 21938	. . . . . 6 ⊢ (𝑌 ∈ 𝐷 → 𝑌:𝐼⟶ℕ0)
27	5, 26	syl 17	. . . . 5 ⊢ ((𝜑 ∧ (𝑋 ∈ 𝑆 ∧ 𝑌 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ (𝐹 ∘f − 𝑋)})) → 𝑌:𝐼⟶ℕ0)
28	20	simpld 494	. . . . . 6 ⊢ ((𝜑 ∧ (𝑋 ∈ 𝑆 ∧ 𝑌 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ (𝐹 ∘f − 𝑋)})) → (𝐹 ∘f − 𝑋) ∈ 𝐷)
29	15	psrbagf 21938	. . . . . 6 ⊢ ((𝐹 ∘f − 𝑋) ∈ 𝐷 → (𝐹 ∘f − 𝑋):𝐼⟶ℕ0)
30	28, 29	syl 17	. . . . 5 ⊢ ((𝜑 ∧ (𝑋 ∈ 𝑆 ∧ 𝑌 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ (𝐹 ∘f − 𝑋)})) → (𝐹 ∘f − 𝑋):𝐼⟶ℕ0)
31		nn0re 12535	. . . . . . 7 ⊢ (𝑢 ∈ ℕ0 → 𝑢 ∈ ℝ)
32		nn0re 12535	. . . . . . 7 ⊢ (𝑣 ∈ ℕ0 → 𝑣 ∈ ℝ)
33		nn0re 12535	. . . . . . 7 ⊢ (𝑤 ∈ ℕ0 → 𝑤 ∈ ℝ)
34		letr 11355	. . . . . . 7 ⊢ ((𝑢 ∈ ℝ ∧ 𝑣 ∈ ℝ ∧ 𝑤 ∈ ℝ) → ((𝑢 ≤ 𝑣 ∧ 𝑣 ≤ 𝑤) → 𝑢 ≤ 𝑤))
35	31, 32, 33, 34	syl3an 1161	. . . . . 6 ⊢ ((𝑢 ∈ ℕ0 ∧ 𝑣 ∈ ℕ0 ∧ 𝑤 ∈ ℕ0) → ((𝑢 ≤ 𝑣 ∧ 𝑣 ≤ 𝑤) → 𝑢 ≤ 𝑤))
36	35	adantl 481	. . . . 5 ⊢ (((𝜑 ∧ (𝑋 ∈ 𝑆 ∧ 𝑌 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ (𝐹 ∘f − 𝑋)})) ∧ (𝑢 ∈ ℕ0 ∧ 𝑣 ∈ ℕ0 ∧ 𝑤 ∈ ℕ0)) → ((𝑢 ≤ 𝑣 ∧ 𝑣 ≤ 𝑤) → 𝑢 ≤ 𝑤))
37	25, 27, 30, 23, 36	caoftrn 7738	. . . 4 ⊢ ((𝜑 ∧ (𝑋 ∈ 𝑆 ∧ 𝑌 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ (𝐹 ∘f − 𝑋)})) → ((𝑌 ∘r ≤ (𝐹 ∘f − 𝑋) ∧ (𝐹 ∘f − 𝑋) ∘r ≤ 𝐹) → 𝑌 ∘r ≤ 𝐹))
38	6, 21, 37	mp2and 699	. . 3 ⊢ ((𝜑 ∧ (𝑋 ∈ 𝑆 ∧ 𝑌 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ (𝐹 ∘f − 𝑋)})) → 𝑌 ∘r ≤ 𝐹)
39		breq1 5146	. . . 4 ⊢ (𝑦 = 𝑌 → (𝑦 ∘r ≤ 𝐹 ↔ 𝑌 ∘r ≤ 𝐹))
40	39, 11	elrab2 3695	. . 3 ⊢ (𝑌 ∈ 𝑆 ↔ (𝑌 ∈ 𝐷 ∧ 𝑌 ∘r ≤ 𝐹))
41	5, 38, 40	sylanbrc 583	. 2 ⊢ ((𝜑 ∧ (𝑋 ∈ 𝑆 ∧ 𝑌 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ (𝐹 ∘f − 𝑋)})) → 𝑌 ∈ 𝑆)
42		breq1 5146	. . 3 ⊢ (𝑥 = 𝑋 → (𝑥 ∘r ≤ (𝐹 ∘f − 𝑌) ↔ 𝑋 ∘r ≤ (𝐹 ∘f − 𝑌)))
43	17	ffvelcdmda 7104	. . . . . . 7 ⊢ (((𝜑 ∧ (𝑋 ∈ 𝑆 ∧ 𝑌 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ (𝐹 ∘f − 𝑋)})) ∧ 𝑧 ∈ 𝐼) → (𝑋‘𝑧) ∈ ℕ0)
44	27	ffvelcdmda 7104	. . . . . . 7 ⊢ (((𝜑 ∧ (𝑋 ∈ 𝑆 ∧ 𝑌 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ (𝐹 ∘f − 𝑋)})) ∧ 𝑧 ∈ 𝐼) → (𝑌‘𝑧) ∈ ℕ0)
45	23	ffvelcdmda 7104	. . . . . . 7 ⊢ (((𝜑 ∧ (𝑋 ∈ 𝑆 ∧ 𝑌 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ (𝐹 ∘f − 𝑋)})) ∧ 𝑧 ∈ 𝐼) → (𝐹‘𝑧) ∈ ℕ0)
46		nn0re 12535	. . . . . . . 8 ⊢ ((𝑋‘𝑧) ∈ ℕ0 → (𝑋‘𝑧) ∈ ℝ)
47		nn0re 12535	. . . . . . . 8 ⊢ ((𝑌‘𝑧) ∈ ℕ0 → (𝑌‘𝑧) ∈ ℝ)
48		nn0re 12535	. . . . . . . 8 ⊢ ((𝐹‘𝑧) ∈ ℕ0 → (𝐹‘𝑧) ∈ ℝ)
49		leaddsub2 11740	. . . . . . . . 9 ⊢ (((𝑋‘𝑧) ∈ ℝ ∧ (𝑌‘𝑧) ∈ ℝ ∧ (𝐹‘𝑧) ∈ ℝ) → (((𝑋‘𝑧) + (𝑌‘𝑧)) ≤ (𝐹‘𝑧) ↔ (𝑌‘𝑧) ≤ ((𝐹‘𝑧) − (𝑋‘𝑧))))
50		leaddsub 11739	. . . . . . . . 9 ⊢ (((𝑋‘𝑧) ∈ ℝ ∧ (𝑌‘𝑧) ∈ ℝ ∧ (𝐹‘𝑧) ∈ ℝ) → (((𝑋‘𝑧) + (𝑌‘𝑧)) ≤ (𝐹‘𝑧) ↔ (𝑋‘𝑧) ≤ ((𝐹‘𝑧) − (𝑌‘𝑧))))
51	49, 50	bitr3d 281	. . . . . . . 8 ⊢ (((𝑋‘𝑧) ∈ ℝ ∧ (𝑌‘𝑧) ∈ ℝ ∧ (𝐹‘𝑧) ∈ ℝ) → ((𝑌‘𝑧) ≤ ((𝐹‘𝑧) − (𝑋‘𝑧)) ↔ (𝑋‘𝑧) ≤ ((𝐹‘𝑧) − (𝑌‘𝑧))))
52	46, 47, 48, 51	syl3an 1161	. . . . . . 7 ⊢ (((𝑋‘𝑧) ∈ ℕ0 ∧ (𝑌‘𝑧) ∈ ℕ0 ∧ (𝐹‘𝑧) ∈ ℕ0) → ((𝑌‘𝑧) ≤ ((𝐹‘𝑧) − (𝑋‘𝑧)) ↔ (𝑋‘𝑧) ≤ ((𝐹‘𝑧) − (𝑌‘𝑧))))
53	43, 44, 45, 52	syl3anc 1373	. . . . . 6 ⊢ (((𝜑 ∧ (𝑋 ∈ 𝑆 ∧ 𝑌 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ (𝐹 ∘f − 𝑋)})) ∧ 𝑧 ∈ 𝐼) → ((𝑌‘𝑧) ≤ ((𝐹‘𝑧) − (𝑋‘𝑧)) ↔ (𝑋‘𝑧) ≤ ((𝐹‘𝑧) − (𝑌‘𝑧))))
54	53	ralbidva 3176	. . . . 5 ⊢ ((𝜑 ∧ (𝑋 ∈ 𝑆 ∧ 𝑌 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ (𝐹 ∘f − 𝑋)})) → (∀𝑧 ∈ 𝐼 (𝑌‘𝑧) ≤ ((𝐹‘𝑧) − (𝑋‘𝑧)) ↔ ∀𝑧 ∈ 𝐼 (𝑋‘𝑧) ≤ ((𝐹‘𝑧) − (𝑌‘𝑧))))
55		ovexd 7466	. . . . . 6 ⊢ (((𝜑 ∧ (𝑋 ∈ 𝑆 ∧ 𝑌 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ (𝐹 ∘f − 𝑋)})) ∧ 𝑧 ∈ 𝐼) → ((𝐹‘𝑧) − (𝑋‘𝑧)) ∈ V)
56	27	feqmptd 6977	. . . . . 6 ⊢ ((𝜑 ∧ (𝑋 ∈ 𝑆 ∧ 𝑌 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ (𝐹 ∘f − 𝑋)})) → 𝑌 = (𝑧 ∈ 𝐼 ↦ (𝑌‘𝑧)))
57	17	ffnd 6737	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑋 ∈ 𝑆 ∧ 𝑌 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ (𝐹 ∘f − 𝑋)})) → 𝑋 Fn 𝐼)
58		inidm 4227	. . . . . . 7 ⊢ (𝐼 ∩ 𝐼) = 𝐼
59		eqidd 2738	. . . . . . 7 ⊢ (((𝜑 ∧ (𝑋 ∈ 𝑆 ∧ 𝑌 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ (𝐹 ∘f − 𝑋)})) ∧ 𝑧 ∈ 𝐼) → (𝐹‘𝑧) = (𝐹‘𝑧))
60		eqidd 2738	. . . . . . 7 ⊢ (((𝜑 ∧ (𝑋 ∈ 𝑆 ∧ 𝑌 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ (𝐹 ∘f − 𝑋)})) ∧ 𝑧 ∈ 𝐼) → (𝑋‘𝑧) = (𝑋‘𝑧))
61	24, 57, 25, 25, 58, 59, 60	offval 7706	. . . . . 6 ⊢ ((𝜑 ∧ (𝑋 ∈ 𝑆 ∧ 𝑌 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ (𝐹 ∘f − 𝑋)})) → (𝐹 ∘f − 𝑋) = (𝑧 ∈ 𝐼 ↦ ((𝐹‘𝑧) − (𝑋‘𝑧))))
62	25, 44, 55, 56, 61	ofrfval2 7718	. . . . 5 ⊢ ((𝜑 ∧ (𝑋 ∈ 𝑆 ∧ 𝑌 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ (𝐹 ∘f − 𝑋)})) → (𝑌 ∘r ≤ (𝐹 ∘f − 𝑋) ↔ ∀𝑧 ∈ 𝐼 (𝑌‘𝑧) ≤ ((𝐹‘𝑧) − (𝑋‘𝑧))))
63		ovexd 7466	. . . . . 6 ⊢ (((𝜑 ∧ (𝑋 ∈ 𝑆 ∧ 𝑌 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ (𝐹 ∘f − 𝑋)})) ∧ 𝑧 ∈ 𝐼) → ((𝐹‘𝑧) − (𝑌‘𝑧)) ∈ V)
64	17	feqmptd 6977	. . . . . 6 ⊢ ((𝜑 ∧ (𝑋 ∈ 𝑆 ∧ 𝑌 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ (𝐹 ∘f − 𝑋)})) → 𝑋 = (𝑧 ∈ 𝐼 ↦ (𝑋‘𝑧)))
65	27	ffnd 6737	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑋 ∈ 𝑆 ∧ 𝑌 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ (𝐹 ∘f − 𝑋)})) → 𝑌 Fn 𝐼)
66		eqidd 2738	. . . . . . 7 ⊢ (((𝜑 ∧ (𝑋 ∈ 𝑆 ∧ 𝑌 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ (𝐹 ∘f − 𝑋)})) ∧ 𝑧 ∈ 𝐼) → (𝑌‘𝑧) = (𝑌‘𝑧))
67	24, 65, 25, 25, 58, 59, 66	offval 7706	. . . . . 6 ⊢ ((𝜑 ∧ (𝑋 ∈ 𝑆 ∧ 𝑌 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ (𝐹 ∘f − 𝑋)})) → (𝐹 ∘f − 𝑌) = (𝑧 ∈ 𝐼 ↦ ((𝐹‘𝑧) − (𝑌‘𝑧))))
68	25, 43, 63, 64, 67	ofrfval2 7718	. . . . 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 3694	. 2 ⊢ ((𝜑 ∧ (𝑋 ∈ 𝑆 ∧ 𝑌 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ (𝐹 ∘f − 𝑋)})) → 𝑋 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ (𝐹 ∘f − 𝑌)})
72	41, 71	jca 511	1 ⊢ ((𝜑 ∧ (𝑋 ∈ 𝑆 ∧ 𝑌 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ (𝐹 ∘f − 𝑋)})) → (𝑌 ∈ 𝑆 ∧ 𝑋 ∈ {𝑥 ∈ 𝐷 ∣ 𝑥 ∘r ≤ (𝐹 ∘f − 𝑌)}))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   ∧ w3a 1087   = wceq 1540   ∈ wcel 2108  ∀wral 3061  {crab 3436  Vcvv 3480   class class class wbr 5143  ^◡ccnv 5684   “ cima 5688  ⟶wf 6557  ‘cfv 6561  (class class class)co 7431   ∘_f cof 7695   ∘_r cofr 7696   ↑_m cmap 8866  Fincfn 8985  ℝcr 11154   + caddc 11158   ≤ cle 11296   − cmin 11492  ℕcn 12266  ℕ₀cn0 12526

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 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2157  ax-12 2177  ax-ext 2708  ax-rep 5279  ax-sep 5296  ax-nul 5306  ax-pow 5365  ax-pr 5432  ax-un 7755  ax-cnex 11211  ax-resscn 11212  ax-1cn 11213  ax-icn 11214  ax-addcl 11215  ax-addrcl 11216  ax-mulcl 11217  ax-mulrcl 11218  ax-mulcom 11219  ax-addass 11220  ax-mulass 11221  ax-distr 11222  ax-i2m1 11223  ax-1ne0 11224  ax-1rid 11225  ax-rnegex 11226  ax-rrecex 11227  ax-cnre 11228  ax-pre-lttri 11229  ax-pre-lttrn 11230  ax-pre-ltadd 11231  ax-pre-mulgt0 11232

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2065  df-mo 2540  df-eu 2569  df-clab 2715  df-cleq 2729  df-clel 2816  df-nfc 2892  df-ne 2941  df-nel 3047  df-ral 3062  df-rex 3071  df-reu 3381  df-rab 3437  df-v 3482  df-sbc 3789  df-csb 3900  df-dif 3954  df-un 3956  df-in 3958  df-ss 3968  df-pss 3971  df-nul 4334  df-if 4526  df-pw 4602  df-sn 4627  df-pr 4629  df-op 4633  df-uni 4908  df-iun 4993  df-br 5144  df-opab 5206  df-mpt 5226  df-tr 5260  df-id 5578  df-eprel 5584  df-po 5592  df-so 5593  df-fr 5637  df-we 5639  df-xp 5691  df-rel 5692  df-cnv 5693  df-co 5694  df-dm 5695  df-rn 5696  df-res 5697  df-ima 5698  df-pred 6321  df-ord 6387  df-on 6388  df-lim 6389  df-suc 6390  df-iota 6514  df-fun 6563  df-fn 6564  df-f 6565  df-f1 6566  df-fo 6567  df-f1o 6568  df-fv 6569  df-riota 7388  df-ov 7434  df-oprab 7435  df-mpo 7436  df-of 7697  df-ofr 7698  df-om 7888  df-1st 8014  df-2nd 8015  df-supp 8186  df-frecs 8306  df-wrecs 8337  df-recs 8411  df-rdg 8450  df-1o 8506  df-er 8745  df-map 8868  df-en 8986  df-dom 8987  df-sdom 8988  df-fin 8989  df-pnf 11297  df-mnf 11298  df-xr 11299  df-ltxr 11300  df-le 11301  df-sub 11494  df-neg 11495  df-nn 12267  df-n0 12527

This theorem is referenced by:  gsumbagdiag  21951  psrass1lem  21952