Theorem rexfiuz 14987

Description: Combine finitely many different upper integer properties into one. (Contributed by Mario Carneiro, 6-Jun-2014.)

Assertion

Ref	Expression
rexfiuz	⊢ (𝐴 ∈ Fin → (∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ≥‘𝑗)∀𝑛 ∈ 𝐴 𝜑 ↔ ∀𝑛 ∈ 𝐴 ∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ≥‘𝑗)𝜑))

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

Allowed substitution hints:   𝜑(𝑘,𝑛)

Proof of Theorem rexfiuz

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

Step	Hyp	Ref	Expression
1		raleq 3333	. . . 4 ⊢ (𝑥 = ∅ → (∀𝑛 ∈ 𝑥 𝜑 ↔ ∀𝑛 ∈ ∅ 𝜑))
2	1	rexralbidv 3229	. . 3 ⊢ (𝑥 = ∅ → (∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ≥‘𝑗)∀𝑛 ∈ 𝑥 𝜑 ↔ ∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ≥‘𝑗)∀𝑛 ∈ ∅ 𝜑))
3		raleq 3333	. . 3 ⊢ (𝑥 = ∅ → (∀𝑛 ∈ 𝑥 ∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ≥‘𝑗)𝜑 ↔ ∀𝑛 ∈ ∅ ∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ≥‘𝑗)𝜑))
4	2, 3	bibi12d 345	. 2 ⊢ (𝑥 = ∅ → ((∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ≥‘𝑗)∀𝑛 ∈ 𝑥 𝜑 ↔ ∀𝑛 ∈ 𝑥 ∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ≥‘𝑗)𝜑) ↔ (∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ≥‘𝑗)∀𝑛 ∈ ∅ 𝜑 ↔ ∀𝑛 ∈ ∅ ∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ≥‘𝑗)𝜑)))
5		raleq 3333	. . . 4 ⊢ (𝑥 = 𝑦 → (∀𝑛 ∈ 𝑥 𝜑 ↔ ∀𝑛 ∈ 𝑦 𝜑))
6	5	rexralbidv 3229	. . 3 ⊢ (𝑥 = 𝑦 → (∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ≥‘𝑗)∀𝑛 ∈ 𝑥 𝜑 ↔ ∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ≥‘𝑗)∀𝑛 ∈ 𝑦 𝜑))
7		raleq 3333	. . 3 ⊢ (𝑥 = 𝑦 → (∀𝑛 ∈ 𝑥 ∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ≥‘𝑗)𝜑 ↔ ∀𝑛 ∈ 𝑦 ∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ≥‘𝑗)𝜑))
8	6, 7	bibi12d 345	. 2 ⊢ (𝑥 = 𝑦 → ((∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ≥‘𝑗)∀𝑛 ∈ 𝑥 𝜑 ↔ ∀𝑛 ∈ 𝑥 ∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ≥‘𝑗)𝜑) ↔ (∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ≥‘𝑗)∀𝑛 ∈ 𝑦 𝜑 ↔ ∀𝑛 ∈ 𝑦 ∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ≥‘𝑗)𝜑)))
9		raleq 3333	. . . 4 ⊢ (𝑥 = (𝑦 ∪ {𝑧}) → (∀𝑛 ∈ 𝑥 𝜑 ↔ ∀𝑛 ∈ (𝑦 ∪ {𝑧})𝜑))
10	9	rexralbidv 3229	. . 3 ⊢ (𝑥 = (𝑦 ∪ {𝑧}) → (∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ≥‘𝑗)∀𝑛 ∈ 𝑥 𝜑 ↔ ∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ≥‘𝑗)∀𝑛 ∈ (𝑦 ∪ {𝑧})𝜑))
11		raleq 3333	. . 3 ⊢ (𝑥 = (𝑦 ∪ {𝑧}) → (∀𝑛 ∈ 𝑥 ∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ≥‘𝑗)𝜑 ↔ ∀𝑛 ∈ (𝑦 ∪ {𝑧})∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ≥‘𝑗)𝜑))
12	10, 11	bibi12d 345	. 2 ⊢ (𝑥 = (𝑦 ∪ {𝑧}) → ((∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ≥‘𝑗)∀𝑛 ∈ 𝑥 𝜑 ↔ ∀𝑛 ∈ 𝑥 ∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ≥‘𝑗)𝜑) ↔ (∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ≥‘𝑗)∀𝑛 ∈ (𝑦 ∪ {𝑧})𝜑 ↔ ∀𝑛 ∈ (𝑦 ∪ {𝑧})∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ≥‘𝑗)𝜑)))
13		raleq 3333	. . . 4 ⊢ (𝑥 = 𝐴 → (∀𝑛 ∈ 𝑥 𝜑 ↔ ∀𝑛 ∈ 𝐴 𝜑))
14	13	rexralbidv 3229	. . 3 ⊢ (𝑥 = 𝐴 → (∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ≥‘𝑗)∀𝑛 ∈ 𝑥 𝜑 ↔ ∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ≥‘𝑗)∀𝑛 ∈ 𝐴 𝜑))
15		raleq 3333	. . 3 ⊢ (𝑥 = 𝐴 → (∀𝑛 ∈ 𝑥 ∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ≥‘𝑗)𝜑 ↔ ∀𝑛 ∈ 𝐴 ∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ≥‘𝑗)𝜑))
16	14, 15	bibi12d 345	. 2 ⊢ (𝑥 = 𝐴 → ((∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ≥‘𝑗)∀𝑛 ∈ 𝑥 𝜑 ↔ ∀𝑛 ∈ 𝑥 ∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ≥‘𝑗)𝜑) ↔ (∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ≥‘𝑗)∀𝑛 ∈ 𝐴 𝜑 ↔ ∀𝑛 ∈ 𝐴 ∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ≥‘𝑗)𝜑)))
17		0z 12260	. . . . 5 ⊢ 0 ∈ ℤ
18	17	ne0ii 4268	. . . 4 ⊢ ℤ ≠ ∅
19		ral0 4440	. . . . 5 ⊢ ∀𝑛 ∈ ∅ 𝜑
20	19	rgen2w 3076	. . . 4 ⊢ ∀𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ≥‘𝑗)∀𝑛 ∈ ∅ 𝜑
21		r19.2z 4422	. . . 4 ⊢ ((ℤ ≠ ∅ ∧ ∀𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ≥‘𝑗)∀𝑛 ∈ ∅ 𝜑) → ∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ≥‘𝑗)∀𝑛 ∈ ∅ 𝜑)
22	18, 20, 21	mp2an 688	. . 3 ⊢ ∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ≥‘𝑗)∀𝑛 ∈ ∅ 𝜑
23		ral0 4440	. . 3 ⊢ ∀𝑛 ∈ ∅ ∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ≥‘𝑗)𝜑
24	22, 23	2th 263	. 2 ⊢ (∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ≥‘𝑗)∀𝑛 ∈ ∅ 𝜑 ↔ ∀𝑛 ∈ ∅ ∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ≥‘𝑗)𝜑)
25		anbi1 631	. . . 4 ⊢ ((∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ≥‘𝑗)∀𝑛 ∈ 𝑦 𝜑 ↔ ∀𝑛 ∈ 𝑦 ∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ≥‘𝑗)𝜑) → ((∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ≥‘𝑗)∀𝑛 ∈ 𝑦 𝜑 ∧ ∀𝑛 ∈ {𝑧}∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ≥‘𝑗)𝜑) ↔ (∀𝑛 ∈ 𝑦 ∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ≥‘𝑗)𝜑 ∧ ∀𝑛 ∈ {𝑧}∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ≥‘𝑗)𝜑)))
26		rexanuz 14985	. . . . 5 ⊢ (∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ≥‘𝑗)(∀𝑛 ∈ 𝑦 𝜑 ∧ ∀𝑛 ∈ {𝑧}𝜑) ↔ (∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ≥‘𝑗)∀𝑛 ∈ 𝑦 𝜑 ∧ ∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ≥‘𝑗)∀𝑛 ∈ {𝑧}𝜑))
27		ralunb 4121	. . . . . . 7 ⊢ (∀𝑛 ∈ (𝑦 ∪ {𝑧})𝜑 ↔ (∀𝑛 ∈ 𝑦 𝜑 ∧ ∀𝑛 ∈ {𝑧}𝜑))
28	27	ralbii 3090	. . . . . 6 ⊢ (∀𝑘 ∈ (ℤ≥‘𝑗)∀𝑛 ∈ (𝑦 ∪ {𝑧})𝜑 ↔ ∀𝑘 ∈ (ℤ≥‘𝑗)(∀𝑛 ∈ 𝑦 𝜑 ∧ ∀𝑛 ∈ {𝑧}𝜑))
29	28	rexbii 3177	. . . . 5 ⊢ (∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ≥‘𝑗)∀𝑛 ∈ (𝑦 ∪ {𝑧})𝜑 ↔ ∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ≥‘𝑗)(∀𝑛 ∈ 𝑦 𝜑 ∧ ∀𝑛 ∈ {𝑧}𝜑))
30		ralsnsg 4601	. . . . . . . 8 ⊢ (𝑧 ∈ V → (∀𝑛 ∈ {𝑧}∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ≥‘𝑗)𝜑 ↔ [𝑧 / 𝑛]∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ≥‘𝑗)𝜑))
31		sbcrex 3804	. . . . . . . . 9 ⊢ ([𝑧 / 𝑛]∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ≥‘𝑗)𝜑 ↔ ∃𝑗 ∈ ℤ [𝑧 / 𝑛]∀𝑘 ∈ (ℤ≥‘𝑗)𝜑)
32		ralcom 3280	. . . . . . . . . . 11 ⊢ (∀𝑘 ∈ (ℤ≥‘𝑗)∀𝑛 ∈ {𝑧}𝜑 ↔ ∀𝑛 ∈ {𝑧}∀𝑘 ∈ (ℤ≥‘𝑗)𝜑)
33		ralsnsg 4601	. . . . . . . . . . 11 ⊢ (𝑧 ∈ V → (∀𝑛 ∈ {𝑧}∀𝑘 ∈ (ℤ≥‘𝑗)𝜑 ↔ [𝑧 / 𝑛]∀𝑘 ∈ (ℤ≥‘𝑗)𝜑))
34	32, 33	syl5bb 282	. . . . . . . . . 10 ⊢ (𝑧 ∈ V → (∀𝑘 ∈ (ℤ≥‘𝑗)∀𝑛 ∈ {𝑧}𝜑 ↔ [𝑧 / 𝑛]∀𝑘 ∈ (ℤ≥‘𝑗)𝜑))
35	34	rexbidv 3225	. . . . . . . . 9 ⊢ (𝑧 ∈ V → (∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ≥‘𝑗)∀𝑛 ∈ {𝑧}𝜑 ↔ ∃𝑗 ∈ ℤ [𝑧 / 𝑛]∀𝑘 ∈ (ℤ≥‘𝑗)𝜑))
36	31, 35	bitr4id 289	. . . . . . . 8 ⊢ (𝑧 ∈ V → ([𝑧 / 𝑛]∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ≥‘𝑗)𝜑 ↔ ∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ≥‘𝑗)∀𝑛 ∈ {𝑧}𝜑))
37	30, 36	bitrd 278	. . . . . . 7 ⊢ (𝑧 ∈ V → (∀𝑛 ∈ {𝑧}∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ≥‘𝑗)𝜑 ↔ ∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ≥‘𝑗)∀𝑛 ∈ {𝑧}𝜑))
38	37	elv 3428	. . . . . 6 ⊢ (∀𝑛 ∈ {𝑧}∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ≥‘𝑗)𝜑 ↔ ∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ≥‘𝑗)∀𝑛 ∈ {𝑧}𝜑)
39	38	anbi2i 622	. . . . 5 ⊢ ((∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ≥‘𝑗)∀𝑛 ∈ 𝑦 𝜑 ∧ ∀𝑛 ∈ {𝑧}∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ≥‘𝑗)𝜑) ↔ (∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ≥‘𝑗)∀𝑛 ∈ 𝑦 𝜑 ∧ ∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ≥‘𝑗)∀𝑛 ∈ {𝑧}𝜑))
40	26, 29, 39	3bitr4i 302	. . . 4 ⊢ (∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ≥‘𝑗)∀𝑛 ∈ (𝑦 ∪ {𝑧})𝜑 ↔ (∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ≥‘𝑗)∀𝑛 ∈ 𝑦 𝜑 ∧ ∀𝑛 ∈ {𝑧}∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ≥‘𝑗)𝜑))
41		ralunb 4121	. . . 4 ⊢ (∀𝑛 ∈ (𝑦 ∪ {𝑧})∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ≥‘𝑗)𝜑 ↔ (∀𝑛 ∈ 𝑦 ∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ≥‘𝑗)𝜑 ∧ ∀𝑛 ∈ {𝑧}∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ≥‘𝑗)𝜑))
42	25, 40, 41	3bitr4g 313	. . 3 ⊢ ((∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ≥‘𝑗)∀𝑛 ∈ 𝑦 𝜑 ↔ ∀𝑛 ∈ 𝑦 ∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ≥‘𝑗)𝜑) → (∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ≥‘𝑗)∀𝑛 ∈ (𝑦 ∪ {𝑧})𝜑 ↔ ∀𝑛 ∈ (𝑦 ∪ {𝑧})∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ≥‘𝑗)𝜑))
43	42	a1i 11	. 2 ⊢ (𝑦 ∈ Fin → ((∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ≥‘𝑗)∀𝑛 ∈ 𝑦 𝜑 ↔ ∀𝑛 ∈ 𝑦 ∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ≥‘𝑗)𝜑) → (∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ≥‘𝑗)∀𝑛 ∈ (𝑦 ∪ {𝑧})𝜑 ↔ ∀𝑛 ∈ (𝑦 ∪ {𝑧})∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ≥‘𝑗)𝜑)))
44	4, 8, 12, 16, 24, 43	findcard2 8909	1 ⊢ (𝐴 ∈ Fin → (∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ≥‘𝑗)∀𝑛 ∈ 𝐴 𝜑 ↔ ∀𝑛 ∈ 𝐴 ∃𝑗 ∈ ℤ ∀𝑘 ∈ (ℤ≥‘𝑗)𝜑))

