Theorem rexanre 15292

Description: Combine two different upper real properties into one. (Contributed by Mario Carneiro, 8-May-2016.)

Assertion

Ref	Expression
rexanre	⊢ (𝐴 ⊆ ℝ → (∃𝑗 ∈ ℝ ∀𝑘 ∈ 𝐴 (𝑗 ≤ 𝑘 → (𝜑 ∧ 𝜓)) ↔ (∃𝑗 ∈ ℝ ∀𝑘 ∈ 𝐴 (𝑗 ≤ 𝑘 → 𝜑) ∧ ∃𝑗 ∈ ℝ ∀𝑘 ∈ 𝐴 (𝑗 ≤ 𝑘 → 𝜓))))

Distinct variable groups:   𝑗,𝑘,𝐴   𝜑,𝑗   𝜓,𝑗

Allowed substitution hints:   𝜑(𝑘)   𝜓(𝑘)

Proof of Theorem rexanre

Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		simpl 483	. . . . . 6 ⊢ ((𝜑 ∧ 𝜓) → 𝜑)
2	1	imim2i 16	. . . . 5 ⊢ ((𝑗 ≤ 𝑘 → (𝜑 ∧ 𝜓)) → (𝑗 ≤ 𝑘 → 𝜑))
3	2	ralimi 3083	. . . 4 ⊢ (∀𝑘 ∈ 𝐴 (𝑗 ≤ 𝑘 → (𝜑 ∧ 𝜓)) → ∀𝑘 ∈ 𝐴 (𝑗 ≤ 𝑘 → 𝜑))
4	3	reximi 3084	. . 3 ⊢ (∃𝑗 ∈ ℝ ∀𝑘 ∈ 𝐴 (𝑗 ≤ 𝑘 → (𝜑 ∧ 𝜓)) → ∃𝑗 ∈ ℝ ∀𝑘 ∈ 𝐴 (𝑗 ≤ 𝑘 → 𝜑))
5		simpr 485	. . . . . 6 ⊢ ((𝜑 ∧ 𝜓) → 𝜓)
6	5	imim2i 16	. . . . 5 ⊢ ((𝑗 ≤ 𝑘 → (𝜑 ∧ 𝜓)) → (𝑗 ≤ 𝑘 → 𝜓))
7	6	ralimi 3083	. . . 4 ⊢ (∀𝑘 ∈ 𝐴 (𝑗 ≤ 𝑘 → (𝜑 ∧ 𝜓)) → ∀𝑘 ∈ 𝐴 (𝑗 ≤ 𝑘 → 𝜓))
8	7	reximi 3084	. . 3 ⊢ (∃𝑗 ∈ ℝ ∀𝑘 ∈ 𝐴 (𝑗 ≤ 𝑘 → (𝜑 ∧ 𝜓)) → ∃𝑗 ∈ ℝ ∀𝑘 ∈ 𝐴 (𝑗 ≤ 𝑘 → 𝜓))
9	4, 8	jca 512	. 2 ⊢ (∃𝑗 ∈ ℝ ∀𝑘 ∈ 𝐴 (𝑗 ≤ 𝑘 → (𝜑 ∧ 𝜓)) → (∃𝑗 ∈ ℝ ∀𝑘 ∈ 𝐴 (𝑗 ≤ 𝑘 → 𝜑) ∧ ∃𝑗 ∈ ℝ ∀𝑘 ∈ 𝐴 (𝑗 ≤ 𝑘 → 𝜓)))
10		breq1 5151	. . . . . . . 8 ⊢ (𝑗 = 𝑥 → (𝑗 ≤ 𝑘 ↔ 𝑥 ≤ 𝑘))
11	10	imbi1d 341	. . . . . . 7 ⊢ (𝑗 = 𝑥 → ((𝑗 ≤ 𝑘 → 𝜑) ↔ (𝑥 ≤ 𝑘 → 𝜑)))
12	11	ralbidv 3177	. . . . . 6 ⊢ (𝑗 = 𝑥 → (∀𝑘 ∈ 𝐴 (𝑗 ≤ 𝑘 → 𝜑) ↔ ∀𝑘 ∈ 𝐴 (𝑥 ≤ 𝑘 → 𝜑)))
13	12	cbvrexvw 3235	. . . . 5 ⊢ (∃𝑗 ∈ ℝ ∀𝑘 ∈ 𝐴 (𝑗 ≤ 𝑘 → 𝜑) ↔ ∃𝑥 ∈ ℝ ∀𝑘 ∈ 𝐴 (𝑥 ≤ 𝑘 → 𝜑))
14		breq1 5151	. . . . . . . 8 ⊢ (𝑗 = 𝑦 → (𝑗 ≤ 𝑘 ↔ 𝑦 ≤ 𝑘))
15	14	imbi1d 341	. . . . . . 7 ⊢ (𝑗 = 𝑦 → ((𝑗 ≤ 𝑘 → 𝜓) ↔ (𝑦 ≤ 𝑘 → 𝜓)))
16	15	ralbidv 3177	. . . . . 6 ⊢ (𝑗 = 𝑦 → (∀𝑘 ∈ 𝐴 (𝑗 ≤ 𝑘 → 𝜓) ↔ ∀𝑘 ∈ 𝐴 (𝑦 ≤ 𝑘 → 𝜓)))
17	16	cbvrexvw 3235	. . . . 5 ⊢ (∃𝑗 ∈ ℝ ∀𝑘 ∈ 𝐴 (𝑗 ≤ 𝑘 → 𝜓) ↔ ∃𝑦 ∈ ℝ ∀𝑘 ∈ 𝐴 (𝑦 ≤ 𝑘 → 𝜓))
18	13, 17	anbi12i 627	. . . 4 ⊢ ((∃𝑗 ∈ ℝ ∀𝑘 ∈ 𝐴 (𝑗 ≤ 𝑘 → 𝜑) ∧ ∃𝑗 ∈ ℝ ∀𝑘 ∈ 𝐴 (𝑗 ≤ 𝑘 → 𝜓)) ↔ (∃𝑥 ∈ ℝ ∀𝑘 ∈ 𝐴 (𝑥 ≤ 𝑘 → 𝜑) ∧ ∃𝑦 ∈ ℝ ∀𝑘 ∈ 𝐴 (𝑦 ≤ 𝑘 → 𝜓)))
19		reeanv 3226	. . . 4 ⊢ (∃𝑥 ∈ ℝ ∃𝑦 ∈ ℝ (∀𝑘 ∈ 𝐴 (𝑥 ≤ 𝑘 → 𝜑) ∧ ∀𝑘 ∈ 𝐴 (𝑦 ≤ 𝑘 → 𝜓)) ↔ (∃𝑥 ∈ ℝ ∀𝑘 ∈ 𝐴 (𝑥 ≤ 𝑘 → 𝜑) ∧ ∃𝑦 ∈ ℝ ∀𝑘 ∈ 𝐴 (𝑦 ≤ 𝑘 → 𝜓)))
20	18, 19	bitr4i 277	. . 3 ⊢ ((∃𝑗 ∈ ℝ ∀𝑘 ∈ 𝐴 (𝑗 ≤ 𝑘 → 𝜑) ∧ ∃𝑗 ∈ ℝ ∀𝑘 ∈ 𝐴 (𝑗 ≤ 𝑘 → 𝜓)) ↔ ∃𝑥 ∈ ℝ ∃𝑦 ∈ ℝ (∀𝑘 ∈ 𝐴 (𝑥 ≤ 𝑘 → 𝜑) ∧ ∀𝑘 ∈ 𝐴 (𝑦 ≤ 𝑘 → 𝜓)))
21		ifcl 4573	. . . . . . 7 ⊢ ((𝑦 ∈ ℝ ∧ 𝑥 ∈ ℝ) → if(𝑥 ≤ 𝑦, 𝑦, 𝑥) ∈ ℝ)
22	21	ancoms 459	. . . . . 6 ⊢ ((𝑥 ∈ ℝ ∧ 𝑦 ∈ ℝ) → if(𝑥 ≤ 𝑦, 𝑦, 𝑥) ∈ ℝ)
23	22	adantl 482	. . . . 5 ⊢ ((𝐴 ⊆ ℝ ∧ (𝑥 ∈ ℝ ∧ 𝑦 ∈ ℝ)) → if(𝑥 ≤ 𝑦, 𝑦, 𝑥) ∈ ℝ)
24		r19.26 3111	. . . . . 6 ⊢ (∀𝑘 ∈ 𝐴 ((𝑥 ≤ 𝑘 → 𝜑) ∧ (𝑦 ≤ 𝑘 → 𝜓)) ↔ (∀𝑘 ∈ 𝐴 (𝑥 ≤ 𝑘 → 𝜑) ∧ ∀𝑘 ∈ 𝐴 (𝑦 ≤ 𝑘 → 𝜓)))
25		anim12 807	. . . . . . . 8 ⊢ (((𝑥 ≤ 𝑘 → 𝜑) ∧ (𝑦 ≤ 𝑘 → 𝜓)) → ((𝑥 ≤ 𝑘 ∧ 𝑦 ≤ 𝑘) → (𝜑 ∧ 𝜓)))
26		simplrl 775	. . . . . . . . . 10 ⊢ (((𝐴 ⊆ ℝ ∧ (𝑥 ∈ ℝ ∧ 𝑦 ∈ ℝ)) ∧ 𝑘 ∈ 𝐴) → 𝑥 ∈ ℝ)
27		simplrr 776	. . . . . . . . . 10 ⊢ (((𝐴 ⊆ ℝ ∧ (𝑥 ∈ ℝ ∧ 𝑦 ∈ ℝ)) ∧ 𝑘 ∈ 𝐴) → 𝑦 ∈ ℝ)
28		simpl 483	. . . . . . . . . . 11 ⊢ ((𝐴 ⊆ ℝ ∧ (𝑥 ∈ ℝ ∧ 𝑦 ∈ ℝ)) → 𝐴 ⊆ ℝ)
29	28	sselda 3982	. . . . . . . . . 10 ⊢ (((𝐴 ⊆ ℝ ∧ (𝑥 ∈ ℝ ∧ 𝑦 ∈ ℝ)) ∧ 𝑘 ∈ 𝐴) → 𝑘 ∈ ℝ)
30		maxle 13169	. . . . . . . . . 10 ⊢ ((𝑥 ∈ ℝ ∧ 𝑦 ∈ ℝ ∧ 𝑘 ∈ ℝ) → (if(𝑥 ≤ 𝑦, 𝑦, 𝑥) ≤ 𝑘 ↔ (𝑥 ≤ 𝑘 ∧ 𝑦 ≤ 𝑘)))
31	26, 27, 29, 30	syl3anc 1371	. . . . . . . . 9 ⊢ (((𝐴 ⊆ ℝ ∧ (𝑥 ∈ ℝ ∧ 𝑦 ∈ ℝ)) ∧ 𝑘 ∈ 𝐴) → (if(𝑥 ≤ 𝑦, 𝑦, 𝑥) ≤ 𝑘 ↔ (𝑥 ≤ 𝑘 ∧ 𝑦 ≤ 𝑘)))
32	31	imbi1d 341	. . . . . . . 8 ⊢ (((𝐴 ⊆ ℝ ∧ (𝑥 ∈ ℝ ∧ 𝑦 ∈ ℝ)) ∧ 𝑘 ∈ 𝐴) → ((if(𝑥 ≤ 𝑦, 𝑦, 𝑥) ≤ 𝑘 → (𝜑 ∧ 𝜓)) ↔ ((𝑥 ≤ 𝑘 ∧ 𝑦 ≤ 𝑘) → (𝜑 ∧ 𝜓))))
33	25, 32	imbitrrid 245	. . . . . . 7 ⊢ (((𝐴 ⊆ ℝ ∧ (𝑥 ∈ ℝ ∧ 𝑦 ∈ ℝ)) ∧ 𝑘 ∈ 𝐴) → (((𝑥 ≤ 𝑘 → 𝜑) ∧ (𝑦 ≤ 𝑘 → 𝜓)) → (if(𝑥 ≤ 𝑦, 𝑦, 𝑥) ≤ 𝑘 → (𝜑 ∧ 𝜓))))
34	33	ralimdva 3167	. . . . . 6 ⊢ ((𝐴 ⊆ ℝ ∧ (𝑥 ∈ ℝ ∧ 𝑦 ∈ ℝ)) → (∀𝑘 ∈ 𝐴 ((𝑥 ≤ 𝑘 → 𝜑) ∧ (𝑦 ≤ 𝑘 → 𝜓)) → ∀𝑘 ∈ 𝐴 (if(𝑥 ≤ 𝑦, 𝑦, 𝑥) ≤ 𝑘 → (𝜑 ∧ 𝜓))))
35	24, 34	biimtrrid 242	. . . . 5 ⊢ ((𝐴 ⊆ ℝ ∧ (𝑥 ∈ ℝ ∧ 𝑦 ∈ ℝ)) → ((∀𝑘 ∈ 𝐴 (𝑥 ≤ 𝑘 → 𝜑) ∧ ∀𝑘 ∈ 𝐴 (𝑦 ≤ 𝑘 → 𝜓)) → ∀𝑘 ∈ 𝐴 (if(𝑥 ≤ 𝑦, 𝑦, 𝑥) ≤ 𝑘 → (𝜑 ∧ 𝜓))))
36		breq1 5151	. . . . . 6 ⊢ (𝑗 = if(𝑥 ≤ 𝑦, 𝑦, 𝑥) → (𝑗 ≤ 𝑘 ↔ if(𝑥 ≤ 𝑦, 𝑦, 𝑥) ≤ 𝑘))
37	36	rspceaimv 3617	. . . . 5 ⊢ ((if(𝑥 ≤ 𝑦, 𝑦, 𝑥) ∈ ℝ ∧ ∀𝑘 ∈ 𝐴 (if(𝑥 ≤ 𝑦, 𝑦, 𝑥) ≤ 𝑘 → (𝜑 ∧ 𝜓))) → ∃𝑗 ∈ ℝ ∀𝑘 ∈ 𝐴 (𝑗 ≤ 𝑘 → (𝜑 ∧ 𝜓)))
38	23, 35, 37	syl6an 682	. . . 4 ⊢ ((𝐴 ⊆ ℝ ∧ (𝑥 ∈ ℝ ∧ 𝑦 ∈ ℝ)) → ((∀𝑘 ∈ 𝐴 (𝑥 ≤ 𝑘 → 𝜑) ∧ ∀𝑘 ∈ 𝐴 (𝑦 ≤ 𝑘 → 𝜓)) → ∃𝑗 ∈ ℝ ∀𝑘 ∈ 𝐴 (𝑗 ≤ 𝑘 → (𝜑 ∧ 𝜓))))
39	38	rexlimdvva 3211	. . 3 ⊢ (𝐴 ⊆ ℝ → (∃𝑥 ∈ ℝ ∃𝑦 ∈ ℝ (∀𝑘 ∈ 𝐴 (𝑥 ≤ 𝑘 → 𝜑) ∧ ∀𝑘 ∈ 𝐴 (𝑦 ≤ 𝑘 → 𝜓)) → ∃𝑗 ∈ ℝ ∀𝑘 ∈ 𝐴 (𝑗 ≤ 𝑘 → (𝜑 ∧ 𝜓))))
40	20, 39	biimtrid 241	. 2 ⊢ (𝐴 ⊆ ℝ → ((∃𝑗 ∈ ℝ ∀𝑘 ∈ 𝐴 (𝑗 ≤ 𝑘 → 𝜑) ∧ ∃𝑗 ∈ ℝ ∀𝑘 ∈ 𝐴 (𝑗 ≤ 𝑘 → 𝜓)) → ∃𝑗 ∈ ℝ ∀𝑘 ∈ 𝐴 (𝑗 ≤ 𝑘 → (𝜑 ∧ 𝜓))))
41	9, 40	impbid2 225	1 ⊢ (𝐴 ⊆ ℝ → (∃𝑗 ∈ ℝ ∀𝑘 ∈ 𝐴 (𝑗 ≤ 𝑘 → (𝜑 ∧ 𝜓)) ↔ (∃𝑗 ∈ ℝ ∀𝑘 ∈ 𝐴 (𝑗 ≤ 𝑘 → 𝜑) ∧ ∃𝑗 ∈ ℝ ∀𝑘 ∈ 𝐴 (𝑗 ≤ 𝑘 → 𝜓))))

