Theorem cdj3i 32470

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 32463	. . 3 ⊢ (∃𝑣 ∈ ℝ (0 < 𝑣 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 ((normℎ‘𝑥) + (normℎ‘𝑦)) ≤ (𝑣 · (normℎ‘(𝑥 +ℎ 𝑦)))) → (𝐴 ∩ 𝐵) = 0ℋ)
4		cdj3.3	. . . . 5 ⊢ 𝑆 = (𝑥 ∈ (𝐴 +ℋ 𝐵) ↦ (℩𝑧 ∈ 𝐴 ∃𝑤 ∈ 𝐵 𝑥 = (𝑧 +ℎ 𝑤)))
5	1, 2, 4	cdj3lem2b 32466	. . . 4 ⊢ (∃𝑣 ∈ ℝ (0 < 𝑣 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 ((normℎ‘𝑥) + (normℎ‘𝑦)) ≤ (𝑣 · (normℎ‘(𝑥 +ℎ 𝑦)))) → ∃𝑣 ∈ ℝ (0 < 𝑣 ∧ ∀𝑢 ∈ (𝐴 +ℋ 𝐵)(normℎ‘(𝑆‘𝑢)) ≤ (𝑣 · (normℎ‘𝑢))))
6		cdj3.5	. . . 4 ⊢ (𝜑 ↔ ∃𝑣 ∈ ℝ (0 < 𝑣 ∧ ∀𝑢 ∈ (𝐴 +ℋ 𝐵)(normℎ‘(𝑆‘𝑢)) ≤ (𝑣 · (normℎ‘𝑢))))
7	5, 6	sylibr 234	. . 3 ⊢ (∃𝑣 ∈ ℝ (0 < 𝑣 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 ((normℎ‘𝑥) + (normℎ‘𝑦)) ≤ (𝑣 · (normℎ‘(𝑥 +ℎ 𝑦)))) → 𝜑)
8		cdj3.4	. . . . 5 ⊢ 𝑇 = (𝑥 ∈ (𝐴 +ℋ 𝐵) ↦ (℩𝑤 ∈ 𝐵 ∃𝑧 ∈ 𝐴 𝑥 = (𝑧 +ℎ 𝑤)))
9	1, 2, 8	cdj3lem3b 32469	. . . 4 ⊢ (∃𝑣 ∈ ℝ (0 < 𝑣 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 ((normℎ‘𝑥) + (normℎ‘𝑦)) ≤ (𝑣 · (normℎ‘(𝑥 +ℎ 𝑦)))) → ∃𝑣 ∈ ℝ (0 < 𝑣 ∧ ∀𝑢 ∈ (𝐴 +ℋ 𝐵)(normℎ‘(𝑇‘𝑢)) ≤ (𝑣 · (normℎ‘𝑢))))
10		cdj3.6	. . . 4 ⊢ (𝜓 ↔ ∃𝑣 ∈ ℝ (0 < 𝑣 ∧ ∀𝑢 ∈ (𝐴 +ℋ 𝐵)(normℎ‘(𝑇‘𝑢)) ≤ (𝑣 · (normℎ‘𝑢))))
11	9, 10	sylibr 234	. . 3 ⊢ (∃𝑣 ∈ ℝ (0 < 𝑣 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 ((normℎ‘𝑥) + (normℎ‘𝑦)) ≤ (𝑣 · (normℎ‘(𝑥 +ℎ 𝑦)))) → 𝜓)
12	3, 7, 11	3jca 1127	. 2 ⊢ (∃𝑣 ∈ ℝ (0 < 𝑣 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 ((normℎ‘𝑥) + (normℎ‘𝑦)) ≤ (𝑣 · (normℎ‘(𝑥 +ℎ 𝑦)))) → ((𝐴 ∩ 𝐵) = 0ℋ ∧ 𝜑 ∧ 𝜓))
13		breq2 5152	. . . . . . . . 9 ⊢ (𝑣 = 𝑓 → (0 < 𝑣 ↔ 0 < 𝑓))
14		oveq1 7438	. . . . . . . . . . 11 ⊢ (𝑣 = 𝑓 → (𝑣 · (normℎ‘𝑢)) = (𝑓 · (normℎ‘𝑢)))
15	14	breq2d 5160	. . . . . . . . . 10 ⊢ (𝑣 = 𝑓 → ((normℎ‘(𝑆‘𝑢)) ≤ (𝑣 · (normℎ‘𝑢)) ↔ (normℎ‘(𝑆‘𝑢)) ≤ (𝑓 · (normℎ‘𝑢))))
16	15	ralbidv 3176	. . . . . . . . 9 ⊢ (𝑣 = 𝑓 → (∀𝑢 ∈ (𝐴 +ℋ 𝐵)(normℎ‘(𝑆‘𝑢)) ≤ (𝑣 · (normℎ‘𝑢)) ↔ ∀𝑢 ∈ (𝐴 +ℋ 𝐵)(normℎ‘(𝑆‘𝑢)) ≤ (𝑓 · (normℎ‘𝑢))))
17	13, 16	anbi12d 632	. . . . . . . 8 ⊢ (𝑣 = 𝑓 → ((0 < 𝑣 ∧ ∀𝑢 ∈ (𝐴 +ℋ 𝐵)(normℎ‘(𝑆‘𝑢)) ≤ (𝑣 · (normℎ‘𝑢))) ↔ (0 < 𝑓 ∧ ∀𝑢 ∈ (𝐴 +ℋ 𝐵)(normℎ‘(𝑆‘𝑢)) ≤ (𝑓 · (normℎ‘𝑢)))))
18	17	cbvrexvw 3236	. . . . . . 7 ⊢ (∃𝑣 ∈ ℝ (0 < 𝑣 ∧ ∀𝑢 ∈ (𝐴 +ℋ 𝐵)(normℎ‘(𝑆‘𝑢)) ≤ (𝑣 · (normℎ‘𝑢))) ↔ ∃𝑓 ∈ ℝ (0 < 𝑓 ∧ ∀𝑢 ∈ (𝐴 +ℋ 𝐵)(normℎ‘(𝑆‘𝑢)) ≤ (𝑓 · (normℎ‘𝑢))))
19	6, 18	bitri 275	. . . . . 6 ⊢ (𝜑 ↔ ∃𝑓 ∈ ℝ (0 < 𝑓 ∧ ∀𝑢 ∈ (𝐴 +ℋ 𝐵)(normℎ‘(𝑆‘𝑢)) ≤ (𝑓 · (normℎ‘𝑢))))
20		breq2 5152	. . . . . . . . 9 ⊢ (𝑣 = 𝑔 → (0 < 𝑣 ↔ 0 < 𝑔))
21		oveq1 7438	. . . . . . . . . . 11 ⊢ (𝑣 = 𝑔 → (𝑣 · (normℎ‘𝑢)) = (𝑔 · (normℎ‘𝑢)))
22	21	breq2d 5160	. . . . . . . . . 10 ⊢ (𝑣 = 𝑔 → ((normℎ‘(𝑇‘𝑢)) ≤ (𝑣 · (normℎ‘𝑢)) ↔ (normℎ‘(𝑇‘𝑢)) ≤ (𝑔 · (normℎ‘𝑢))))
23	22	ralbidv 3176	. . . . . . . . 9 ⊢ (𝑣 = 𝑔 → (∀𝑢 ∈ (𝐴 +ℋ 𝐵)(normℎ‘(𝑇‘𝑢)) ≤ (𝑣 · (normℎ‘𝑢)) ↔ ∀𝑢 ∈ (𝐴 +ℋ 𝐵)(normℎ‘(𝑇‘𝑢)) ≤ (𝑔 · (normℎ‘𝑢))))
24	20, 23	anbi12d 632	. . . . . . . 8 ⊢ (𝑣 = 𝑔 → ((0 < 𝑣 ∧ ∀𝑢 ∈ (𝐴 +ℋ 𝐵)(normℎ‘(𝑇‘𝑢)) ≤ (𝑣 · (normℎ‘𝑢))) ↔ (0 < 𝑔 ∧ ∀𝑢 ∈ (𝐴 +ℋ 𝐵)(normℎ‘(𝑇‘𝑢)) ≤ (𝑔 · (normℎ‘𝑢)))))
25	24	cbvrexvw 3236	. . . . . . 7 ⊢ (∃𝑣 ∈ ℝ (0 < 𝑣 ∧ ∀𝑢 ∈ (𝐴 +ℋ 𝐵)(normℎ‘(𝑇‘𝑢)) ≤ (𝑣 · (normℎ‘𝑢))) ↔ ∃𝑔 ∈ ℝ (0 < 𝑔 ∧ ∀𝑢 ∈ (𝐴 +ℋ 𝐵)(normℎ‘(𝑇‘𝑢)) ≤ (𝑔 · (normℎ‘𝑢))))
26	10, 25	bitri 275	. . . . . 6 ⊢ (𝜓 ↔ ∃𝑔 ∈ ℝ (0 < 𝑔 ∧ ∀𝑢 ∈ (𝐴 +ℋ 𝐵)(normℎ‘(𝑇‘𝑢)) ≤ (𝑔 · (normℎ‘𝑢))))
27	19, 26	anbi12i 628	. . . . 5 ⊢ ((𝜑 ∧ 𝜓) ↔ (∃𝑓 ∈ ℝ (0 < 𝑓 ∧ ∀𝑢 ∈ (𝐴 +ℋ 𝐵)(normℎ‘(𝑆‘𝑢)) ≤ (𝑓 · (normℎ‘𝑢))) ∧ ∃𝑔 ∈ ℝ (0 < 𝑔 ∧ ∀𝑢 ∈ (𝐴 +ℋ 𝐵)(normℎ‘(𝑇‘𝑢)) ≤ (𝑔 · (normℎ‘𝑢)))))
28		reeanv 3227	. . . . 5 ⊢ (∃𝑓 ∈ ℝ ∃𝑔 ∈ ℝ ((0 < 𝑓 ∧ ∀𝑢 ∈ (𝐴 +ℋ 𝐵)(normℎ‘(𝑆‘𝑢)) ≤ (𝑓 · (normℎ‘𝑢))) ∧ (0 < 𝑔 ∧ ∀𝑢 ∈ (𝐴 +ℋ 𝐵)(normℎ‘(𝑇‘𝑢)) ≤ (𝑔 · (normℎ‘𝑢)))) ↔ (∃𝑓 ∈ ℝ (0 < 𝑓 ∧ ∀𝑢 ∈ (𝐴 +ℋ 𝐵)(normℎ‘(𝑆‘𝑢)) ≤ (𝑓 · (normℎ‘𝑢))) ∧ ∃𝑔 ∈ ℝ (0 < 𝑔 ∧ ∀𝑢 ∈ (𝐴 +ℋ 𝐵)(normℎ‘(𝑇‘𝑢)) ≤ (𝑔 · (normℎ‘𝑢)))))
29	27, 28	bitr4i 278	. . . 4 ⊢ ((𝜑 ∧ 𝜓) ↔ ∃𝑓 ∈ ℝ ∃𝑔 ∈ ℝ ((0 < 𝑓 ∧ ∀𝑢 ∈ (𝐴 +ℋ 𝐵)(normℎ‘(𝑆‘𝑢)) ≤ (𝑓 · (normℎ‘𝑢))) ∧ (0 < 𝑔 ∧ ∀𝑢 ∈ (𝐴 +ℋ 𝐵)(normℎ‘(𝑇‘𝑢)) ≤ (𝑔 · (normℎ‘𝑢)))))
30		an4 656	. . . . . 6 ⊢ (((0 < 𝑓 ∧ ∀𝑢 ∈ (𝐴 +ℋ 𝐵)(normℎ‘(𝑆‘𝑢)) ≤ (𝑓 · (normℎ‘𝑢))) ∧ (0 < 𝑔 ∧ ∀𝑢 ∈ (𝐴 +ℋ 𝐵)(normℎ‘(𝑇‘𝑢)) ≤ (𝑔 · (normℎ‘𝑢)))) ↔ ((0 < 𝑓 ∧ 0 < 𝑔) ∧ (∀𝑢 ∈ (𝐴 +ℋ 𝐵)(normℎ‘(𝑆‘𝑢)) ≤ (𝑓 · (normℎ‘𝑢)) ∧ ∀𝑢 ∈ (𝐴 +ℋ 𝐵)(normℎ‘(𝑇‘𝑢)) ≤ (𝑔 · (normℎ‘𝑢)))))
31		addgt0 11747	. . . . . . . . 9 ⊢ (((𝑓 ∈ ℝ ∧ 𝑔 ∈ ℝ) ∧ (0 < 𝑓 ∧ 0 < 𝑔)) → 0 < (𝑓 + 𝑔))
32	31	ex 412	. . . . . . . 8 ⊢ ((𝑓 ∈ ℝ ∧ 𝑔 ∈ ℝ) → ((0 < 𝑓 ∧ 0 < 𝑔) → 0 < (𝑓 + 𝑔)))
33	32	adantl 481	. . . . . . 7 ⊢ (((𝐴 ∩ 𝐵) = 0ℋ ∧ (𝑓 ∈ ℝ ∧ 𝑔 ∈ ℝ)) → ((0 < 𝑓 ∧ 0 < 𝑔) → 0 < (𝑓 + 𝑔)))
34	1, 2	shsvai 31393	. . . . . . . . . . 11 ⊢ ((𝑡 ∈ 𝐴 ∧ ℎ ∈ 𝐵) → (𝑡 +ℎ ℎ) ∈ (𝐴 +ℋ 𝐵))
35		2fveq3 6912	. . . . . . . . . . . . . 14 ⊢ (𝑢 = (𝑡 +ℎ ℎ) → (normℎ‘(𝑆‘𝑢)) = (normℎ‘(𝑆‘(𝑡 +ℎ ℎ))))
36		fveq2 6907	. . . . . . . . . . . . . . 15 ⊢ (𝑢 = (𝑡 +ℎ ℎ) → (normℎ‘𝑢) = (normℎ‘(𝑡 +ℎ ℎ)))
37	36	oveq2d 7447	. . . . . . . . . . . . . 14 ⊢ (𝑢 = (𝑡 +ℎ ℎ) → (𝑓 · (normℎ‘𝑢)) = (𝑓 · (normℎ‘(𝑡 +ℎ ℎ))))
38	35, 37	breq12d 5161	. . . . . . . . . . . . 13 ⊢ (𝑢 = (𝑡 +ℎ ℎ) → ((normℎ‘(𝑆‘𝑢)) ≤ (𝑓 · (normℎ‘𝑢)) ↔ (normℎ‘(𝑆‘(𝑡 +ℎ ℎ))) ≤ (𝑓 · (normℎ‘(𝑡 +ℎ ℎ)))))
39	38	rspcv 3618	. . . . . . . . . . . 12 ⊢ ((𝑡 +ℎ ℎ) ∈ (𝐴 +ℋ 𝐵) → (∀𝑢 ∈ (𝐴 +ℋ 𝐵)(normℎ‘(𝑆‘𝑢)) ≤ (𝑓 · (normℎ‘𝑢)) → (normℎ‘(𝑆‘(𝑡 +ℎ ℎ))) ≤ (𝑓 · (normℎ‘(𝑡 +ℎ ℎ)))))
40		2fveq3 6912	. . . . . . . . . . . . . 14 ⊢ (𝑢 = (𝑡 +ℎ ℎ) → (normℎ‘(𝑇‘𝑢)) = (normℎ‘(𝑇‘(𝑡 +ℎ ℎ))))
41	36	oveq2d 7447	. . . . . . . . . . . . . 14 ⊢ (𝑢 = (𝑡 +ℎ ℎ) → (𝑔 · (normℎ‘𝑢)) = (𝑔 · (normℎ‘(𝑡 +ℎ ℎ))))
42	40, 41	breq12d 5161	. . . . . . . . . . . . 13 ⊢ (𝑢 = (𝑡 +ℎ ℎ) → ((normℎ‘(𝑇‘𝑢)) ≤ (𝑔 · (normℎ‘𝑢)) ↔ (normℎ‘(𝑇‘(𝑡 +ℎ ℎ))) ≤ (𝑔 · (normℎ‘(𝑡 +ℎ ℎ)))))
43	42	rspcv 3618	. . . . . . . . . . . 12 ⊢ ((𝑡 +ℎ ℎ) ∈ (𝐴 +ℋ 𝐵) → (∀𝑢 ∈ (𝐴 +ℋ 𝐵)(normℎ‘(𝑇‘𝑢)) ≤ (𝑔 · (normℎ‘𝑢)) → (normℎ‘(𝑇‘(𝑡 +ℎ ℎ))) ≤ (𝑔 · (normℎ‘(𝑡 +ℎ ℎ)))))
44	39, 43	anim12d 609	. . . . . . . . . . 11 ⊢ ((𝑡 +ℎ ℎ) ∈ (𝐴 +ℋ 𝐵) → ((∀𝑢 ∈ (𝐴 +ℋ 𝐵)(normℎ‘(𝑆‘𝑢)) ≤ (𝑓 · (normℎ‘𝑢)) ∧ ∀𝑢 ∈ (𝐴 +ℋ 𝐵)(normℎ‘(𝑇‘𝑢)) ≤ (𝑔 · (normℎ‘𝑢))) → ((normℎ‘(𝑆‘(𝑡 +ℎ ℎ))) ≤ (𝑓 · (normℎ‘(𝑡 +ℎ ℎ))) ∧ (normℎ‘(𝑇‘(𝑡 +ℎ ℎ))) ≤ (𝑔 · (normℎ‘(𝑡 +ℎ ℎ))))))
45	34, 44	syl 17	. . . . . . . . . 10 ⊢ ((𝑡 ∈ 𝐴 ∧ ℎ ∈ 𝐵) → ((∀𝑢 ∈ (𝐴 +ℋ 𝐵)(normℎ‘(𝑆‘𝑢)) ≤ (𝑓 · (normℎ‘𝑢)) ∧ ∀𝑢 ∈ (𝐴 +ℋ 𝐵)(normℎ‘(𝑇‘𝑢)) ≤ (𝑔 · (normℎ‘𝑢))) → ((normℎ‘(𝑆‘(𝑡 +ℎ ℎ))) ≤ (𝑓 · (normℎ‘(𝑡 +ℎ ℎ))) ∧ (normℎ‘(𝑇‘(𝑡 +ℎ ℎ))) ≤ (𝑔 · (normℎ‘(𝑡 +ℎ ℎ))))))
46	45	adantl 481	. . . . . . . . 9 ⊢ ((((𝐴 ∩ 𝐵) = 0ℋ ∧ (𝑓 ∈ ℝ ∧ 𝑔 ∈ ℝ)) ∧ (𝑡 ∈ 𝐴 ∧ ℎ ∈ 𝐵)) → ((∀𝑢 ∈ (𝐴 +ℋ 𝐵)(normℎ‘(𝑆‘𝑢)) ≤ (𝑓 · (normℎ‘𝑢)) ∧ ∀𝑢 ∈ (𝐴 +ℋ 𝐵)(normℎ‘(𝑇‘𝑢)) ≤ (𝑔 · (normℎ‘𝑢))) → ((normℎ‘(𝑆‘(𝑡 +ℎ ℎ))) ≤ (𝑓 · (normℎ‘(𝑡 +ℎ ℎ))) ∧ (normℎ‘(𝑇‘(𝑡 +ℎ ℎ))) ≤ (𝑔 · (normℎ‘(𝑡 +ℎ ℎ))))))
47	1	sheli 31243	. . . . . . . . . . . . . . 15 ⊢ (𝑡 ∈ 𝐴 → 𝑡 ∈ ℋ)
48		normcl 31154	. . . . . . . . . . . . . . 15 ⊢ (𝑡 ∈ ℋ → (normℎ‘𝑡) ∈ ℝ)
49	47, 48	syl 17	. . . . . . . . . . . . . 14 ⊢ (𝑡 ∈ 𝐴 → (normℎ‘𝑡) ∈ ℝ)
50	2	sheli 31243	. . . . . . . . . . . . . . 15 ⊢ (ℎ ∈ 𝐵 → ℎ ∈ ℋ)
51		normcl 31154	. . . . . . . . . . . . . . 15 ⊢ (ℎ ∈ ℋ → (normℎ‘ℎ) ∈ ℝ)
52	50, 51	syl 17	. . . . . . . . . . . . . 14 ⊢ (ℎ ∈ 𝐵 → (normℎ‘ℎ) ∈ ℝ)
53	49, 52	anim12i 613	. . . . . . . . . . . . 13 ⊢ ((𝑡 ∈ 𝐴 ∧ ℎ ∈ 𝐵) → ((normℎ‘𝑡) ∈ ℝ ∧ (normℎ‘ℎ) ∈ ℝ))
54	53	adantl 481	. . . . . . . . . . . 12 ⊢ (((𝑓 ∈ ℝ ∧ 𝑔 ∈ ℝ) ∧ (𝑡 ∈ 𝐴 ∧ ℎ ∈ 𝐵)) → ((normℎ‘𝑡) ∈ ℝ ∧ (normℎ‘ℎ) ∈ ℝ))
55		hvaddcl 31041	. . . . . . . . . . . . . . . 16 ⊢ ((𝑡 ∈ ℋ ∧ ℎ ∈ ℋ) → (𝑡 +ℎ ℎ) ∈ ℋ)
56	47, 50, 55	syl2an 596	. . . . . . . . . . . . . . 15 ⊢ ((𝑡 ∈ 𝐴 ∧ ℎ ∈ 𝐵) → (𝑡 +ℎ ℎ) ∈ ℋ)
57		normcl 31154	. . . . . . . . . . . . . . 15 ⊢ ((𝑡 +ℎ ℎ) ∈ ℋ → (normℎ‘(𝑡 +ℎ ℎ)) ∈ ℝ)
58	56, 57	syl 17	. . . . . . . . . . . . . 14 ⊢ ((𝑡 ∈ 𝐴 ∧ ℎ ∈ 𝐵) → (normℎ‘(𝑡 +ℎ ℎ)) ∈ ℝ)
59		remulcl 11238	. . . . . . . . . . . . . 14 ⊢ ((𝑓 ∈ ℝ ∧ (normℎ‘(𝑡 +ℎ ℎ)) ∈ ℝ) → (𝑓 · (normℎ‘(𝑡 +ℎ ℎ))) ∈ ℝ)
60	58, 59	sylan2 593	. . . . . . . . . . . . 13 ⊢ ((𝑓 ∈ ℝ ∧ (𝑡 ∈ 𝐴 ∧ ℎ ∈ 𝐵)) → (𝑓 · (normℎ‘(𝑡 +ℎ ℎ))) ∈ ℝ)
61	60	adantlr 715	. . . . . . . . . . . 12 ⊢ (((𝑓 ∈ ℝ ∧ 𝑔 ∈ ℝ) ∧ (𝑡 ∈ 𝐴 ∧ ℎ ∈ 𝐵)) → (𝑓 · (normℎ‘(𝑡 +ℎ ℎ))) ∈ ℝ)
62		remulcl 11238	. . . . . . . . . . . . . 14 ⊢ ((𝑔 ∈ ℝ ∧ (normℎ‘(𝑡 +ℎ ℎ)) ∈ ℝ) → (𝑔 · (normℎ‘(𝑡 +ℎ ℎ))) ∈ ℝ)
63	58, 62	sylan2 593	. . . . . . . . . . . . 13 ⊢ ((𝑔 ∈ ℝ ∧ (𝑡 ∈ 𝐴 ∧ ℎ ∈ 𝐵)) → (𝑔 · (normℎ‘(𝑡 +ℎ ℎ))) ∈ ℝ)
64	63	adantll 714	. . . . . . . . . . . 12 ⊢ (((𝑓 ∈ ℝ ∧ 𝑔 ∈ ℝ) ∧ (𝑡 ∈ 𝐴 ∧ ℎ ∈ 𝐵)) → (𝑔 · (normℎ‘(𝑡 +ℎ ℎ))) ∈ ℝ)
65		le2add 11743	. . . . . . . . . . . 12 ⊢ ((((normℎ‘𝑡) ∈ ℝ ∧ (normℎ‘ℎ) ∈ ℝ) ∧ ((𝑓 · (normℎ‘(𝑡 +ℎ ℎ))) ∈ ℝ ∧ (𝑔 · (normℎ‘(𝑡 +ℎ ℎ))) ∈ ℝ)) → (((normℎ‘𝑡) ≤ (𝑓 · (normℎ‘(𝑡 +ℎ ℎ))) ∧ (normℎ‘ℎ) ≤ (𝑔 · (normℎ‘(𝑡 +ℎ ℎ)))) → ((normℎ‘𝑡) + (normℎ‘ℎ)) ≤ ((𝑓 · (normℎ‘(𝑡 +ℎ ℎ))) + (𝑔 · (normℎ‘(𝑡 +ℎ ℎ))))))
66	54, 61, 64, 65	syl12anc 837	. . . . . . . . . . 11 ⊢ (((𝑓 ∈ ℝ ∧ 𝑔 ∈ ℝ) ∧ (𝑡 ∈ 𝐴 ∧ ℎ ∈ 𝐵)) → (((normℎ‘𝑡) ≤ (𝑓 · (normℎ‘(𝑡 +ℎ ℎ))) ∧ (normℎ‘ℎ) ≤ (𝑔 · (normℎ‘(𝑡 +ℎ ℎ)))) → ((normℎ‘𝑡) + (normℎ‘ℎ)) ≤ ((𝑓 · (normℎ‘(𝑡 +ℎ ℎ))) + (𝑔 · (normℎ‘(𝑡 +ℎ ℎ))))))
67	66	adantll 714	. . . . . . . . . 10 ⊢ ((((𝐴 ∩ 𝐵) = 0ℋ ∧ (𝑓 ∈ ℝ ∧ 𝑔 ∈ ℝ)) ∧ (𝑡 ∈ 𝐴 ∧ ℎ ∈ 𝐵)) → (((normℎ‘𝑡) ≤ (𝑓 · (normℎ‘(𝑡 +ℎ ℎ))) ∧ (normℎ‘ℎ) ≤ (𝑔 · (normℎ‘(𝑡 +ℎ ℎ)))) → ((normℎ‘𝑡) + (normℎ‘ℎ)) ≤ ((𝑓 · (normℎ‘(𝑡 +ℎ ℎ))) + (𝑔 · (normℎ‘(𝑡 +ℎ ℎ))))))
68	1, 2, 4	cdj3lem2 32464	. . . . . . . . . . . . . . . 16 ⊢ ((𝑡 ∈ 𝐴 ∧ ℎ ∈ 𝐵 ∧ (𝐴 ∩ 𝐵) = 0ℋ) → (𝑆‘(𝑡 +ℎ ℎ)) = 𝑡)
69	68	fveq2d 6911	. . . . . . . . . . . . . . 15 ⊢ ((𝑡 ∈ 𝐴 ∧ ℎ ∈ 𝐵 ∧ (𝐴 ∩ 𝐵) = 0ℋ) → (normℎ‘(𝑆‘(𝑡 +ℎ ℎ))) = (normℎ‘𝑡))
70	69	breq1d 5158	. . . . . . . . . . . . . 14 ⊢ ((𝑡 ∈ 𝐴 ∧ ℎ ∈ 𝐵 ∧ (𝐴 ∩ 𝐵) = 0ℋ) → ((normℎ‘(𝑆‘(𝑡 +ℎ ℎ))) ≤ (𝑓 · (normℎ‘(𝑡 +ℎ ℎ))) ↔ (normℎ‘𝑡) ≤ (𝑓 · (normℎ‘(𝑡 +ℎ ℎ)))))
71	1, 2, 8	cdj3lem3 32467	. . . . . . . . . . . . . . . 16 ⊢ ((𝑡 ∈ 𝐴 ∧ ℎ ∈ 𝐵 ∧ (𝐴 ∩ 𝐵) = 0ℋ) → (𝑇‘(𝑡 +ℎ ℎ)) = ℎ)
72	71	fveq2d 6911	. . . . . . . . . . . . . . 15 ⊢ ((𝑡 ∈ 𝐴 ∧ ℎ ∈ 𝐵 ∧ (𝐴 ∩ 𝐵) = 0ℋ) → (normℎ‘(𝑇‘(𝑡 +ℎ ℎ))) = (normℎ‘ℎ))
73	72	breq1d 5158	. . . . . . . . . . . . . 14 ⊢ ((𝑡 ∈ 𝐴 ∧ ℎ ∈ 𝐵 ∧ (𝐴 ∩ 𝐵) = 0ℋ) → ((normℎ‘(𝑇‘(𝑡 +ℎ ℎ))) ≤ (𝑔 · (normℎ‘(𝑡 +ℎ ℎ))) ↔ (normℎ‘ℎ) ≤ (𝑔 · (normℎ‘(𝑡 +ℎ ℎ)))))
74	70, 73	anbi12d 632	. . . . . . . . . . . . 13 ⊢ ((𝑡 ∈ 𝐴 ∧ ℎ ∈ 𝐵 ∧ (𝐴 ∩ 𝐵) = 0ℋ) → (((normℎ‘(𝑆‘(𝑡 +ℎ ℎ))) ≤ (𝑓 · (normℎ‘(𝑡 +ℎ ℎ))) ∧ (normℎ‘(𝑇‘(𝑡 +ℎ ℎ))) ≤ (𝑔 · (normℎ‘(𝑡 +ℎ ℎ)))) ↔ ((normℎ‘𝑡) ≤ (𝑓 · (normℎ‘(𝑡 +ℎ ℎ))) ∧ (normℎ‘ℎ) ≤ (𝑔 · (normℎ‘(𝑡 +ℎ ℎ))))))
75	74	3expa 1117	. . . . . . . . . . . 12 ⊢ (((𝑡 ∈ 𝐴 ∧ ℎ ∈ 𝐵) ∧ (𝐴 ∩ 𝐵) = 0ℋ) → (((normℎ‘(𝑆‘(𝑡 +ℎ ℎ))) ≤ (𝑓 · (normℎ‘(𝑡 +ℎ ℎ))) ∧ (normℎ‘(𝑇‘(𝑡 +ℎ ℎ))) ≤ (𝑔 · (normℎ‘(𝑡 +ℎ ℎ)))) ↔ ((normℎ‘𝑡) ≤ (𝑓 · (normℎ‘(𝑡 +ℎ ℎ))) ∧ (normℎ‘ℎ) ≤ (𝑔 · (normℎ‘(𝑡 +ℎ ℎ))))))
76	75	ancoms 458	. . . . . . . . . . 11 ⊢ (((𝐴 ∩ 𝐵) = 0ℋ ∧ (𝑡 ∈ 𝐴 ∧ ℎ ∈ 𝐵)) → (((normℎ‘(𝑆‘(𝑡 +ℎ ℎ))) ≤ (𝑓 · (normℎ‘(𝑡 +ℎ ℎ))) ∧ (normℎ‘(𝑇‘(𝑡 +ℎ ℎ))) ≤ (𝑔 · (normℎ‘(𝑡 +ℎ ℎ)))) ↔ ((normℎ‘𝑡) ≤ (𝑓 · (normℎ‘(𝑡 +ℎ ℎ))) ∧ (normℎ‘ℎ) ≤ (𝑔 · (normℎ‘(𝑡 +ℎ ℎ))))))
77	76	adantlr 715	. . . . . . . . . 10 ⊢ ((((𝐴 ∩ 𝐵) = 0ℋ ∧ (𝑓 ∈ ℝ ∧ 𝑔 ∈ ℝ)) ∧ (𝑡 ∈ 𝐴 ∧ ℎ ∈ 𝐵)) → (((normℎ‘(𝑆‘(𝑡 +ℎ ℎ))) ≤ (𝑓 · (normℎ‘(𝑡 +ℎ ℎ))) ∧ (normℎ‘(𝑇‘(𝑡 +ℎ ℎ))) ≤ (𝑔 · (normℎ‘(𝑡 +ℎ ℎ)))) ↔ ((normℎ‘𝑡) ≤ (𝑓 · (normℎ‘(𝑡 +ℎ ℎ))) ∧ (normℎ‘ℎ) ≤ (𝑔 · (normℎ‘(𝑡 +ℎ ℎ))))))
78		recn 11243	. . . . . . . . . . . . . 14 ⊢ (𝑓 ∈ ℝ → 𝑓 ∈ ℂ)
79		recn 11243	. . . . . . . . . . . . . 14 ⊢ (𝑔 ∈ ℝ → 𝑔 ∈ ℂ)
80	58	recnd 11287	. . . . . . . . . . . . . 14 ⊢ ((𝑡 ∈ 𝐴 ∧ ℎ ∈ 𝐵) → (normℎ‘(𝑡 +ℎ ℎ)) ∈ ℂ)
81		adddir 11250	. . . . . . . . . . . . . 14 ⊢ ((𝑓 ∈ ℂ ∧ 𝑔 ∈ ℂ ∧ (normℎ‘(𝑡 +ℎ ℎ)) ∈ ℂ) → ((𝑓 + 𝑔) · (normℎ‘(𝑡 +ℎ ℎ))) = ((𝑓 · (normℎ‘(𝑡 +ℎ ℎ))) + (𝑔 · (normℎ‘(𝑡 +ℎ ℎ)))))
82	78, 79, 80, 81	syl3an 1159	. . . . . . . . . . . . 13 ⊢ ((𝑓 ∈ ℝ ∧ 𝑔 ∈ ℝ ∧ (𝑡 ∈ 𝐴 ∧ ℎ ∈ 𝐵)) → ((𝑓 + 𝑔) · (normℎ‘(𝑡 +ℎ ℎ))) = ((𝑓 · (normℎ‘(𝑡 +ℎ ℎ))) + (𝑔 · (normℎ‘(𝑡 +ℎ ℎ)))))
83	82	3expa 1117	. . . . . . . . . . . 12 ⊢ (((𝑓 ∈ ℝ ∧ 𝑔 ∈ ℝ) ∧ (𝑡 ∈ 𝐴 ∧ ℎ ∈ 𝐵)) → ((𝑓 + 𝑔) · (normℎ‘(𝑡 +ℎ ℎ))) = ((𝑓 · (normℎ‘(𝑡 +ℎ ℎ))) + (𝑔 · (normℎ‘(𝑡 +ℎ ℎ)))))
84	83	breq2d 5160	. . . . . . . . . . 11 ⊢ (((𝑓 ∈ ℝ ∧ 𝑔 ∈ ℝ) ∧ (𝑡 ∈ 𝐴 ∧ ℎ ∈ 𝐵)) → (((normℎ‘𝑡) + (normℎ‘ℎ)) ≤ ((𝑓 + 𝑔) · (normℎ‘(𝑡 +ℎ ℎ))) ↔ ((normℎ‘𝑡) + (normℎ‘ℎ)) ≤ ((𝑓 · (normℎ‘(𝑡 +ℎ ℎ))) + (𝑔 · (normℎ‘(𝑡 +ℎ ℎ))))))
85	84	adantll 714	. . . . . . . . . 10 ⊢ ((((𝐴 ∩ 𝐵) = 0ℋ ∧ (𝑓 ∈ ℝ ∧ 𝑔 ∈ ℝ)) ∧ (𝑡 ∈ 𝐴 ∧ ℎ ∈ 𝐵)) → (((normℎ‘𝑡) + (normℎ‘ℎ)) ≤ ((𝑓 + 𝑔) · (normℎ‘(𝑡 +ℎ ℎ))) ↔ ((normℎ‘𝑡) + (normℎ‘ℎ)) ≤ ((𝑓 · (normℎ‘(𝑡 +ℎ ℎ))) + (𝑔 · (normℎ‘(𝑡 +ℎ ℎ))))))
86	67, 77, 85	3imtr4d 294	. . . . . . . . 9 ⊢ ((((𝐴 ∩ 𝐵) = 0ℋ ∧ (𝑓 ∈ ℝ ∧ 𝑔 ∈ ℝ)) ∧ (𝑡 ∈ 𝐴 ∧ ℎ ∈ 𝐵)) → (((normℎ‘(𝑆‘(𝑡 +ℎ ℎ))) ≤ (𝑓 · (normℎ‘(𝑡 +ℎ ℎ))) ∧ (normℎ‘(𝑇‘(𝑡 +ℎ ℎ))) ≤ (𝑔 · (normℎ‘(𝑡 +ℎ ℎ)))) → ((normℎ‘𝑡) + (normℎ‘ℎ)) ≤ ((𝑓 + 𝑔) · (normℎ‘(𝑡 +ℎ ℎ)))))
87	46, 86	syld 47	. . . . . . . 8 ⊢ ((((𝐴 ∩ 𝐵) = 0ℋ ∧ (𝑓 ∈ ℝ ∧ 𝑔 ∈ ℝ)) ∧ (𝑡 ∈ 𝐴 ∧ ℎ ∈ 𝐵)) → ((∀𝑢 ∈ (𝐴 +ℋ 𝐵)(normℎ‘(𝑆‘𝑢)) ≤ (𝑓 · (normℎ‘𝑢)) ∧ ∀𝑢 ∈ (𝐴 +ℋ 𝐵)(normℎ‘(𝑇‘𝑢)) ≤ (𝑔 · (normℎ‘𝑢))) → ((normℎ‘𝑡) + (normℎ‘ℎ)) ≤ ((𝑓 + 𝑔) · (normℎ‘(𝑡 +ℎ ℎ)))))
88	87	ralrimdvva 3209	. . . . . . 7 ⊢ (((𝐴 ∩ 𝐵) = 0ℋ ∧ (𝑓 ∈ ℝ ∧ 𝑔 ∈ ℝ)) → ((∀𝑢 ∈ (𝐴 +ℋ 𝐵)(normℎ‘(𝑆‘𝑢)) ≤ (𝑓 · (normℎ‘𝑢)) ∧ ∀𝑢 ∈ (𝐴 +ℋ 𝐵)(normℎ‘(𝑇‘𝑢)) ≤ (𝑔 · (normℎ‘𝑢))) → ∀𝑡 ∈ 𝐴 ∀ℎ ∈ 𝐵 ((normℎ‘𝑡) + (normℎ‘ℎ)) ≤ ((𝑓 + 𝑔) · (normℎ‘(𝑡 +ℎ ℎ)))))
89		readdcl 11236	. . . . . . . . 9 ⊢ ((𝑓 ∈ ℝ ∧ 𝑔 ∈ ℝ) → (𝑓 + 𝑔) ∈ ℝ)
90		breq2 5152	. . . . . . . . . . . 12 ⊢ (𝑣 = (𝑓 + 𝑔) → (0 < 𝑣 ↔ 0 < (𝑓 + 𝑔)))
91		fveq2 6907	. . . . . . . . . . . . . . . 16 ⊢ (𝑥 = 𝑡 → (normℎ‘𝑥) = (normℎ‘𝑡))
92	91	oveq1d 7446	. . . . . . . . . . . . . . 15 ⊢ (𝑥 = 𝑡 → ((normℎ‘𝑥) + (normℎ‘𝑦)) = ((normℎ‘𝑡) + (normℎ‘𝑦)))
93		fvoveq1 7454	. . . . . . . . . . . . . . . 16 ⊢ (𝑥 = 𝑡 → (normℎ‘(𝑥 +ℎ 𝑦)) = (normℎ‘(𝑡 +ℎ 𝑦)))
94	93	oveq2d 7447	. . . . . . . . . . . . . . 15 ⊢ (𝑥 = 𝑡 → (𝑣 · (normℎ‘(𝑥 +ℎ 𝑦))) = (𝑣 · (normℎ‘(𝑡 +ℎ 𝑦))))
95	92, 94	breq12d 5161	. . . . . . . . . . . . . 14 ⊢ (𝑥 = 𝑡 → (((normℎ‘𝑥) + (normℎ‘𝑦)) ≤ (𝑣 · (normℎ‘(𝑥 +ℎ 𝑦))) ↔ ((normℎ‘𝑡) + (normℎ‘𝑦)) ≤ (𝑣 · (normℎ‘(𝑡 +ℎ 𝑦)))))
96		fveq2 6907	. . . . . . . . . . . . . . . 16 ⊢ (𝑦 = ℎ → (normℎ‘𝑦) = (normℎ‘ℎ))
97	96	oveq2d 7447	. . . . . . . . . . . . . . 15 ⊢ (𝑦 = ℎ → ((normℎ‘𝑡) + (normℎ‘𝑦)) = ((normℎ‘𝑡) + (normℎ‘ℎ)))
98		oveq2 7439	. . . . . . . . . . . . . . . . 17 ⊢ (𝑦 = ℎ → (𝑡 +ℎ 𝑦) = (𝑡 +ℎ ℎ))
99	98	fveq2d 6911	. . . . . . . . . . . . . . . 16 ⊢ (𝑦 = ℎ → (normℎ‘(𝑡 +ℎ 𝑦)) = (normℎ‘(𝑡 +ℎ ℎ)))
100	99	oveq2d 7447	. . . . . . . . . . . . . . 15 ⊢ (𝑦 = ℎ → (𝑣 · (normℎ‘(𝑡 +ℎ 𝑦))) = (𝑣 · (normℎ‘(𝑡 +ℎ ℎ))))
101	97, 100	breq12d 5161	. . . . . . . . . . . . . 14 ⊢ (𝑦 = ℎ → (((normℎ‘𝑡) + (normℎ‘𝑦)) ≤ (𝑣 · (normℎ‘(𝑡 +ℎ 𝑦))) ↔ ((normℎ‘𝑡) + (normℎ‘ℎ)) ≤ (𝑣 · (normℎ‘(𝑡 +ℎ ℎ)))))
102	95, 101	cbvral2vw 3239	. . . . . . . . . . . . 13 ⊢ (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 ((normℎ‘𝑥) + (normℎ‘𝑦)) ≤ (𝑣 · (normℎ‘(𝑥 +ℎ 𝑦))) ↔ ∀𝑡 ∈ 𝐴 ∀ℎ ∈ 𝐵 ((normℎ‘𝑡) + (normℎ‘ℎ)) ≤ (𝑣 · (normℎ‘(𝑡 +ℎ ℎ))))
103		oveq1 7438	. . . . . . . . . . . . . . 15 ⊢ (𝑣 = (𝑓 + 𝑔) → (𝑣 · (normℎ‘(𝑡 +ℎ ℎ))) = ((𝑓 + 𝑔) · (normℎ‘(𝑡 +ℎ ℎ))))
104	103	breq2d 5160	. . . . . . . . . . . . . 14 ⊢ (𝑣 = (𝑓 + 𝑔) → (((normℎ‘𝑡) + (normℎ‘ℎ)) ≤ (𝑣 · (normℎ‘(𝑡 +ℎ ℎ))) ↔ ((normℎ‘𝑡) + (normℎ‘ℎ)) ≤ ((𝑓 + 𝑔) · (normℎ‘(𝑡 +ℎ ℎ)))))
105	104	2ralbidv 3219	. . . . . . . . . . . . 13 ⊢ (𝑣 = (𝑓 + 𝑔) → (∀𝑡 ∈ 𝐴 ∀ℎ ∈ 𝐵 ((normℎ‘𝑡) + (normℎ‘ℎ)) ≤ (𝑣 · (normℎ‘(𝑡 +ℎ ℎ))) ↔ ∀𝑡 ∈ 𝐴 ∀ℎ ∈ 𝐵 ((normℎ‘𝑡) + (normℎ‘ℎ)) ≤ ((𝑓 + 𝑔) · (normℎ‘(𝑡 +ℎ ℎ)))))
106	102, 105	bitrid 283	. . . . . . . . . . . 12 ⊢ (𝑣 = (𝑓 + 𝑔) → (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 ((normℎ‘𝑥) + (normℎ‘𝑦)) ≤ (𝑣 · (normℎ‘(𝑥 +ℎ 𝑦))) ↔ ∀𝑡 ∈ 𝐴 ∀ℎ ∈ 𝐵 ((normℎ‘𝑡) + (normℎ‘ℎ)) ≤ ((𝑓 + 𝑔) · (normℎ‘(𝑡 +ℎ ℎ)))))
107	90, 106	anbi12d 632	. . . . . . . . . . 11 ⊢ (𝑣 = (𝑓 + 𝑔) → ((0 < 𝑣 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 ((normℎ‘𝑥) + (normℎ‘𝑦)) ≤ (𝑣 · (normℎ‘(𝑥 +ℎ 𝑦)))) ↔ (0 < (𝑓 + 𝑔) ∧ ∀𝑡 ∈ 𝐴 ∀ℎ ∈ 𝐵 ((normℎ‘𝑡) + (normℎ‘ℎ)) ≤ ((𝑓 + 𝑔) · (normℎ‘(𝑡 +ℎ ℎ))))))
108	107	rspcev 3622	. . . . . . . . . 10 ⊢ (((𝑓 + 𝑔) ∈ ℝ ∧ (0 < (𝑓 + 𝑔) ∧ ∀𝑡 ∈ 𝐴 ∀ℎ ∈ 𝐵 ((normℎ‘𝑡) + (normℎ‘ℎ)) ≤ ((𝑓 + 𝑔) · (normℎ‘(𝑡 +ℎ ℎ))))) → ∃𝑣 ∈ ℝ (0 < 𝑣 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 ((normℎ‘𝑥) + (normℎ‘𝑦)) ≤ (𝑣 · (normℎ‘(𝑥 +ℎ 𝑦)))))
109	108	ex 412	. . . . . . . . 9 ⊢ ((𝑓 + 𝑔) ∈ ℝ → ((0 < (𝑓 + 𝑔) ∧ ∀𝑡 ∈ 𝐴 ∀ℎ ∈ 𝐵 ((normℎ‘𝑡) + (normℎ‘ℎ)) ≤ ((𝑓 + 𝑔) · (normℎ‘(𝑡 +ℎ ℎ)))) → ∃𝑣 ∈ ℝ (0 < 𝑣 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 ((normℎ‘𝑥) + (normℎ‘𝑦)) ≤ (𝑣 · (normℎ‘(𝑥 +ℎ 𝑦))))))
110	89, 109	syl 17	. . . . . . . 8 ⊢ ((𝑓 ∈ ℝ ∧ 𝑔 ∈ ℝ) → ((0 < (𝑓 + 𝑔) ∧ ∀𝑡 ∈ 𝐴 ∀ℎ ∈ 𝐵 ((normℎ‘𝑡) + (normℎ‘ℎ)) ≤ ((𝑓 + 𝑔) · (normℎ‘(𝑡 +ℎ ℎ)))) → ∃𝑣 ∈ ℝ (0 < 𝑣 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 ((normℎ‘𝑥) + (normℎ‘𝑦)) ≤ (𝑣 · (normℎ‘(𝑥 +ℎ 𝑦))))))
111	110	adantl 481	. . . . . . 7 ⊢ (((𝐴 ∩ 𝐵) = 0ℋ ∧ (𝑓 ∈ ℝ ∧ 𝑔 ∈ ℝ)) → ((0 < (𝑓 + 𝑔) ∧ ∀𝑡 ∈ 𝐴 ∀ℎ ∈ 𝐵 ((normℎ‘𝑡) + (normℎ‘ℎ)) ≤ ((𝑓 + 𝑔) · (normℎ‘(𝑡 +ℎ ℎ)))) → ∃𝑣 ∈ ℝ (0 < 𝑣 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 ((normℎ‘𝑥) + (normℎ‘𝑦)) ≤ (𝑣 · (normℎ‘(𝑥 +ℎ 𝑦))))))
112	33, 88, 111	syl2and 608	. . . . . 6 ⊢ (((𝐴 ∩ 𝐵) = 0ℋ ∧ (𝑓 ∈ ℝ ∧ 𝑔 ∈ ℝ)) → (((0 < 𝑓 ∧ 0 < 𝑔) ∧ (∀𝑢 ∈ (𝐴 +ℋ 𝐵)(normℎ‘(𝑆‘𝑢)) ≤ (𝑓 · (normℎ‘𝑢)) ∧ ∀𝑢 ∈ (𝐴 +ℋ 𝐵)(normℎ‘(𝑇‘𝑢)) ≤ (𝑔 · (normℎ‘𝑢)))) → ∃𝑣 ∈ ℝ (0 < 𝑣 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 ((normℎ‘𝑥) + (normℎ‘𝑦)) ≤ (𝑣 · (normℎ‘(𝑥 +ℎ 𝑦))))))
113	30, 112	biimtrid 242	. . . . 5 ⊢ (((𝐴 ∩ 𝐵) = 0ℋ ∧ (𝑓 ∈ ℝ ∧ 𝑔 ∈ ℝ)) → (((0 < 𝑓 ∧ ∀𝑢 ∈ (𝐴 +ℋ 𝐵)(normℎ‘(𝑆‘𝑢)) ≤ (𝑓 · (normℎ‘𝑢))) ∧ (0 < 𝑔 ∧ ∀𝑢 ∈ (𝐴 +ℋ 𝐵)(normℎ‘(𝑇‘𝑢)) ≤ (𝑔 · (normℎ‘𝑢)))) → ∃𝑣 ∈ ℝ (0 < 𝑣 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 ((normℎ‘𝑥) + (normℎ‘𝑦)) ≤ (𝑣 · (normℎ‘(𝑥 +ℎ 𝑦))))))
114	113	rexlimdvva 3211	. . . 4 ⊢ ((𝐴 ∩ 𝐵) = 0ℋ → (∃𝑓 ∈ ℝ ∃𝑔 ∈ ℝ ((0 < 𝑓 ∧ ∀𝑢 ∈ (𝐴 +ℋ 𝐵)(normℎ‘(𝑆‘𝑢)) ≤ (𝑓 · (normℎ‘𝑢))) ∧ (0 < 𝑔 ∧ ∀𝑢 ∈ (𝐴 +ℋ 𝐵)(normℎ‘(𝑇‘𝑢)) ≤ (𝑔 · (normℎ‘𝑢)))) → ∃𝑣 ∈ ℝ (0 < 𝑣 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 ((normℎ‘𝑥) + (normℎ‘𝑦)) ≤ (𝑣 · (normℎ‘(𝑥 +ℎ 𝑦))))))
115	29, 114	biimtrid 242	. . 3 ⊢ ((𝐴 ∩ 𝐵) = 0ℋ → ((𝜑 ∧ 𝜓) → ∃𝑣 ∈ ℝ (0 < 𝑣 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 ((normℎ‘𝑥) + (normℎ‘𝑦)) ≤ (𝑣 · (normℎ‘(𝑥 +ℎ 𝑦))))))
116	115	3impib 1115	. 2 ⊢ (((𝐴 ∩ 𝐵) = 0ℋ ∧ 𝜑 ∧ 𝜓) → ∃𝑣 ∈ ℝ (0 < 𝑣 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 ((normℎ‘𝑥) + (normℎ‘𝑦)) ≤ (𝑣 · (normℎ‘(𝑥 +ℎ 𝑦)))))
117	12, 116	impbii 209	1 ⊢ (∃𝑣 ∈ ℝ (0 < 𝑣 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 ((normℎ‘𝑥) + (normℎ‘𝑦)) ≤ (𝑣 · (normℎ‘(𝑥 +ℎ 𝑦)))) ↔ ((𝐴 ∩ 𝐵) = 0ℋ ∧ 𝜑 ∧ 𝜓))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   ∧ w3a 1086   = wceq 1537   ∈ wcel 2106  ∀wral 3059  ∃wrex 3068   ∩ cin 3962   class class class wbr 5148   ↦ cmpt 5231  ‘cfv 6563  ℩crio 7387  (class class class)co 7431  ℂcc 11151  ℝcr 11152  0cc0 11153   + caddc 11156   · cmul 11158   < clt 11293   ≤ cle 11294   ℋchba 30948   +_ℎ cva 30949  norm_ℎcno 30952   S_ℋ csh 30957   +_ℋ cph 30960  0_ℋc0h 30964

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1908  ax-6 1965  ax-7 2005  ax-8 2108  ax-9 2116  ax-10 2139  ax-11 2155  ax-12 2175  ax-ext 2706  ax-rep 5285  ax-sep 5302  ax-nul 5312  ax-pow 5371  ax-pr 5438  ax-un 7754  ax-cnex 11209  ax-resscn 11210  ax-1cn 11211  ax-icn 11212  ax-addcl 11213  ax-addrcl 11214  ax-mulcl 11215  ax-mulrcl 11216  ax-mulcom 11217  ax-addass 11218  ax-mulass 11219  ax-distr 11220  ax-i2m1 11221  ax-1ne0 11222  ax-1rid 11223  ax-rnegex 11224  ax-rrecex 11225  ax-cnre 11226  ax-pre-lttri 11227  ax-pre-lttrn 11228  ax-pre-ltadd 11229  ax-pre-mulgt0 11230  ax-pre-sup 11231  ax-hilex 31028  ax-hfvadd 31029  ax-hvcom 31030  ax-hvass 31031  ax-hv0cl 31032  ax-hvaddid 31033  ax-hfvmul 31034  ax-hvmulid 31035  ax-hvmulass 31036  ax-hvdistr1 31037  ax-hvdistr2 31038  ax-hvmul0 31039  ax-hfi 31108  ax-his1 31111  ax-his3 31113  ax-his4 31114

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1540  df-fal 1550  df-ex 1777  df-nf 1781  df-sb 2063  df-mo 2538  df-eu 2567  df-clab 2713  df-cleq 2727  df-clel 2814  df-nfc 2890  df-ne 2939  df-nel 3045  df-ral 3060  df-rex 3069  df-rmo 3378  df-reu 3379  df-rab 3434  df-v 3480  df-sbc 3792  df-csb 3909  df-dif 3966  df-un 3968  df-in 3970  df-ss 3980  df-pss 3983  df-nul 4340  df-if 4532  df-pw 4607  df-sn 4632  df-pr 4634  df-op 4638  df-uni 4913  df-int 4952  df-iun 4998  df-br 5149  df-opab 5211  df-mpt 5232  df-tr 5266  df-id 5583  df-eprel 5589  df-po 5597  df-so 5598  df-fr 5641  df-we 5643  df-xp 5695  df-rel 5696  df-cnv 5697  df-co 5698  df-dm 5699  df-rn 5700  df-res 5701  df-ima 5702  df-pred 6323  df-ord 6389  df-on 6390  df-lim 6391  df-suc 6392  df-iota 6516  df-fun 6565  df-fn 6566  df-f 6567  df-f1 6568  df-fo 6569  df-f1o 6570  df-fv 6571  df-riota 7388  df-ov 7434  df-oprab 7435  df-mpo 7436  df-om 7888  df-2nd 8014  df-frecs 8305  df-wrecs 8336  df-recs 8410  df-rdg 8449  df-er 8744  df-en 8985  df-dom 8986  df-sdom 8987  df-sup 9480  df-pnf 11295  df-mnf 11296  df-xr 11297  df-ltxr 11298  df-le 11299  df-sub 11492  df-neg 11493  df-div 11919  df-nn 12265  df-2 12327  df-3 12328  df-n0 12525  df-z 12612  df-uz 12877  df-rp 13033  df-seq 14040  df-exp 14100  df-cj 15135  df-re 15136  df-im 15137  df-sqrt 15271  df-abs 15272  df-grpo 30522  df-ablo 30574  df-hnorm 30997  df-hvsub 31000  df-sh 31236  df-ch0 31282  df-shs 31337

This theorem is referenced by: (None)