Theorem rexanuz 11777

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 2677	. . . 4 ⊢ (∀𝑘 ∈ (ℤ≥‘𝑗)(𝜑 ∧ 𝜓) ↔ (∀𝑘 ∈ (ℤ≥‘𝑗)𝜑 ∧ ∀𝑘 ∈ (ℤ≥‘𝑗)𝜓))
2	1	rexbii 2557	. . 3 ⊢ (∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ≥‘𝑗)(𝜑 ∧ 𝜓) ↔ ∃𝑗 ∈ ℤ (∀𝑘 ∈ (ℤ≥‘𝑗)𝜑 ∧ ∀𝑘 ∈ (ℤ≥‘𝑗)𝜓))
3		r19.40 2705	. . 3 ⊢ (∃𝑗 ∈ ℤ (∀𝑘 ∈ (ℤ≥‘𝑗)𝜑 ∧ ∀𝑘 ∈ (ℤ≥‘𝑗)𝜓) → (∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ≥‘𝑗)𝜑 ∧ ∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ≥‘𝑗)𝜓))
4	2, 3	sylbi 121	. 2 ⊢ (∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ≥‘𝑗)(𝜑 ∧ 𝜓) → (∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ≥‘𝑗)𝜑 ∧ ∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ≥‘𝑗)𝜓))
5		uzf 9941	. . . 4 ⊢ ℤ≥:ℤ⟶𝒫 ℤ
6		ffn 5536	. . . 4 ⊢ (ℤ≥:ℤ⟶𝒫 ℤ → ℤ≥ Fn ℤ)
7		raleq 2749	. . . . 5 ⊢ (𝑥 = (ℤ≥‘𝑗) → (∀𝑘 ∈ 𝑥 𝜑 ↔ ∀𝑘 ∈ (ℤ≥‘𝑗)𝜑))
8	7	rexrn 5848	. . . 4 ⊢ (ℤ≥ Fn ℤ → (∃𝑥 ∈ ran ℤ≥∀𝑘 ∈ 𝑥 𝜑 ↔ ∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ≥‘𝑗)𝜑))
9	5, 6, 8	mp2b 8	. . 3 ⊢ (∃𝑥 ∈ ran ℤ≥∀𝑘 ∈ 𝑥 𝜑 ↔ ∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ≥‘𝑗)𝜑)
10		raleq 2749	. . . . 5 ⊢ (𝑦 = (ℤ≥‘𝑗) → (∀𝑘 ∈ 𝑦 𝜓 ↔ ∀𝑘 ∈ (ℤ≥‘𝑗)𝜓))
11	10	rexrn 5848	. . . 4 ⊢ (ℤ≥ Fn ℤ → (∃𝑦 ∈ ran ℤ≥∀𝑘 ∈ 𝑦 𝜓 ↔ ∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ≥‘𝑗)𝜓))
12	5, 6, 11	mp2b 8	. . 3 ⊢ (∃𝑦 ∈ ran ℤ≥∀𝑘 ∈ 𝑦 𝜓 ↔ ∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ≥‘𝑗)𝜓)
13		uzin2 11776	. . . . . . . . 9 ⊢ ((𝑥 ∈ ran ℤ≥ ∧ 𝑦 ∈ ran ℤ≥) → (𝑥 ∩ 𝑦) ∈ ran ℤ≥)
14		inss1 3451	. . . . . . . . . . . 12 ⊢ (𝑥 ∩ 𝑦) ⊆ 𝑥
15		ssralv 3312	. . . . . . . . . . . 12 ⊢ ((𝑥 ∩ 𝑦) ⊆ 𝑥 → (∀𝑘 ∈ 𝑥 𝜑 → ∀𝑘 ∈ (𝑥 ∩ 𝑦)𝜑))
16	14, 15	ax-mp 5	. . . . . . . . . . 11 ⊢ (∀𝑘 ∈ 𝑥 𝜑 → ∀𝑘 ∈ (𝑥 ∩ 𝑦)𝜑)
17		inss2 3452	. . . . . . . . . . . 12 ⊢ (𝑥 ∩ 𝑦) ⊆ 𝑦
18		ssralv 3312	. . . . . . . . . . . 12 ⊢ ((𝑥 ∩ 𝑦) ⊆ 𝑦 → (∀𝑘 ∈ 𝑦 𝜓 → ∀𝑘 ∈ (𝑥 ∩ 𝑦)𝜓))
19	17, 18	ax-mp 5	. . . . . . . . . . 11 ⊢ (∀𝑘 ∈ 𝑦 𝜓 → ∀𝑘 ∈ (𝑥 ∩ 𝑦)𝜓)
20	16, 19	anim12i 338	. . . . . . . . . 10 ⊢ ((∀𝑘 ∈ 𝑥 𝜑 ∧ ∀𝑘 ∈ 𝑦 𝜓) → (∀𝑘 ∈ (𝑥 ∩ 𝑦)𝜑 ∧ ∀𝑘 ∈ (𝑥 ∩ 𝑦)𝜓))
21		r19.26 2677	. . . . . . . . . 10 ⊢ (∀𝑘 ∈ (𝑥 ∩ 𝑦)(𝜑 ∧ 𝜓) ↔ (∀𝑘 ∈ (𝑥 ∩ 𝑦)𝜑 ∧ ∀𝑘 ∈ (𝑥 ∩ 𝑦)𝜓))
22	20, 21	sylibr 134	. . . . . . . . 9 ⊢ ((∀𝑘 ∈ 𝑥 𝜑 ∧ ∀𝑘 ∈ 𝑦 𝜓) → ∀𝑘 ∈ (𝑥 ∩ 𝑦)(𝜑 ∧ 𝜓))
23		raleq 2749	. . . . . . . . . 10 ⊢ (𝑧 = (𝑥 ∩ 𝑦) → (∀𝑘 ∈ 𝑧 (𝜑 ∧ 𝜓) ↔ ∀𝑘 ∈ (𝑥 ∩ 𝑦)(𝜑 ∧ 𝜓)))
24	23	rspcev 2929	. . . . . . . . 9 ⊢ (((𝑥 ∩ 𝑦) ∈ ran ℤ≥ ∧ ∀𝑘 ∈ (𝑥 ∩ 𝑦)(𝜑 ∧ 𝜓)) → ∃𝑧 ∈ ran ℤ≥∀𝑘 ∈ 𝑧 (𝜑 ∧ 𝜓))
25	13, 22, 24	syl2an 289	. . . . . . . 8 ⊢ (((𝑥 ∈ ran ℤ≥ ∧ 𝑦 ∈ ran ℤ≥) ∧ (∀𝑘 ∈ 𝑥 𝜑 ∧ ∀𝑘 ∈ 𝑦 𝜓)) → ∃𝑧 ∈ ran ℤ≥∀𝑘 ∈ 𝑧 (𝜑 ∧ 𝜓))
26	25	an4s 596	. . . . . . 7 ⊢ (((𝑥 ∈ ran ℤ≥ ∧ ∀𝑘 ∈ 𝑥 𝜑) ∧ (𝑦 ∈ ran ℤ≥ ∧ ∀𝑘 ∈ 𝑦 𝜓)) → ∃𝑧 ∈ ran ℤ≥∀𝑘 ∈ 𝑧 (𝜑 ∧ 𝜓))
27	26	rexlimdvaa 2669	. . . . . 6 ⊢ ((𝑥 ∈ ran ℤ≥ ∧ ∀𝑘 ∈ 𝑥 𝜑) → (∃𝑦 ∈ ran ℤ≥∀𝑘 ∈ 𝑦 𝜓 → ∃𝑧 ∈ ran ℤ≥∀𝑘 ∈ 𝑧 (𝜑 ∧ 𝜓)))
28	27	rexlimiva 2663	. . . . 5 ⊢ (∃𝑥 ∈ ran ℤ≥∀𝑘 ∈ 𝑥 𝜑 → (∃𝑦 ∈ ran ℤ≥∀𝑘 ∈ 𝑦 𝜓 → ∃𝑧 ∈ ran ℤ≥∀𝑘 ∈ 𝑧 (𝜑 ∧ 𝜓)))
29	28	imp 124	. . . 4 ⊢ ((∃𝑥 ∈ ran ℤ≥∀𝑘 ∈ 𝑥 𝜑 ∧ ∃𝑦 ∈ ran ℤ≥∀𝑘 ∈ 𝑦 𝜓) → ∃𝑧 ∈ ran ℤ≥∀𝑘 ∈ 𝑧 (𝜑 ∧ 𝜓))
30		raleq 2749	. . . . . 6 ⊢ (𝑧 = (ℤ≥‘𝑗) → (∀𝑘 ∈ 𝑧 (𝜑 ∧ 𝜓) ↔ ∀𝑘 ∈ (ℤ≥‘𝑗)(𝜑 ∧ 𝜓)))
31	30	rexrn 5848	. . . . 5 ⊢ (ℤ≥ Fn ℤ → (∃𝑧 ∈ ran ℤ≥∀𝑘 ∈ 𝑧 (𝜑 ∧ 𝜓) ↔ ∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ≥‘𝑗)(𝜑 ∧ 𝜓)))
32	5, 6, 31	mp2b 8	. . . 4 ⊢ (∃𝑧 ∈ ran ℤ≥∀𝑘 ∈ 𝑧 (𝜑 ∧ 𝜓) ↔ ∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ≥‘𝑗)(𝜑 ∧ 𝜓))
33	29, 32	sylib 122	. . 3 ⊢ ((∃𝑥 ∈ ran ℤ≥∀𝑘 ∈ 𝑥 𝜑 ∧ ∃𝑦 ∈ ran ℤ≥∀𝑘 ∈ 𝑦 𝜓) → ∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ≥‘𝑗)(𝜑 ∧ 𝜓))
34	9, 12, 33	syl2anbr 292	. 2 ⊢ ((∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ≥‘𝑗)𝜑 ∧ ∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ≥‘𝑗)𝜓) → ∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ≥‘𝑗)(𝜑 ∧ 𝜓))
35	4, 34	impbii 126	1 ⊢ (∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ≥‘𝑗)(𝜑 ∧ 𝜓) ↔ (∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ≥‘𝑗)𝜑 ∧ ∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ≥‘𝑗)𝜓))

