Theorem cdj3i 32866

Description: Two ways to express "𝐴 and 𝐵 are completely disjoint subspaces." (1) <=> (3) in Lemma 5 of [Holland] p. 1520. (Contributed by NM, 1-Jun-2005.) (New usage is discouraged.)

Hypotheses

Ref	Expression
cdj3.1	⊢ 𝐴 ∈ Sℋ
cdj3.2	⊢ 𝐵 ∈ Sℋ
cdj3.3	⊢ 𝑆 = (𝑥 ∈ (𝐴 +ℋ 𝐵) ↦ (℩𝑧 ∈ 𝐴 ∃𝑤 ∈ 𝐵 𝑥 = (𝑧 +ℎ 𝑤)))
cdj3.4	⊢ 𝑇 = (𝑥 ∈ (𝐴 +ℋ 𝐵) ↦ (℩𝑤 ∈ 𝐵 ∃𝑧 ∈ 𝐴 𝑥 = (𝑧 +ℎ 𝑤)))
cdj3.5	⊢ (𝜑 ↔ ∃𝑣 ∈ ℝ (0 < 𝑣 ∧ ∀𝑢 ∈ (𝐴 +ℋ 𝐵)(normℎ‘(𝑆‘𝑢)) ≤ (𝑣 · (normℎ‘𝑢))))
cdj3.6	⊢ (𝜓 ↔ ∃𝑣 ∈ ℝ (0 < 𝑣 ∧ ∀𝑢 ∈ (𝐴 +ℋ 𝐵)(normℎ‘(𝑇‘𝑢)) ≤ (𝑣 · (normℎ‘𝑢))))

Assertion

Ref	Expression
cdj3i	⊢ (∃𝑣 ∈ ℝ (0 < 𝑣 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 ((normℎ‘𝑥) + (normℎ‘𝑦)) ≤ (𝑣 · (normℎ‘(𝑥 +ℎ 𝑦)))) ↔ ((𝐴 ∩ 𝐵) = 0ℋ ∧ 𝜑 ∧ 𝜓))

Distinct variable groups:   𝑥,𝑦,𝑧,𝑤,𝑣,𝑢,𝐴   𝑥,𝐵,𝑦,𝑧,𝑤,𝑣,𝑢   𝑣,𝑆,𝑢   𝑣,𝑇,𝑢

Allowed substitution hints:   𝜑(𝑥, 𝑦, 𝑧, 𝑤, 𝑣, 𝑢)   𝜓(𝑥, 𝑦, 𝑧, 𝑤, 𝑣, 𝑢)   𝑆(𝑥, 𝑦, 𝑧, 𝑤)   𝑇(𝑥, 𝑦, 𝑧, 𝑤)

Proof of Theorem cdj3i

