Theorem rexanuz 10952

Description: Combine two different upper integer properties into one. (Contributed by Mario Carneiro, 25-Dec-2013.)

Assertion

Ref	Expression
rexanuz	⊢ (∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ≥‘𝑗)(𝜑 ∧ 𝜓) ↔ (∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ≥‘𝑗)𝜑 ∧ ∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ≥‘𝑗)𝜓))

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

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

Proof of Theorem rexanuz

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

Step	Hyp	Ref	Expression
1		r19.26 2596	. . . 4 ⊢ (∀𝑘 ∈ (ℤ≥‘𝑗)(𝜑 ∧ 𝜓) ↔ (∀𝑘 ∈ (ℤ≥‘𝑗)𝜑 ∧ ∀𝑘 ∈ (ℤ≥‘𝑗)𝜓))
2	1	rexbii 2477	. . 3 ⊢ (∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ≥‘𝑗)(𝜑 ∧ 𝜓) ↔ ∃𝑗 ∈ ℤ (∀𝑘 ∈ (ℤ≥‘𝑗)𝜑 ∧ ∀𝑘 ∈ (ℤ≥‘𝑗)𝜓))
3		r19.40 2624	. . 3 ⊢ (∃𝑗 ∈ ℤ (∀𝑘 ∈ (ℤ≥‘𝑗)𝜑 ∧ ∀𝑘 ∈ (ℤ≥‘𝑗)𝜓) → (∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ≥‘𝑗)𝜑 ∧ ∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ≥‘𝑗)𝜓))
4	2, 3	sylbi 120	. 2 ⊢ (∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ≥‘𝑗)(𝜑 ∧ 𝜓) → (∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ≥‘𝑗)𝜑 ∧ ∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ≥‘𝑗)𝜓))
5		uzf 9490	. . . 4 ⊢ ℤ≥:ℤ⟶𝒫 ℤ
6		ffn 5347	. . . 4 ⊢ (ℤ≥:ℤ⟶𝒫 ℤ → ℤ≥ Fn ℤ)
7		raleq 2665	. . . . 5 ⊢ (𝑥 = (ℤ≥‘𝑗) → (∀𝑘 ∈ 𝑥 𝜑 ↔ ∀𝑘 ∈ (ℤ≥‘𝑗)𝜑))
8	7	rexrn 5633	. . . 4 ⊢ (ℤ≥ Fn ℤ → (∃𝑥 ∈ ran ℤ≥∀𝑘 ∈ 𝑥 𝜑 ↔ ∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ≥‘𝑗)𝜑))
9	5, 6, 8	mp2b 8	. . 3 ⊢ (∃𝑥 ∈ ran ℤ≥∀𝑘 ∈ 𝑥 𝜑 ↔ ∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ≥‘𝑗)𝜑)
10		raleq 2665	. . . . 5 ⊢ (𝑦 = (ℤ≥‘𝑗) → (∀𝑘 ∈ 𝑦 𝜓 ↔ ∀𝑘 ∈ (ℤ≥‘𝑗)𝜓))
11	10	rexrn 5633	. . . 4 ⊢ (ℤ≥ Fn ℤ → (∃𝑦 ∈ ran ℤ≥∀𝑘 ∈ 𝑦 𝜓 ↔ ∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ≥‘𝑗)𝜓))
12	5, 6, 11	mp2b 8	. . 3 ⊢ (∃𝑦 ∈ ran ℤ≥∀𝑘 ∈ 𝑦 𝜓 ↔ ∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ≥‘𝑗)𝜓)
13		uzin2 10951	. . . . . . . . 9 ⊢ ((𝑥 ∈ ran ℤ≥ ∧ 𝑦 ∈ ran ℤ≥) → (𝑥 ∩ 𝑦) ∈ ran ℤ≥)
14		inss1 3347	. . . . . . . . . . . 12 ⊢ (𝑥 ∩ 𝑦) ⊆ 𝑥
15		ssralv 3211	. . . . . . . . . . . 12 ⊢ ((𝑥 ∩ 𝑦) ⊆ 𝑥 → (∀𝑘 ∈ 𝑥 𝜑 → ∀𝑘 ∈ (𝑥 ∩ 𝑦)𝜑))
16	14, 15	ax-mp 5	. . . . . . . . . . 11 ⊢ (∀𝑘 ∈ 𝑥 𝜑 → ∀𝑘 ∈ (𝑥 ∩ 𝑦)𝜑)
17		inss2 3348	. . . . . . . . . . . 12 ⊢ (𝑥 ∩ 𝑦) ⊆ 𝑦
18		ssralv 3211	. . . . . . . . . . . 12 ⊢ ((𝑥 ∩ 𝑦) ⊆ 𝑦 → (∀𝑘 ∈ 𝑦 𝜓 → ∀𝑘 ∈ (𝑥 ∩ 𝑦)𝜓))
19	17, 18	ax-mp 5	. . . . . . . . . . 11 ⊢ (∀𝑘 ∈ 𝑦 𝜓 → ∀𝑘 ∈ (𝑥 ∩ 𝑦)𝜓)
20	16, 19	anim12i 336	. . . . . . . . . 10 ⊢ ((∀𝑘 ∈ 𝑥 𝜑 ∧ ∀𝑘 ∈ 𝑦 𝜓) → (∀𝑘 ∈ (𝑥 ∩ 𝑦)𝜑 ∧ ∀𝑘 ∈ (𝑥 ∩ 𝑦)𝜓))
21		r19.26 2596	. . . . . . . . . 10 ⊢ (∀𝑘 ∈ (𝑥 ∩ 𝑦)(𝜑 ∧ 𝜓) ↔ (∀𝑘 ∈ (𝑥 ∩ 𝑦)𝜑 ∧ ∀𝑘 ∈ (𝑥 ∩ 𝑦)𝜓))
22	20, 21	sylibr 133	. . . . . . . . 9 ⊢ ((∀𝑘 ∈ 𝑥 𝜑 ∧ ∀𝑘 ∈ 𝑦 𝜓) → ∀𝑘 ∈ (𝑥 ∩ 𝑦)(𝜑 ∧ 𝜓))
23		raleq 2665	. . . . . . . . . 10 ⊢ (𝑧 = (𝑥 ∩ 𝑦) → (∀𝑘 ∈ 𝑧 (𝜑 ∧ 𝜓) ↔ ∀𝑘 ∈ (𝑥 ∩ 𝑦)(𝜑 ∧ 𝜓)))
24	23	rspcev 2834	. . . . . . . . 9 ⊢ (((𝑥 ∩ 𝑦) ∈ ran ℤ≥ ∧ ∀𝑘 ∈ (𝑥 ∩ 𝑦)(𝜑 ∧ 𝜓)) → ∃𝑧 ∈ ran ℤ≥∀𝑘 ∈ 𝑧 (𝜑 ∧ 𝜓))
25	13, 22, 24	syl2an 287	. . . . . . . 8 ⊢ (((𝑥 ∈ ran ℤ≥ ∧ 𝑦 ∈ ran ℤ≥) ∧ (∀𝑘 ∈ 𝑥 𝜑 ∧ ∀𝑘 ∈ 𝑦 𝜓)) → ∃𝑧 ∈ ran ℤ≥∀𝑘 ∈ 𝑧 (𝜑 ∧ 𝜓))
26	25	an4s 583	. . . . . . 7 ⊢ (((𝑥 ∈ ran ℤ≥ ∧ ∀𝑘 ∈ 𝑥 𝜑) ∧ (𝑦 ∈ ran ℤ≥ ∧ ∀𝑘 ∈ 𝑦 𝜓)) → ∃𝑧 ∈ ran ℤ≥∀𝑘 ∈ 𝑧 (𝜑 ∧ 𝜓))
27	26	rexlimdvaa 2588	. . . . . 6 ⊢ ((𝑥 ∈ ran ℤ≥ ∧ ∀𝑘 ∈ 𝑥 𝜑) → (∃𝑦 ∈ ran ℤ≥∀𝑘 ∈ 𝑦 𝜓 → ∃𝑧 ∈ ran ℤ≥∀𝑘 ∈ 𝑧 (𝜑 ∧ 𝜓)))
28	27	rexlimiva 2582	. . . . 5 ⊢ (∃𝑥 ∈ ran ℤ≥∀𝑘 ∈ 𝑥 𝜑 → (∃𝑦 ∈ ran ℤ≥∀𝑘 ∈ 𝑦 𝜓 → ∃𝑧 ∈ ran ℤ≥∀𝑘 ∈ 𝑧 (𝜑 ∧ 𝜓)))
29	28	imp 123	. . . 4 ⊢ ((∃𝑥 ∈ ran ℤ≥∀𝑘 ∈ 𝑥 𝜑 ∧ ∃𝑦 ∈ ran ℤ≥∀𝑘 ∈ 𝑦 𝜓) → ∃𝑧 ∈ ran ℤ≥∀𝑘 ∈ 𝑧 (𝜑 ∧ 𝜓))
30		raleq 2665	. . . . . 6 ⊢ (𝑧 = (ℤ≥‘𝑗) → (∀𝑘 ∈ 𝑧 (𝜑 ∧ 𝜓) ↔ ∀𝑘 ∈ (ℤ≥‘𝑗)(𝜑 ∧ 𝜓)))
31	30	rexrn 5633	. . . . 5 ⊢ (ℤ≥ Fn ℤ → (∃𝑧 ∈ ran ℤ≥∀𝑘 ∈ 𝑧 (𝜑 ∧ 𝜓) ↔ ∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ≥‘𝑗)(𝜑 ∧ 𝜓)))
32	5, 6, 31	mp2b 8	. . . 4 ⊢ (∃𝑧 ∈ ran ℤ≥∀𝑘 ∈ 𝑧 (𝜑 ∧ 𝜓) ↔ ∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ≥‘𝑗)(𝜑 ∧ 𝜓))
33	29, 32	sylib 121	. . 3 ⊢ ((∃𝑥 ∈ ran ℤ≥∀𝑘 ∈ 𝑥 𝜑 ∧ ∃𝑦 ∈ ran ℤ≥∀𝑘 ∈ 𝑦 𝜓) → ∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ≥‘𝑗)(𝜑 ∧ 𝜓))
34	9, 12, 33	syl2anbr 290	. 2 ⊢ ((∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ≥‘𝑗)𝜑 ∧ ∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ≥‘𝑗)𝜓) → ∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ≥‘𝑗)(𝜑 ∧ 𝜓))
35	4, 34	impbii 125	1 ⊢ (∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ≥‘𝑗)(𝜑 ∧ 𝜓) ↔ (∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ≥‘𝑗)𝜑 ∧ ∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ≥‘𝑗)𝜓))