This proof depends on syntax axioms:   → wi 4   ∧ wa 104   ↔ wb 105   ∈ wcel 2209  ∀wral 2528  ∃wrex 2529   ∩ cin 3219   ⊆ wss 3220  𝒫 cpw 3688  ran crn 4777   Fn wfn 5375  ⟶wf 5376  ‘cfv 5380  ℤcz 9656  ℤ_≥cuz 9938

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4251  ax-pow 4313  ax-pr 4348  ax-un 4580  ax-setind 4686  ax-cnex 8277  ax-resscn 8278  ax-1cn 8279  ax-1re 8280  ax-icn 8281  ax-addcl 8282  ax-addrcl 8283  ax-mulcl 8284  ax-addcom 8286  ax-addass 8288  ax-distr 8290  ax-i2m1 8291  ax-0lt1 8292  ax-0id 8294  ax-rnegex 8295  ax-cnre 8297  ax-pre-ltirr 8298  ax-pre-ltwlin 8299  ax-pre-lttrn 8300  ax-pre-apti 8301  ax-pre-ltadd 8302

This proof depends on definitions:  df-bi 117  df-dc 847  df-3or 1010  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-nel 2516  df-ral 2533  df-rex 2534  df-reu 2535  df-rab 2537  df-v 2823  df-sbc 3052  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-if 3639  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-br 4132  df-opab 4194  df-mpt 4195  df-id 4440  df-xp 4782  df-rel 4783  df-cnv 4784  df-co 4785  df-dm 4786  df-rn 4787  df-res 4788  df-ima 4789  df-iota 5340  df-fun 5382  df-fn 5383  df-f 5384  df-fv 5388  df-riota 6041  df-ov 6091  df-oprab 6092  df-mpo 6093  df-pnf 8369  df-mnf 8370  df-xr 8371  df-ltxr 8372  df-le 8373  df-sub 8507  df-neg 8508  df-inn 9315  df-n0 9576  df-z 9657  df-uz 9939

This theorem is used by:  rexfiuz  11778  rexuz3  11779  rexanuz2  11780