Syntax hints:   → wi 4   ↔ wb 205   ∧ wa 396   ∈ wcel 2106  ∀wral 3061  ∃wrex 3070   ⊆ wss 3948  ifcif 4528   class class class wbr 5148  ℝcr 11108   ≤ cle 11248

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2703  ax-sep 5299  ax-nul 5306  ax-pow 5363  ax-pr 5427  ax-un 7724  ax-cnex 11165  ax-resscn 11166  ax-pre-lttri 11183  ax-pre-lttrn 11184

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 846  df-3or 1088  df-3an 1089  df-tru 1544  df-fal 1554  df-ex 1782  df-nf 1786  df-sb 2068  df-mo 2534  df-eu 2563  df-clab 2710  df-cleq 2724  df-clel 2810  df-nfc 2885  df-ne 2941  df-nel 3047  df-ral 3062  df-rex 3071  df-rab 3433  df-v 3476  df-sbc 3778  df-csb 3894  df-dif 3951  df-un 3953  df-in 3955  df-ss 3965  df-nul 4323  df-if 4529  df-pw 4604  df-sn 4629  df-pr 4631  df-op 4635  df-uni 4909  df-br 5149  df-opab 5211  df-mpt 5232  df-id 5574  df-po 5588  df-so 5589  df-xp 5682  df-rel 5683  df-cnv 5684  df-co 5685  df-dm 5686  df-rn 5687  df-res 5688  df-ima 5689  df-iota 6495  df-fun 6545  df-fn 6546  df-f 6547  df-f1 6548  df-fo 6549  df-f1o 6550  df-fv 6551  df-er 8702  df-en 8939  df-dom 8940  df-sdom 8941  df-pnf 11249  df-mnf 11250  df-xr 11251  df-ltxr 11252  df-le 11253

This theorem is referenced by:  o1lo1  15480  rlimuni  15493  lo1add  15570  lo1mul  15571  rlimno1  15599