Syntax hints:   → wi 4   ∧ wa 103   ↔ wb 104   ∈ wcel 2141  ∀wral 2448  ∃wrex 2449   ∩ cin 3120   ⊆ wss 3121  𝒫 cpw 3566  ran crn 4612   Fn wfn 5193  ⟶wf 5194  ‘cfv 5198  ℤcz 9212  ℤ_≥cuz 9487

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 609  ax-in2 610  ax-io 704  ax-5 1440  ax-7 1441  ax-gen 1442  ax-ie1 1486  ax-ie2 1487  ax-8 1497  ax-10 1498  ax-11 1499  ax-i12 1500  ax-bndl 1502  ax-4 1503  ax-17 1519  ax-i9 1523  ax-ial 1527  ax-i5r 1528  ax-13 2143  ax-14 2144  ax-ext 2152  ax-sep 4107  ax-pow 4160  ax-pr 4194  ax-un 4418  ax-setind 4521  ax-cnex 7865  ax-resscn 7866  ax-1cn 7867  ax-1re 7868  ax-icn 7869  ax-addcl 7870  ax-addrcl 7871  ax-mulcl 7872  ax-addcom 7874  ax-addass 7876  ax-distr 7878  ax-i2m1 7879  ax-0lt1 7880  ax-0id 7882  ax-rnegex 7883  ax-cnre 7885  ax-pre-ltirr 7886  ax-pre-ltwlin 7887  ax-pre-lttrn 7888  ax-pre-apti 7889  ax-pre-ltadd 7890