Syntax hints:   → wi 4   ↔ wb 205   ∧ wa 395   = wceq 1539   ∈ wcel 2108   ≠ wne 2942  ∀wral 3063  ∃wrex 3064  Vcvv 3422  [wsbc 3711   ∪ cun 3881  ∅c0 4253  {csn 4558  ‘cfv 6418  Fincfn 8691  0cc0 10802  ℤcz 12249  ℤ_≥cuz 12511

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1799  ax-4 1813  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2110  ax-9 2118  ax-10 2139  ax-11 2156  ax-12 2173  ax-ext 2709  ax-sep 5218  ax-nul 5225  ax-pow 5283  ax-pr 5347  ax-un 7566  ax-cnex 10858  ax-resscn 10859  ax-1cn 10860  ax-addrcl 10863  ax-rnegex 10873  ax-cnre 10875  ax-pre-lttri 10876  ax-pre-lttrn 10877

This theorem depends on definitions:  df-bi 206  df-an 396  df-or 844  df-3or 1086  df-3an 1087  df-tru 1542  df-fal 1552  df-ex 1784  df-nf 1788  df-sb 2069  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2817  df-nfc 2888  df-ne 2943  df-nel 3049  df-ral 3068  df-rex 3069  df-reu 3070  df-rab 3072  df-v 3424  df-sbc 3712  df-csb 3829  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-pss 3902  df-nul 4254  df-if 4457  df-pw 4532  df-sn 4559  df-pr 4561  df-tp 4563  df-op 4565  df-uni 4837  df-br 5071  df-opab 5133  df-mpt 5154  df-tr 5188  df-id 5480  df-eprel 5486  df-po 5494  df-so 5495  df-fr 5535  df-we 5537  df-xp 5586  df-rel 5587  df-cnv 5588  df-co 5589  df-dm 5590  df-rn 5591  df-res 5592  df-ima 5593  df-ord 6254  df-on 6255  df-lim 6256  df-suc 6257  df-iota 6376  df-fun 6420  df-fn 6421  df-f 6422  df-f1 6423  df-fo 6424  df-f1o 6425  df-fv 6426  df-ov 7258  df-om 7688  df-er 8456  df-en 8692  df-dom 8693  df-sdom 8694  df-fin 8695  df-pnf 10942  df-mnf 10943  df-xr 10944  df-ltxr 10945  df-le 10946  df-neg 11138  df-z 12250  df-uz 12512

This theorem is referenced by:  uniioombllem6  24657  rrncmslem  35917