Dummy variables 𝑡 ℎ 𝑓 𝑔 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		cdj3.1	. . . 4 ⊢ 𝐴 ∈ Sℋ
2		cdj3.2	. . . 4 ⊢ 𝐵 ∈ Sℋ
3	1, 2	cdj3lem1 32859	. . 3 ⊢ (∃𝑣 ∈ ℝ (0 < 𝑣 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 ((normℎ‘𝑥) + (normℎ‘𝑦)) ≤ (𝑣 · (normℎ‘(𝑥 +ℎ 𝑦)))) → (𝐴 ∩ 𝐵) = 0ℋ)
4		cdj3.3	. . . . 5 ⊢ 𝑆 = (𝑥 ∈ (𝐴 +ℋ 𝐵) ↦ (℩𝑧 ∈ 𝐴 ∃𝑤 ∈ 𝐵 𝑥 = (𝑧 +ℎ 𝑤)))
5	1, 2, 4	cdj3lem2b 32862	. . . 4 ⊢ (∃𝑣 ∈ ℝ (0 < 𝑣 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 ((normℎ‘𝑥) + (normℎ‘𝑦)) ≤ (𝑣 · (normℎ‘(𝑥 +ℎ 𝑦)))) → ∃𝑣 ∈ ℝ (0 < 𝑣 ∧ ∀𝑢 ∈ (𝐴 +ℋ 𝐵)(normℎ‘(𝑆‘𝑢)) ≤ (𝑣 · (normℎ‘𝑢))))
6		cdj3.5	. . . 4 ⊢ (𝜑 ↔ ∃𝑣 ∈ ℝ (0 < 𝑣 ∧ ∀𝑢 ∈ (𝐴 +ℋ 𝐵)(normℎ‘(𝑆‘𝑢)) ≤ (𝑣 · (normℎ‘𝑢))))
7	5, 6	sylibr 237	. . 3 ⊢ (∃𝑣 ∈ ℝ (0 < 𝑣 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 ((normℎ‘𝑥) + (normℎ‘𝑦)) ≤ (𝑣 · (normℎ‘(𝑥 +ℎ 𝑦)))) → 𝜑)
8		cdj3.4	. . . . 5 ⊢ 𝑇 = (𝑥 ∈ (𝐴 +ℋ 𝐵) ↦ (℩𝑤 ∈ 𝐵 ∃𝑧 ∈ 𝐴 𝑥 = (𝑧 +ℎ 𝑤)))
9	1, 2, 8	cdj3lem3b 32865	. . . 4 ⊢ (∃𝑣 ∈ ℝ (0 < 𝑣 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 ((normℎ‘𝑥) + (normℎ‘𝑦)) ≤ (𝑣 · (normℎ‘(𝑥 +ℎ 𝑦)))) → ∃𝑣 ∈ ℝ (0 < 𝑣 ∧ ∀𝑢 ∈ (𝐴 +ℋ 𝐵)(normℎ‘(𝑇‘𝑢)) ≤ (𝑣 · (normℎ‘𝑢))))
10		cdj3.6	. . . 4 ⊢ (𝜓 ↔ ∃𝑣 ∈ ℝ (0 < 𝑣 ∧ ∀𝑢 ∈ (𝐴 +ℋ 𝐵)(normℎ‘(𝑇‘𝑢)) ≤ (𝑣 · (normℎ‘𝑢))))
11	9, 10	sylibr 237	. . 3 ⊢ (∃𝑣 ∈ ℝ (0 < 𝑣 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 ((normℎ‘𝑥) + (normℎ‘𝑦)) ≤ (𝑣 · (normℎ‘(𝑥 +ℎ 𝑦)))) → 𝜓)
12	3, 7, 11	3jca 1146	. 2 ⊢ (∃𝑣 ∈ ℝ (0 < 𝑣 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 ((normℎ‘𝑥) + (normℎ‘𝑦)) ≤ (𝑣 · (normℎ‘(𝑥 +ℎ 𝑦)))) → ((𝐴 ∩ 𝐵) = 0ℋ ∧ 𝜑 ∧ 𝜓))
13		breq2 5115	. . . . . . . . 9 ⊢ (𝑣 = 𝑓 → (0 < 𝑣 ↔ 0 < 𝑓))
14		oveq1 7426	. . . . . . . . . . 11 ⊢ (𝑣 = 𝑓 → (𝑣 · (normℎ‘𝑢)) = (𝑓 · (normℎ‘𝑢)))
15	14	breq2d 5123	. . . . . . . . . 10 ⊢ (𝑣 = 𝑓 → ((normℎ‘(𝑆‘𝑢)) ≤ (𝑣 · (normℎ‘𝑢)) ↔ (normℎ‘(𝑆‘𝑢)) ≤ (𝑓 · (normℎ‘𝑢))))
16	15	ralbidv 3190	. . . . . . . . 9 ⊢ (𝑣 = 𝑓 → (∀𝑢 ∈ (𝐴 +ℋ 𝐵)(normℎ‘(𝑆‘𝑢)) ≤ (𝑣 · (normℎ‘𝑢)) ↔ ∀𝑢 ∈ (𝐴 +ℋ 𝐵)(normℎ‘(𝑆‘𝑢)) ≤ (𝑓 · (normℎ‘𝑢))))
17	13, 16	anbi12d 644	. . . . . . . 8 ⊢ (𝑣 = 𝑓 → ((0 < 𝑣 ∧ ∀𝑢 ∈ (𝐴 +ℋ 𝐵)(normℎ‘(𝑆‘𝑢)) ≤ (𝑣 · (normℎ‘𝑢))) ↔ (0 < 𝑓 ∧ ∀𝑢 ∈ (𝐴 +ℋ 𝐵)(normℎ‘(𝑆‘𝑢)) ≤ (𝑓 · (normℎ‘𝑢)))))
18	17	cbvrexvw 3246	. . . . . . 7 ⊢ (∃𝑣 ∈ ℝ (0 < 𝑣 ∧ ∀𝑢 ∈ (𝐴 +ℋ 𝐵)(normℎ‘(𝑆‘𝑢)) ≤ (𝑣 · (normℎ‘𝑢))) ↔ ∃𝑓 ∈ ℝ (0 < 𝑓 ∧ ∀𝑢 ∈ (𝐴 +ℋ 𝐵)(normℎ‘(𝑆‘𝑢)) ≤ (𝑓 · (normℎ‘𝑢))))
19	6, 18	bitri 278	. . . . . 6 ⊢ (𝜑 ↔ ∃𝑓 ∈ ℝ (0 < 𝑓 ∧ ∀𝑢 ∈ (𝐴 +ℋ 𝐵)(normℎ‘(𝑆‘𝑢)) ≤ (𝑓 · (normℎ‘𝑢))))
20		breq2 5115	. . . . . . . . 9 ⊢ (𝑣 = 𝑔 → (0 < 𝑣 ↔ 0 < 𝑔))
21		oveq1 7426	. . . . . . . . . . 11 ⊢ (𝑣 = 𝑔 → (𝑣 · (normℎ‘𝑢)) = (𝑔 · (normℎ‘𝑢)))
22	21	breq2d 5123	. . . . . . . . . 10 ⊢ (𝑣 = 𝑔 → ((normℎ‘(𝑇‘𝑢)) ≤ (𝑣 · (normℎ‘𝑢)) ↔ (normℎ‘(𝑇‘𝑢)) ≤ (𝑔 · (normℎ‘𝑢))))
23	22	ralbidv 3190	. . . . . . . . 9 ⊢ (𝑣 = 𝑔 → (∀𝑢 ∈ (𝐴 +ℋ 𝐵)(normℎ‘(𝑇‘𝑢)) ≤ (𝑣 · (normℎ‘𝑢)) ↔ ∀𝑢 ∈ (𝐴 +ℋ 𝐵)(normℎ‘(𝑇‘𝑢)) ≤ (𝑔 · (normℎ‘𝑢))))
24	20, 23	anbi12d 644	. . . . . . . 8 ⊢ (𝑣 = 𝑔 → ((0 < 𝑣 ∧ ∀𝑢 ∈ (𝐴 +ℋ 𝐵)(normℎ‘(𝑇‘𝑢)) ≤ (𝑣 · (normℎ‘𝑢))) ↔ (0 < 𝑔 ∧ ∀𝑢 ∈ (𝐴 +ℋ 𝐵)(normℎ‘(𝑇‘𝑢)) ≤ (𝑔 · (normℎ‘𝑢)))))
25	24	cbvrexvw 3246	. . . . . . 7 ⊢ (∃𝑣 ∈ ℝ (0 < 𝑣 ∧ ∀𝑢 ∈ (𝐴 +ℋ 𝐵)(normℎ‘(𝑇‘𝑢)) ≤ (𝑣 · (normℎ‘𝑢))) ↔ ∃𝑔 ∈ ℝ (0 < 𝑔 ∧ ∀𝑢 ∈ (𝐴 +ℋ 𝐵)(normℎ‘(𝑇‘𝑢)) ≤ (𝑔 · (normℎ‘𝑢))))
26	10, 25	bitri 278	. . . . . 6 ⊢ (𝜓 ↔ ∃𝑔 ∈ ℝ (0 < 𝑔 ∧ ∀𝑢 ∈ (𝐴 +ℋ 𝐵)(normℎ‘(𝑇‘𝑢)) ≤ (𝑔 · (normℎ‘𝑢))))
27	19, 26	anbi12i 640	. . . . 5 ⊢ ((𝜑 ∧ 𝜓) ↔ (∃𝑓 ∈ ℝ (0 < 𝑓 ∧ ∀𝑢 ∈ (𝐴 +ℋ 𝐵)(normℎ‘(𝑆‘𝑢)) ≤ (𝑓 · (normℎ‘𝑢))) ∧ ∃𝑔 ∈ ℝ (0 < 𝑔 ∧ ∀𝑢 ∈ (𝐴 +ℋ 𝐵)(normℎ‘(𝑇‘𝑢)) ≤ (𝑔 · (normℎ‘𝑢)))))
28		reeanv 3239	. . . . 5 ⊢ (∃𝑓 ∈ ℝ ∃𝑔 ∈ ℝ ((0 < 𝑓 ∧ ∀𝑢 ∈ (𝐴 +ℋ 𝐵)(normℎ‘(𝑆‘𝑢)) ≤ (𝑓 · (normℎ‘𝑢))) ∧ (0 < 𝑔 ∧ ∀𝑢 ∈ (𝐴 +ℋ 𝐵)(normℎ‘(𝑇‘𝑢)) ≤ (𝑔 · (normℎ‘𝑢)))) ↔ (∃𝑓 ∈ ℝ (0 < 𝑓 ∧ ∀𝑢 ∈ (𝐴 +ℋ 𝐵)(normℎ‘(𝑆‘𝑢)) ≤ (𝑓 · (normℎ‘𝑢))) ∧ ∃𝑔 ∈ ℝ (0 < 𝑔 ∧ ∀𝑢 ∈ (𝐴 +ℋ 𝐵)(normℎ‘(𝑇‘𝑢)) ≤ (𝑔 · (normℎ‘𝑢)))))
29	27, 28	bitr4i 281	. . . 4 ⊢ ((𝜑 ∧ 𝜓) ↔ ∃𝑓 ∈ ℝ ∃𝑔 ∈ ℝ ((0 < 𝑓 ∧ ∀𝑢 ∈ (𝐴 +ℋ 𝐵)(normℎ‘(𝑆‘𝑢)) ≤ (𝑓 · (normℎ‘𝑢))) ∧ (0 < 𝑔 ∧ ∀𝑢 ∈ (𝐴 +ℋ 𝐵)(normℎ‘(𝑇‘𝑢)) ≤ (𝑔 · (normℎ‘𝑢)))))
30		an4 669	. . . . . 6 ⊢ (((0 < 𝑓 ∧ ∀𝑢 ∈ (𝐴 +ℋ 𝐵)(normℎ‘(𝑆‘𝑢)) ≤ (𝑓 · (normℎ‘𝑢))) ∧ (0 < 𝑔 ∧ ∀𝑢 ∈ (𝐴 +ℋ 𝐵)(normℎ‘(𝑇‘𝑢)) ≤ (𝑔 · (normℎ‘𝑢)))) ↔ ((0 < 𝑓 ∧ 0 < 𝑔) ∧ (∀𝑢 ∈ (𝐴 +ℋ 𝐵)(normℎ‘(𝑆‘𝑢)) ≤ (𝑓 · (normℎ‘𝑢)) ∧ ∀𝑢 ∈ (𝐴 +ℋ 𝐵)(normℎ‘(𝑇‘𝑢)) ≤ (𝑔 · (normℎ‘𝑢)))))
31		addgt0 11717	. . . . . . . . 9 ⊢ (((𝑓 ∈ ℝ ∧ 𝑔 ∈ ℝ) ∧ (0 < 𝑓 ∧ 0 < 𝑔)) → 0 < (𝑓 + 𝑔))
32	31	ex 418	. . . . . . . 8 ⊢ ((𝑓 ∈ ℝ ∧ 𝑔 ∈ ℝ) → ((0 < 𝑓 ∧ 0 < 𝑔) → 0 < (𝑓 + 𝑔)))
33	32	adantl 487	. . . . . . 7 ⊢ (((𝐴 ∩ 𝐵) = 0ℋ ∧ (𝑓 ∈ ℝ ∧ 𝑔 ∈ ℝ)) → ((0 < 𝑓 ∧ 0 < 𝑔) → 0 < (𝑓 + 𝑔)))
34	1, 2	shsvai 31789	. . . . . . . . . . 11 ⊢ ((𝑡 ∈ 𝐴 ∧ ℎ ∈ 𝐵) → (𝑡 +ℎ ℎ) ∈ (𝐴 +ℋ 𝐵))
35		2fveq3 6890	. . . . . . . . . . . . . 14 ⊢ (𝑢 = (𝑡 +ℎ ℎ) → (normℎ‘(𝑆‘𝑢)) = (normℎ‘(𝑆‘(𝑡 +ℎ ℎ))))
36		fveq2 6885	. . . . . . . . . . . . . . 15 ⊢ (𝑢 = (𝑡 +ℎ ℎ) → (normℎ‘𝑢) = (normℎ‘(𝑡 +ℎ ℎ)))
37	36	oveq2d 7435	. . . . . . . . . . . . . 14 ⊢ (𝑢 = (𝑡 +ℎ ℎ) → (𝑓 · (normℎ‘𝑢)) = (𝑓 · (normℎ‘(𝑡 +ℎ ℎ))))
38	35, 37	breq12d 5124	. . . . . . . . . . . . 13 ⊢ (𝑢 = (𝑡 +ℎ ℎ) → ((normℎ‘(𝑆‘𝑢)) ≤ (𝑓 · (normℎ‘𝑢)) ↔ (normℎ‘(𝑆‘(𝑡 +ℎ ℎ))) ≤ (𝑓 · (normℎ‘(𝑡 +ℎ ℎ)))))
39	38	rspcv 3579	. . . . . . . . . . . 12 ⊢ ((𝑡 +ℎ ℎ) ∈ (𝐴 +ℋ 𝐵) → (∀𝑢 ∈ (𝐴 +ℋ 𝐵)(normℎ‘(𝑆‘𝑢)) ≤ (𝑓 · (normℎ‘𝑢)) → (normℎ‘(𝑆‘(𝑡 +ℎ ℎ))) ≤ (𝑓 · (normℎ‘(𝑡 +ℎ ℎ)))))
40		2fveq3 6890	. . . . . . . . . . . . . 14 ⊢ (𝑢 = (𝑡 +ℎ ℎ) → (normℎ‘(𝑇‘𝑢)) = (normℎ‘(𝑇‘(𝑡 +ℎ ℎ))))
41	36	oveq2d 7435	. . . . . . . . . . . . . 14 ⊢ (𝑢 = (𝑡 +ℎ ℎ) → (𝑔 · (normℎ‘𝑢)) = (𝑔 · (normℎ‘(𝑡 +ℎ ℎ))))
42	40, 41	breq12d 5124	. . . . . . . . . . . . 13 ⊢ (𝑢 = (𝑡 +ℎ ℎ) → ((normℎ‘(𝑇‘𝑢)) ≤ (𝑔 · (normℎ‘𝑢)) ↔ (normℎ‘(𝑇‘(𝑡 +ℎ ℎ))) ≤ (𝑔 · (normℎ‘(𝑡 +ℎ ℎ)))))
43	42	rspcv 3579	. . . . . . . . . . . 12 ⊢ ((𝑡 +ℎ ℎ) ∈ (𝐴 +ℋ 𝐵) → (∀𝑢 ∈ (𝐴 +ℋ 𝐵)(normℎ‘(𝑇‘𝑢)) ≤ (𝑔 · (normℎ‘𝑢)) → (normℎ‘(𝑇‘(𝑡 +ℎ ℎ))) ≤ (𝑔 · (normℎ‘(𝑡 +ℎ ℎ)))))
44	39, 43	anim12d 621	. . . . . . . . . . 11 ⊢ ((𝑡 +ℎ ℎ) ∈ (𝐴 +ℋ 𝐵) → ((∀𝑢 ∈ (𝐴 +ℋ 𝐵)(normℎ‘(𝑆‘𝑢)) ≤ (𝑓 · (normℎ‘𝑢)) ∧ ∀𝑢 ∈ (𝐴 +ℋ 𝐵)(normℎ‘(𝑇‘𝑢)) ≤ (𝑔 · (normℎ‘𝑢))) → ((normℎ‘(𝑆‘(𝑡 +ℎ ℎ))) ≤ (𝑓 · (normℎ‘(𝑡 +ℎ ℎ))) ∧ (normℎ‘(𝑇‘(𝑡 +ℎ ℎ))) ≤ (𝑔 · (normℎ‘(𝑡 +ℎ ℎ))))))
45	34, 44	syl 18	. . . . . . . . . 10 ⊢ ((𝑡 ∈ 𝐴 ∧ ℎ ∈ 𝐵) → ((∀𝑢 ∈ (𝐴 +ℋ 𝐵)(normℎ‘(𝑆‘𝑢)) ≤ (𝑓 · (normℎ‘𝑢)) ∧ ∀𝑢 ∈ (𝐴 +ℋ 𝐵)(normℎ‘(𝑇‘𝑢)) ≤ (𝑔 · (normℎ‘𝑢))) → ((normℎ‘(𝑆‘(𝑡 +ℎ ℎ))) ≤ (𝑓 · (normℎ‘(𝑡 +ℎ ℎ))) ∧ (normℎ‘(𝑇‘(𝑡 +ℎ ℎ))) ≤ (𝑔 · (normℎ‘(𝑡 +ℎ ℎ))))))
46	45	adantl 487	. . . . . . . . 9 ⊢ ((((𝐴 ∩ 𝐵) = 0ℋ ∧ (𝑓 ∈ ℝ ∧ 𝑔 ∈ ℝ)) ∧ (𝑡 ∈ 𝐴 ∧ ℎ ∈ 𝐵)) → ((∀𝑢 ∈ (𝐴 +ℋ 𝐵)(normℎ‘(𝑆‘𝑢)) ≤ (𝑓 · (normℎ‘𝑢)) ∧ ∀𝑢 ∈ (𝐴 +ℋ 𝐵)(normℎ‘(𝑇‘𝑢)) ≤ (𝑔 · (normℎ‘𝑢))) → ((normℎ‘(𝑆‘(𝑡 +ℎ ℎ))) ≤ (𝑓 · (normℎ‘(𝑡 +ℎ ℎ))) ∧ (normℎ‘(𝑇‘(𝑡 +ℎ ℎ))) ≤ (𝑔 · (normℎ‘(𝑡 +ℎ ℎ))))))
47	1	sheli 31639	. . . . . . . . . . . . . . 15 ⊢ (𝑡 ∈ 𝐴 → 𝑡 ∈ ℋ)
48		normcl 31550	. . . . . . . . . . . . . . 15 ⊢ (𝑡 ∈ ℋ → (normℎ‘𝑡) ∈ ℝ)
49	47, 48	syl 18	. . . . . . . . . . . . . 14 ⊢ (𝑡 ∈ 𝐴 → (normℎ‘𝑡) ∈ ℝ)
50	2	sheli 31639	. . . . . . . . . . . . . . 15 ⊢ (ℎ ∈ 𝐵 → ℎ ∈ ℋ)
51		normcl 31550	. . . . . . . . . . . . . . 15 ⊢ (ℎ ∈ ℋ → (normℎ‘ℎ) ∈ ℝ)
52	50, 51	syl 18	. . . . . . . . . . . . . 14 ⊢ (ℎ ∈ 𝐵 → (normℎ‘ℎ) ∈ ℝ)
53	49, 52	anim12i 625	. . . . . . . . . . . . 13 ⊢ ((𝑡 ∈ 𝐴 ∧ ℎ ∈ 𝐵) → ((normℎ‘𝑡) ∈ ℝ ∧ (normℎ‘ℎ) ∈ ℝ))
54	53	adantl 487	. . . . . . . . . . . 12 ⊢ (((𝑓 ∈ ℝ ∧ 𝑔 ∈ ℝ) ∧ (𝑡 ∈ 𝐴 ∧ ℎ ∈ 𝐵)) → ((normℎ‘𝑡) ∈ ℝ ∧ (normℎ‘ℎ) ∈ ℝ))
55		hvaddcl 31437	. . . . . . . . . . . . . . . 16 ⊢ ((𝑡 ∈ ℋ ∧ ℎ ∈ ℋ) → (𝑡 +ℎ ℎ) ∈ ℋ)
56	47, 50, 55	syl2an 608	. . . . . . . . . . . . . . 15 ⊢ ((𝑡 ∈ 𝐴 ∧ ℎ ∈ 𝐵) → (𝑡 +ℎ ℎ) ∈ ℋ)
57		normcl 31550	. . . . . . . . . . . . . . 15 ⊢ ((𝑡 +ℎ ℎ) ∈ ℋ → (normℎ‘(𝑡 +ℎ ℎ)) ∈ ℝ)
58	56, 57	syl 18	. . . . . . . . . . . . . 14 ⊢ ((𝑡 ∈ 𝐴 ∧ ℎ ∈ 𝐵) → (normℎ‘(𝑡 +ℎ ℎ)) ∈ ℝ)
59		remulcl 11202	. . . . . . . . . . . . . 14 ⊢ ((𝑓 ∈ ℝ ∧ (normℎ‘(𝑡 +ℎ ℎ)) ∈ ℝ) → (𝑓 · (normℎ‘(𝑡 +ℎ ℎ))) ∈ ℝ)
60	58, 59	sylan2 605	. . . . . . . . . . . . 13 ⊢ ((𝑓 ∈ ℝ ∧ (𝑡 ∈ 𝐴 ∧ ℎ ∈ 𝐵)) → (𝑓 · (normℎ‘(𝑡 +ℎ ℎ))) ∈ ℝ)
61	60	adantlr 728	. . . . . . . . . . . 12 ⊢ (((𝑓 ∈ ℝ ∧ 𝑔 ∈ ℝ) ∧ (𝑡 ∈ 𝐴 ∧ ℎ ∈ 𝐵)) → (𝑓 · (normℎ‘(𝑡 +ℎ ℎ))) ∈ ℝ)
62		remulcl 11202	. . . . . . . . . . . . . 14 ⊢ ((𝑔 ∈ ℝ ∧ (normℎ‘(𝑡 +ℎ ℎ)) ∈ ℝ) → (𝑔 · (normℎ‘(𝑡 +ℎ ℎ))) ∈ ℝ)
63	58, 62	sylan2 605	. . . . . . . . . . . . 13 ⊢ ((𝑔 ∈ ℝ ∧ (𝑡 ∈ 𝐴 ∧ ℎ ∈ 𝐵)) → (𝑔 · (normℎ‘(𝑡 +ℎ ℎ))) ∈ ℝ)
64	63	adantll 727	. . . . . . . . . . . 12 ⊢ (((𝑓 ∈ ℝ ∧ 𝑔 ∈ ℝ) ∧ (𝑡 ∈ 𝐴 ∧ ℎ ∈ 𝐵)) → (𝑔 · (normℎ‘(𝑡 +ℎ ℎ))) ∈ ℝ)
65		le2add 11713	. . . . . . . . . . . 12 ⊢ ((((normℎ‘𝑡) ∈ ℝ ∧ (normℎ‘ℎ) ∈ ℝ) ∧ ((𝑓 · (normℎ‘(𝑡 +ℎ ℎ))) ∈ ℝ ∧ (𝑔 · (normℎ‘(𝑡 +ℎ ℎ))) ∈ ℝ)) → (((normℎ‘𝑡) ≤ (𝑓 · (normℎ‘(𝑡 +ℎ ℎ))) ∧ (normℎ‘ℎ) ≤ (𝑔 · (normℎ‘(𝑡 +ℎ ℎ)))) → ((normℎ‘𝑡) + (normℎ‘ℎ)) ≤ ((𝑓 · (normℎ‘(𝑡 +ℎ ℎ))) + (𝑔 · (normℎ‘(𝑡 +ℎ ℎ))))))
66	54, 61, 64, 65	syl12anc 850	. . . . . . . . . . 11 ⊢ (((𝑓 ∈ ℝ ∧ 𝑔 ∈ ℝ) ∧ (𝑡 ∈ 𝐴 ∧ ℎ ∈ 𝐵)) → (((normℎ‘𝑡) ≤ (𝑓 · (normℎ‘(𝑡 +ℎ ℎ))) ∧ (normℎ‘ℎ) ≤ (𝑔 · (normℎ‘(𝑡 +ℎ ℎ)))) → ((normℎ‘𝑡) + (normℎ‘ℎ)) ≤ ((𝑓 · (normℎ‘(𝑡 +ℎ ℎ))) + (𝑔 · (normℎ‘(𝑡 +ℎ ℎ))))))
67	66	adantll 727	. . . . . . . . . 10 ⊢ ((((𝐴 ∩ 𝐵) = 0ℋ ∧ (𝑓 ∈ ℝ ∧ 𝑔 ∈ ℝ)) ∧ (𝑡 ∈ 𝐴 ∧ ℎ ∈ 𝐵)) → (((normℎ‘𝑡) ≤ (𝑓 · (normℎ‘(𝑡 +ℎ ℎ))) ∧ (normℎ‘ℎ) ≤ (𝑔 · (normℎ‘(𝑡 +ℎ ℎ)))) → ((normℎ‘𝑡) + (normℎ‘ℎ)) ≤ ((𝑓 · (normℎ‘(𝑡 +ℎ ℎ))) + (𝑔 · (normℎ‘(𝑡 +ℎ ℎ))))))
68	1, 2, 4	cdj3lem2 32860	. . . . . . . . . . . . . . . 16 ⊢ ((𝑡 ∈ 𝐴 ∧ ℎ ∈ 𝐵 ∧ (𝐴 ∩ 𝐵) = 0ℋ) → (𝑆‘(𝑡 +ℎ ℎ)) = 𝑡)
69	68	fveq2d 6889	. . . . . . . . . . . . . . 15 ⊢ ((𝑡 ∈ 𝐴 ∧ ℎ ∈ 𝐵 ∧ (𝐴 ∩ 𝐵) = 0ℋ) → (normℎ‘(𝑆‘(𝑡 +ℎ ℎ))) = (normℎ‘𝑡))
70	69	breq1d 5121	. . . . . . . . . . . . . 14 ⊢ ((𝑡 ∈ 𝐴 ∧ ℎ ∈ 𝐵 ∧ (𝐴 ∩ 𝐵) = 0ℋ) → ((normℎ‘(𝑆‘(𝑡 +ℎ ℎ))) ≤ (𝑓 · (normℎ‘(𝑡 +ℎ ℎ))) ↔ (normℎ‘𝑡) ≤ (𝑓 · (normℎ‘(𝑡 +ℎ ℎ)))))
71	1, 2, 8	cdj3lem3 32863	. . . . . . . . . . . . . . . 16 ⊢ ((𝑡 ∈ 𝐴 ∧ ℎ ∈ 𝐵 ∧ (𝐴 ∩ 𝐵) = 0ℋ) → (𝑇‘(𝑡 +ℎ ℎ)) = ℎ)
72	71	fveq2d 6889	. . . . . . . . . . . . . . 15 ⊢ ((𝑡 ∈ 𝐴 ∧ ℎ ∈ 𝐵 ∧ (𝐴 ∩ 𝐵) = 0ℋ) → (normℎ‘(𝑇‘(𝑡 +ℎ ℎ))) = (normℎ‘ℎ))
73	72	breq1d 5121	. . . . . . . . . . . . . 14 ⊢ ((𝑡 ∈ 𝐴 ∧ ℎ ∈ 𝐵 ∧ (𝐴 ∩ 𝐵) = 0ℋ) → ((normℎ‘(𝑇‘(𝑡 +ℎ ℎ))) ≤ (𝑔 · (normℎ‘(𝑡 +ℎ ℎ))) ↔ (normℎ‘ℎ) ≤ (𝑔 · (normℎ‘(𝑡 +ℎ ℎ)))))
74	70, 73	anbi12d 644	. . . . . . . . . . . . 13 ⊢ ((𝑡 ∈ 𝐴 ∧ ℎ ∈ 𝐵 ∧ (𝐴 ∩ 𝐵) = 0ℋ) → (((normℎ‘(𝑆‘(𝑡 +ℎ ℎ))) ≤ (𝑓 · (normℎ‘(𝑡 +ℎ ℎ))) ∧ (normℎ‘(𝑇‘(𝑡 +ℎ ℎ))) ≤ (𝑔 · (normℎ‘(𝑡 +ℎ ℎ)))) ↔ ((normℎ‘𝑡) ≤ (𝑓 · (normℎ‘(𝑡 +ℎ ℎ))) ∧ (normℎ‘ℎ) ≤ (𝑔 · (normℎ‘(𝑡 +ℎ ℎ))))))
75	74	3expa 1136	. . . . . . . . . . . 12 ⊢ (((𝑡 ∈ 𝐴 ∧ ℎ ∈ 𝐵) ∧ (𝐴 ∩ 𝐵) = 0ℋ) → (((normℎ‘(𝑆‘(𝑡 +ℎ ℎ))) ≤ (𝑓 · (normℎ‘(𝑡 +ℎ ℎ))) ∧ (normℎ‘(𝑇‘(𝑡 +ℎ ℎ))) ≤ (𝑔 · (normℎ‘(𝑡 +ℎ ℎ)))) ↔ ((normℎ‘𝑡) ≤ (𝑓 · (normℎ‘(𝑡 +ℎ ℎ))) ∧ (normℎ‘ℎ) ≤ (𝑔 · (normℎ‘(𝑡 +ℎ ℎ))))))
76	75	ancoms 464	. . . . . . . . . . 11 ⊢ (((𝐴 ∩ 𝐵) = 0ℋ ∧ (𝑡 ∈ 𝐴 ∧ ℎ ∈ 𝐵)) → (((normℎ‘(𝑆‘(𝑡 +ℎ ℎ))) ≤ (𝑓 · (normℎ‘(𝑡 +ℎ ℎ))) ∧ (normℎ‘(𝑇‘(𝑡 +ℎ ℎ))) ≤ (𝑔 · (normℎ‘(𝑡 +ℎ ℎ)))) ↔ ((normℎ‘𝑡) ≤ (𝑓 · (normℎ‘(𝑡 +ℎ ℎ))) ∧ (normℎ‘ℎ) ≤ (𝑔 · (normℎ‘(𝑡 +ℎ ℎ))))))
77	76	adantlr 728	. . . . . . . . . 10 ⊢ ((((𝐴 ∩ 𝐵) = 0ℋ ∧ (𝑓 ∈ ℝ ∧ 𝑔 ∈ ℝ)) ∧ (𝑡 ∈ 𝐴 ∧ ℎ ∈ 𝐵)) → (((normℎ‘(𝑆‘(𝑡 +ℎ ℎ))) ≤ (𝑓 · (normℎ‘(𝑡 +ℎ ℎ))) ∧ (normℎ‘(𝑇‘(𝑡 +ℎ ℎ))) ≤ (𝑔 · (normℎ‘(𝑡 +ℎ ℎ)))) ↔ ((normℎ‘𝑡) ≤ (𝑓 · (normℎ‘(𝑡 +ℎ ℎ))) ∧ (normℎ‘ℎ) ≤ (𝑔 · (normℎ‘(𝑡 +ℎ ℎ))))))
78		recn 11207	. . . . . . . . . . . . . 14 ⊢ (𝑓 ∈ ℝ → 𝑓 ∈ ℂ)
79		recn 11207	. . . . . . . . . . . . . 14 ⊢ (𝑔 ∈ ℝ → 𝑔 ∈ ℂ)
80	58	recnd 11254	. . . . . . . . . . . . . 14 ⊢ ((𝑡 ∈ 𝐴 ∧ ℎ ∈ 𝐵) → (normℎ‘(𝑡 +ℎ ℎ)) ∈ ℂ)
81		adddir 11214	. . . . . . . . . . . . . 14 ⊢ ((𝑓 ∈ ℂ ∧ 𝑔 ∈ ℂ ∧ (normℎ‘(𝑡 +ℎ ℎ)) ∈ ℂ) → ((𝑓 + 𝑔) · (normℎ‘(𝑡 +ℎ ℎ))) = ((𝑓 · (normℎ‘(𝑡 +ℎ ℎ))) + (𝑔 · (normℎ‘(𝑡 +ℎ ℎ)))))
82	78, 79, 80, 81	syl3an 1178	. . . . . . . . . . . . 13 ⊢ ((𝑓 ∈ ℝ ∧ 𝑔 ∈ ℝ ∧ (𝑡 ∈ 𝐴 ∧ ℎ ∈ 𝐵)) → ((𝑓 + 𝑔) · (normℎ‘(𝑡 +ℎ ℎ))) = ((𝑓 · (normℎ‘(𝑡 +ℎ ℎ))) + (𝑔 · (normℎ‘(𝑡 +ℎ ℎ)))))
83	82	3expa 1136	. . . . . . . . . . . 12 ⊢ (((𝑓 ∈ ℝ ∧ 𝑔 ∈ ℝ) ∧ (𝑡 ∈ 𝐴 ∧ ℎ ∈ 𝐵)) → ((𝑓 + 𝑔) · (normℎ‘(𝑡 +ℎ ℎ))) = ((𝑓 · (normℎ‘(𝑡 +ℎ ℎ))) + (𝑔 · (normℎ‘(𝑡 +ℎ ℎ)))))
84	83	breq2d 5123	. . . . . . . . . . 11 ⊢ (((𝑓 ∈ ℝ ∧ 𝑔 ∈ ℝ) ∧ (𝑡 ∈ 𝐴 ∧ ℎ ∈ 𝐵)) → (((normℎ‘𝑡) + (normℎ‘ℎ)) ≤ ((𝑓 + 𝑔) · (normℎ‘(𝑡 +ℎ ℎ))) ↔ ((normℎ‘𝑡) + (normℎ‘ℎ)) ≤ ((𝑓 · (normℎ‘(𝑡 +ℎ ℎ))) + (𝑔 · (normℎ‘(𝑡 +ℎ ℎ))))))
85	84	adantll 727	. . . . . . . . . 10 ⊢ ((((𝐴 ∩ 𝐵) = 0ℋ ∧ (𝑓 ∈ ℝ ∧ 𝑔 ∈ ℝ)) ∧ (𝑡 ∈ 𝐴 ∧ ℎ ∈ 𝐵)) → (((normℎ‘𝑡) + (normℎ‘ℎ)) ≤ ((𝑓 + 𝑔) · (normℎ‘(𝑡 +ℎ ℎ))) ↔ ((normℎ‘𝑡) + (normℎ‘ℎ)) ≤ ((𝑓 · (normℎ‘(𝑡 +ℎ ℎ))) + (𝑔 · (normℎ‘(𝑡 +ℎ ℎ))))))
86	67, 77, 85	3imtr4d 297	. . . . . . . . 9 ⊢ ((((𝐴 ∩ 𝐵) = 0ℋ ∧ (𝑓 ∈ ℝ ∧ 𝑔 ∈ ℝ)) ∧ (𝑡 ∈ 𝐴 ∧ ℎ ∈ 𝐵)) → (((normℎ‘(𝑆‘(𝑡 +ℎ ℎ))) ≤ (𝑓 · (normℎ‘(𝑡 +ℎ ℎ))) ∧ (normℎ‘(𝑇‘(𝑡 +ℎ ℎ))) ≤ (𝑔 · (normℎ‘(𝑡 +ℎ ℎ)))) → ((normℎ‘𝑡) + (normℎ‘ℎ)) ≤ ((𝑓 + 𝑔) · (normℎ‘(𝑡 +ℎ ℎ)))))
87	46, 86	syld 48	. . . . . . . 8 ⊢ ((((𝐴 ∩ 𝐵) = 0ℋ ∧ (𝑓 ∈ ℝ ∧ 𝑔 ∈ ℝ)) ∧ (𝑡 ∈ 𝐴 ∧ ℎ ∈ 𝐵)) → ((∀𝑢 ∈ (𝐴 +ℋ 𝐵)(normℎ‘(𝑆‘𝑢)) ≤ (𝑓 · (normℎ‘𝑢)) ∧ ∀𝑢 ∈ (𝐴 +ℋ 𝐵)(normℎ‘(𝑇‘𝑢)) ≤ (𝑔 · (normℎ‘𝑢))) → ((normℎ‘𝑡) + (normℎ‘ℎ)) ≤ ((𝑓 + 𝑔) · (normℎ‘(𝑡 +ℎ ℎ)))))
88	87	ralrimdvva 3222	. . . . . . 7 ⊢ (((𝐴 ∩ 𝐵) = 0ℋ ∧ (𝑓 ∈ ℝ ∧ 𝑔 ∈ ℝ)) → ((∀𝑢 ∈ (𝐴 +ℋ 𝐵)(normℎ‘(𝑆‘𝑢)) ≤ (𝑓 · (normℎ‘𝑢)) ∧ ∀𝑢 ∈ (𝐴 +ℋ 𝐵)(normℎ‘(𝑇‘𝑢)) ≤ (𝑔 · (normℎ‘𝑢))) → ∀𝑡 ∈ 𝐴 ∀ℎ ∈ 𝐵 ((normℎ‘𝑡) + (normℎ‘ℎ)) ≤ ((𝑓 + 𝑔) · (normℎ‘(𝑡 +ℎ ℎ)))))
89		readdcl 11200	. . . . . . . . 9 ⊢ ((𝑓 ∈ ℝ ∧ 𝑔 ∈ ℝ) → (𝑓 + 𝑔) ∈ ℝ)
90		breq2 5115	. . . . . . . . . . . 12 ⊢ (𝑣 = (𝑓 + 𝑔) → (0 < 𝑣 ↔ 0 < (𝑓 + 𝑔)))
91		fveq2 6885	. . . . . . . . . . . . . . . 16 ⊢ (𝑥 = 𝑡 → (normℎ‘𝑥) = (normℎ‘𝑡))
92	91	oveq1d 7434	. . . . . . . . . . . . . . 15 ⊢ (𝑥 = 𝑡 → ((normℎ‘𝑥) + (normℎ‘𝑦)) = ((normℎ‘𝑡) + (normℎ‘𝑦)))
93		fvoveq1 7442	. . . . . . . . . . . . . . . 16 ⊢ (𝑥 = 𝑡 → (normℎ‘(𝑥 +ℎ 𝑦)) = (normℎ‘(𝑡 +ℎ 𝑦)))
94	93	oveq2d 7435	. . . . . . . . . . . . . . 15 ⊢ (𝑥 = 𝑡 → (𝑣 · (normℎ‘(𝑥 +ℎ 𝑦))) = (𝑣 · (normℎ‘(𝑡 +ℎ 𝑦))))
95	92, 94	breq12d 5124	. . . . . . . . . . . . . 14 ⊢ (𝑥 = 𝑡 → (((normℎ‘𝑥) + (normℎ‘𝑦)) ≤ (𝑣 · (normℎ‘(𝑥 +ℎ 𝑦))) ↔ ((normℎ‘𝑡) + (normℎ‘𝑦)) ≤ (𝑣 · (normℎ‘(𝑡 +ℎ 𝑦)))))
96		fveq2 6885	. . . . . . . . . . . . . . . 16 ⊢ (𝑦 = ℎ → (normℎ‘𝑦) = (normℎ‘ℎ))
97	96	oveq2d 7435	. . . . . . . . . . . . . . 15 ⊢ (𝑦 = ℎ → ((normℎ‘𝑡) + (normℎ‘𝑦)) = ((normℎ‘𝑡) + (normℎ‘ℎ)))
98		oveq2 7427	. . . . . . . . . . . . . . . . 17 ⊢ (𝑦 = ℎ → (𝑡 +ℎ 𝑦) = (𝑡 +ℎ ℎ))
99	98	fveq2d 6889	. . . . . . . . . . . . . . . 16 ⊢ (𝑦 = ℎ → (normℎ‘(𝑡 +ℎ 𝑦)) = (normℎ‘(𝑡 +ℎ ℎ)))
100	99	oveq2d 7435	. . . . . . . . . . . . . . 15 ⊢ (𝑦 = ℎ → (𝑣 · (normℎ‘(𝑡 +ℎ 𝑦))) = (𝑣 · (normℎ‘(𝑡 +ℎ ℎ))))
101	97, 100	breq12d 5124	. . . . . . . . . . . . . 14 ⊢ (𝑦 = ℎ → (((normℎ‘𝑡) + (normℎ‘𝑦)) ≤ (𝑣 · (normℎ‘(𝑡 +ℎ 𝑦))) ↔ ((normℎ‘𝑡) + (normℎ‘ℎ)) ≤ (𝑣 · (normℎ‘(𝑡 +ℎ ℎ)))))
102	95, 101	cbvral2vw 3249	. . . . . . . . . . . . 13 ⊢ (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 ((normℎ‘𝑥) + (normℎ‘𝑦)) ≤ (𝑣 · (normℎ‘(𝑥 +ℎ 𝑦))) ↔ ∀𝑡 ∈ 𝐴 ∀ℎ ∈ 𝐵 ((normℎ‘𝑡) + (normℎ‘ℎ)) ≤ (𝑣 · (normℎ‘(𝑡 +ℎ ℎ))))
103		oveq1 7426	. . . . . . . . . . . . . . 15 ⊢ (𝑣 = (𝑓 + 𝑔) → (𝑣 · (normℎ‘(𝑡 +ℎ ℎ))) = ((𝑓 + 𝑔) · (normℎ‘(𝑡 +ℎ ℎ))))
104	103	breq2d 5123	. . . . . . . . . . . . . 14 ⊢ (𝑣 = (𝑓 + 𝑔) → (((normℎ‘𝑡) + (normℎ‘ℎ)) ≤ (𝑣 · (normℎ‘(𝑡 +ℎ ℎ))) ↔ ((normℎ‘𝑡) + (normℎ‘ℎ)) ≤ ((𝑓 + 𝑔) · (normℎ‘(𝑡 +ℎ ℎ)))))
105	104	2ralbidv 3231	. . . . . . . . . . . . 13 ⊢ (𝑣 = (𝑓 + 𝑔) → (∀𝑡 ∈ 𝐴 ∀ℎ ∈ 𝐵 ((normℎ‘𝑡) + (normℎ‘ℎ)) ≤ (𝑣 · (normℎ‘(𝑡 +ℎ ℎ))) ↔ ∀𝑡 ∈ 𝐴 ∀ℎ ∈ 𝐵 ((normℎ‘𝑡) + (normℎ‘ℎ)) ≤ ((𝑓 + 𝑔) · (normℎ‘(𝑡 +ℎ ℎ)))))
106	102, 105	bitrid 286	. . . . . . . . . . . 12 ⊢ (𝑣 = (𝑓 + 𝑔) → (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 ((normℎ‘𝑥) + (normℎ‘𝑦)) ≤ (𝑣 · (normℎ‘(𝑥 +ℎ 𝑦))) ↔ ∀𝑡 ∈ 𝐴 ∀ℎ ∈ 𝐵 ((normℎ‘𝑡) + (normℎ‘ℎ)) ≤ ((𝑓 + 𝑔) · (normℎ‘(𝑡 +ℎ ℎ)))))
107	90, 106	anbi12d 644	. . . . . . . . . . 11 ⊢ (𝑣 = (𝑓 + 𝑔) → ((0 < 𝑣 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 ((normℎ‘𝑥) + (normℎ‘𝑦)) ≤ (𝑣 · (normℎ‘(𝑥 +ℎ 𝑦)))) ↔ (0 < (𝑓 + 𝑔) ∧ ∀𝑡 ∈ 𝐴 ∀ℎ ∈ 𝐵 ((normℎ‘𝑡) + (normℎ‘ℎ)) ≤ ((𝑓 + 𝑔) · (normℎ‘(𝑡 +ℎ ℎ))))))
108	107	rspcev 3583	. . . . . . . . . 10 ⊢ (((𝑓 + 𝑔) ∈ ℝ ∧ (0 < (𝑓 + 𝑔) ∧ ∀𝑡 ∈ 𝐴 ∀ℎ ∈ 𝐵 ((normℎ‘𝑡) + (normℎ‘ℎ)) ≤ ((𝑓 + 𝑔) · (normℎ‘(𝑡 +ℎ ℎ))))) → ∃𝑣 ∈ ℝ (0 < 𝑣 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 ((normℎ‘𝑥) + (normℎ‘𝑦)) ≤ (𝑣 · (normℎ‘(𝑥 +ℎ 𝑦)))))
109	108	ex 418	. . . . . . . . 9 ⊢ ((𝑓 + 𝑔) ∈ ℝ → ((0 < (𝑓 + 𝑔) ∧ ∀𝑡 ∈ 𝐴 ∀ℎ ∈ 𝐵 ((normℎ‘𝑡) + (normℎ‘ℎ)) ≤ ((𝑓 + 𝑔) · (normℎ‘(𝑡 +ℎ ℎ)))) → ∃𝑣 ∈ ℝ (0 < 𝑣 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 ((normℎ‘𝑥) + (normℎ‘𝑦)) ≤ (𝑣 · (normℎ‘(𝑥 +ℎ 𝑦))))))
110	89, 109	syl 18	. . . . . . . 8 ⊢ ((𝑓 ∈ ℝ ∧ 𝑔 ∈ ℝ) → ((0 < (𝑓 + 𝑔) ∧ ∀𝑡 ∈ 𝐴 ∀ℎ ∈ 𝐵 ((normℎ‘𝑡) + (normℎ‘ℎ)) ≤ ((𝑓 + 𝑔) · (normℎ‘(𝑡 +ℎ ℎ)))) → ∃𝑣 ∈ ℝ (0 < 𝑣 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 ((normℎ‘𝑥) + (normℎ‘𝑦)) ≤ (𝑣 · (normℎ‘(𝑥 +ℎ 𝑦))))))
111	110	adantl 487	. . . . . . 7 ⊢ (((𝐴 ∩ 𝐵) = 0ℋ ∧ (𝑓 ∈ ℝ ∧ 𝑔 ∈ ℝ)) → ((0 < (𝑓 + 𝑔) ∧ ∀𝑡 ∈ 𝐴 ∀ℎ ∈ 𝐵 ((normℎ‘𝑡) + (normℎ‘ℎ)) ≤ ((𝑓 + 𝑔) · (normℎ‘(𝑡 +ℎ ℎ)))) → ∃𝑣 ∈ ℝ (0 < 𝑣 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 ((normℎ‘𝑥) + (normℎ‘𝑦)) ≤ (𝑣 · (normℎ‘(𝑥 +ℎ 𝑦))))))
112	33, 88, 111	syl2and 620	. . . . . 6 ⊢ (((𝐴 ∩ 𝐵) = 0ℋ ∧ (𝑓 ∈ ℝ ∧ 𝑔 ∈ ℝ)) → (((0 < 𝑓 ∧ 0 < 𝑔) ∧ (∀𝑢 ∈ (𝐴 +ℋ 𝐵)(normℎ‘(𝑆‘𝑢)) ≤ (𝑓 · (normℎ‘𝑢)) ∧ ∀𝑢 ∈ (𝐴 +ℋ 𝐵)(normℎ‘(𝑇‘𝑢)) ≤ (𝑔 · (normℎ‘𝑢)))) → ∃𝑣 ∈ ℝ (0 < 𝑣 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 ((normℎ‘𝑥) + (normℎ‘𝑦)) ≤ (𝑣 · (normℎ‘(𝑥 +ℎ 𝑦))))))
113	30, 112	biimtrid 245	. . . . 5 ⊢ (((𝐴 ∩ 𝐵) = 0ℋ ∧ (𝑓 ∈ ℝ ∧ 𝑔 ∈ ℝ)) → (((0 < 𝑓 ∧ ∀𝑢 ∈ (𝐴 +ℋ 𝐵)(normℎ‘(𝑆‘𝑢)) ≤ (𝑓 · (normℎ‘𝑢))) ∧ (0 < 𝑔 ∧ ∀𝑢 ∈ (𝐴 +ℋ 𝐵)(normℎ‘(𝑇‘𝑢)) ≤ (𝑔 · (normℎ‘𝑢)))) → ∃𝑣 ∈ ℝ (0 < 𝑣 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 ((normℎ‘𝑥) + (normℎ‘𝑦)) ≤ (𝑣 · (normℎ‘(𝑥 +ℎ 𝑦))))))
114	113	rexlimdvva 3224	. . . 4 ⊢ ((𝐴 ∩ 𝐵) = 0ℋ → (∃𝑓 ∈ ℝ ∃𝑔 ∈ ℝ ((0 < 𝑓 ∧ ∀𝑢 ∈ (𝐴 +ℋ 𝐵)(normℎ‘(𝑆‘𝑢)) ≤ (𝑓 · (normℎ‘𝑢))) ∧ (0 < 𝑔 ∧ ∀𝑢 ∈ (𝐴 +ℋ 𝐵)(normℎ‘(𝑇‘𝑢)) ≤ (𝑔 · (normℎ‘𝑢)))) → ∃𝑣 ∈ ℝ (0 < 𝑣 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 ((normℎ‘𝑥) + (normℎ‘𝑦)) ≤ (𝑣 · (normℎ‘(𝑥 +ℎ 𝑦))))))
115	29, 114	biimtrid 245	. . 3 ⊢ ((𝐴 ∩ 𝐵) = 0ℋ → ((𝜑 ∧ 𝜓) → ∃𝑣 ∈ ℝ (0 < 𝑣 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 ((normℎ‘𝑥) + (normℎ‘𝑦)) ≤ (𝑣 · (normℎ‘(𝑥 +ℎ 𝑦))))))
116	115	3impib 1134	. 2 ⊢ (((𝐴 ∩ 𝐵) = 0ℋ ∧ 𝜑 ∧ 𝜓) → ∃𝑣 ∈ ℝ (0 < 𝑣 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 ((normℎ‘𝑥) + (normℎ‘𝑦)) ≤ (𝑣 · (normℎ‘(𝑥 +ℎ 𝑦)))))
117	12, 116	impbii 212	1 ⊢ (∃𝑣 ∈ ℝ (0 < 𝑣 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 ((normℎ‘𝑥) + (normℎ‘𝑦)) ≤ (𝑣 · (normℎ‘(𝑥 +ℎ 𝑦)))) ↔ ((𝐴 ∩ 𝐵) = 0ℋ ∧ 𝜑 ∧ 𝜓))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2146  ∀wral 3081  ∃wrex 3091   ∩ cin 3905   class class class wbr 5111   ↦ cmpt 5194  ‘cfv 6540  ℩crio 7375  (class class class)co 7419  ℂcc 11115  ℝcr 11116  0cc0 11117   + caddc 11120   · cmul 11122   < clt 11260   ≤ cle 11261   ℋchba 31344   +_ℎ cva 31345  norm_ℎcno 31348   S_ℋ csh 31353   +_ℋ cph 31356  0_ℋc0h 31360

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2737  ax-rep 5240  ax-sep 5259  ax-nul 5271  ax-pow 5338  ax-pr 5406  ax-un 7742  ax-cnex 11173  ax-resscn 11174  ax-1cn 11175  ax-icn 11176  ax-addcl 11177  ax-addrcl 11178  ax-mulcl 11179  ax-mulrcl 11180  ax-mulcom 11181  ax-addass 11182  ax-mulass 11183  ax-distr 11184  ax-i2m1 11185  ax-1ne0 11186  ax-1rid 11187  ax-rnegex 11188  ax-rrecex 11189  ax-cnre 11190  ax-pre-lttri 11191  ax-pre-lttrn 11192  ax-pre-ltadd 11193  ax-pre-mulgt0 11194  ax-pre-sup 11195  ax-hilex 31424  ax-hfvadd 31425  ax-hvcom 31426  ax-hvass 31427  ax-hv0cl 31428  ax-hvaddid 31429  ax-hfvmul 31430  ax-hvmulid 31431  ax-hvmulass 31432  ax-hvdistr1 31433  ax-hvdistr2 31434  ax-hvmul0 31435  ax-hfi 31504  ax-his1 31507  ax-his3 31509  ax-his4 31510

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ne 2961  df-nel 3067  df-ral 3082  df-rex 3092  df-rmo 3371  df-reu 3372  df-rab 3419  df-v 3459  df-sbc 3747  df-csb 3855  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-pss 3926  df-nul 4287  df-if 4490  df-pw 4566  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4875  df-int 4915  df-iun 4960  df-br 5112  df-opab 5176  df-mpt 5195  df-tr 5221  df-id 5558  df-eprel 5563  df-po 5571  df-so 5572  df-fr 5616  df-we 5618  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-rn 5674  df-res 5675  df-ima 5676  df-pred 6306  df-ord 6367  df-on 6368  df-lim 6369  df-suc 6370  df-iota 6496  df-fun 6542  df-fn 6543  df-f 6544  df-f1 6545  df-fo 6546  df-f1o 6547  df-fv 6548  df-riota 7376  df-ov 7422  df-oprab 7423  df-mpo 7424  df-om 7869  df-2nd 7993  df-frecs 8284  df-wrecs 8315  df-recs 8364  df-rdg 8403  df-er 8700  df-en 8950  df-dom 8951  df-sdom 8952  df-sup 9409  df-pnf 11262  df-mnf 11263  df-xr 11264  df-ltxr 11265  df-le 11266  df-sub 11460  df-neg 11461  df-div 11889  df-nn 12251  df-2 12320  df-3 12321  df-n0 12522  df-z 12609  df-uz 12881  df-rp 13035  df-seq 14058  df-exp 14118  df-cj 15176  df-re 15177  df-im 15178  df-sqrt 15312  df-abs 15313  df-grpo 30918  df-ablo 30970  df-hnorm 31393  df-hvsub 31396  df-sh 31632  df-ch0 31678  df-shs 31733

This theorem is used by: (None)