This theorem depends on definitions:  df-bi 116  df-dc 830  df-3or 974  df-3an 975  df-tru 1351  df-fal 1354  df-nf 1454  df-sb 1756  df-eu 2022  df-mo 2023  df-clab 2157  df-cleq 2163  df-clel 2166  df-nfc 2301  df-ne 2341  df-nel 2436  df-ral 2453  df-rex 2454  df-reu 2455  df-rab 2457  df-v 2732  df-sbc 2956  df-dif 3123  df-un 3125  df-in 3127  df-ss 3134  df-if 3527  df-pw 3568  df-sn 3589  df-pr 3590  df-op 3592  df-uni 3797  df-int 3832  df-br 3990  df-opab 4051  df-mpt 4052  df-id 4278  df-xp 4617  df-rel 4618  df-cnv 4619  df-co 4620  df-dm 4621  df-rn 4622  df-res 4623  df-ima 4624  df-iota 5160  df-fun 5200  df-fn 5201  df-f 5202  df-fv 5206  df-riota 5809  df-ov 5856  df-oprab 5857  df-mpo 5858  df-pnf 7956  df-mnf 7957  df-xr 7958  df-ltxr 7959  df-le 7960  df-sub 8092  df-neg 8093  df-inn 8879  df-n0 9136  df-z 9213  df-uz 9488

This theorem is referenced by:  rexfiuz  10953  rexuz3  10954  rexanuz2  10955