Theorem rexanuz2nf 45443

Description: A simple counterexample related to theorem rexanuz2 15385, demonstrating the necessity of its disjoint variable constraints. Here, 𝑗 appears free in 𝜑, showing that without these constraints, rexanuz2 15385 and similar theorems would not hold (see rexanre 15382 and rexanuz 15381). (Contributed by Glauco Siliprandi, 15-Feb-2025.)

Hypotheses

Ref	Expression
rexanuz2nf.1	⊢ 𝑍 = ℕ0
rexanuz2nf.2	⊢ (𝜑 ↔ (𝑗 = 0 ∧ 𝑗 ≤ 𝑘))
rexanuz2nf.3	⊢ (𝜓 ↔ 0 < 𝑘)

Assertion

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

Distinct variable group:   𝑗,𝑘

Allowed substitution hints:   𝜑(𝑗,𝑘)   𝜓(𝑗,𝑘)   𝑍(𝑗,𝑘)

Proof of Theorem rexanuz2nf

Step	Hyp	Ref	Expression
1		0nn0 12539	. . . . . . . 8 ⊢ 0 ∈ ℕ0
2		nn0ge0 12549	. . . . . . . . 9 ⊢ (𝑘 ∈ ℕ0 → 0 ≤ 𝑘)
3	2	rgen 3061	. . . . . . . 8 ⊢ ∀𝑘 ∈ ℕ0 0 ≤ 𝑘
4		fveq2 6907	. . . . . . . . . . . 12 ⊢ (𝑗 = 0 → (ℤ≥‘𝑗) = (ℤ≥‘0))
5		nn0uz 12918	. . . . . . . . . . . 12 ⊢ ℕ0 = (ℤ≥‘0)
6	4, 5	eqtr4di 2793	. . . . . . . . . . 11 ⊢ (𝑗 = 0 → (ℤ≥‘𝑗) = ℕ0)
7	6	raleqdv 3324	. . . . . . . . . 10 ⊢ (𝑗 = 0 → (∀𝑘 ∈ (ℤ≥‘𝑗)(𝑗 = 0 ∧ 𝑗 ≤ 𝑘) ↔ ∀𝑘 ∈ ℕ0 (𝑗 = 0 ∧ 𝑗 ≤ 𝑘)))
8	2	ad2antlr 727	. . . . . . . . . . . 12 ⊢ (((𝑗 = 0 ∧ 𝑘 ∈ ℕ0) ∧ (𝑗 = 0 ∧ 𝑗 ≤ 𝑘)) → 0 ≤ 𝑘)
9		simpll 767	. . . . . . . . . . . . 13 ⊢ (((𝑗 = 0 ∧ 𝑘 ∈ ℕ0) ∧ 0 ≤ 𝑘) → 𝑗 = 0)
10		simpr 484	. . . . . . . . . . . . . 14 ⊢ (((𝑗 = 0 ∧ 𝑘 ∈ ℕ0) ∧ 0 ≤ 𝑘) → 0 ≤ 𝑘)
11	9, 10	eqbrtrd 5170	. . . . . . . . . . . . 13 ⊢ (((𝑗 = 0 ∧ 𝑘 ∈ ℕ0) ∧ 0 ≤ 𝑘) → 𝑗 ≤ 𝑘)
12	9, 11	jca 511	. . . . . . . . . . . 12 ⊢ (((𝑗 = 0 ∧ 𝑘 ∈ ℕ0) ∧ 0 ≤ 𝑘) → (𝑗 = 0 ∧ 𝑗 ≤ 𝑘))
13	8, 12	impbida 801	. . . . . . . . . . 11 ⊢ ((𝑗 = 0 ∧ 𝑘 ∈ ℕ0) → ((𝑗 = 0 ∧ 𝑗 ≤ 𝑘) ↔ 0 ≤ 𝑘))
14	13	ralbidva 3174	. . . . . . . . . 10 ⊢ (𝑗 = 0 → (∀𝑘 ∈ ℕ0 (𝑗 = 0 ∧ 𝑗 ≤ 𝑘) ↔ ∀𝑘 ∈ ℕ0 0 ≤ 𝑘))
15	7, 14	bitrd 279	. . . . . . . . 9 ⊢ (𝑗 = 0 → (∀𝑘 ∈ (ℤ≥‘𝑗)(𝑗 = 0 ∧ 𝑗 ≤ 𝑘) ↔ ∀𝑘 ∈ ℕ0 0 ≤ 𝑘))
16	15	rspcev 3622	. . . . . . . 8 ⊢ ((0 ∈ ℕ0 ∧ ∀𝑘 ∈ ℕ0 0 ≤ 𝑘) → ∃𝑗 ∈ ℕ0 ∀𝑘 ∈ (ℤ≥‘𝑗)(𝑗 = 0 ∧ 𝑗 ≤ 𝑘))
17	1, 3, 16	mp2an 692	. . . . . . 7 ⊢ ∃𝑗 ∈ ℕ0 ∀𝑘 ∈ (ℤ≥‘𝑗)(𝑗 = 0 ∧ 𝑗 ≤ 𝑘)
18		rexanuz2nf.1	. . . . . . . . 9 ⊢ 𝑍 = ℕ0
19		nfcv 2903	. . . . . . . . 9 ⊢ Ⅎ𝑗ℕ0
20	18, 19	nfcxfr 2901	. . . . . . . 8 ⊢ Ⅎ𝑗𝑍
21	20, 19, 18	rexeqif 45109	. . . . . . 7 ⊢ (∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑗)(𝑗 = 0 ∧ 𝑗 ≤ 𝑘) ↔ ∃𝑗 ∈ ℕ0 ∀𝑘 ∈ (ℤ≥‘𝑗)(𝑗 = 0 ∧ 𝑗 ≤ 𝑘))
22	17, 21	mpbir 231	. . . . . 6 ⊢ ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑗)(𝑗 = 0 ∧ 𝑗 ≤ 𝑘)
23		rexanuz2nf.2	. . . . . . . 8 ⊢ (𝜑 ↔ (𝑗 = 0 ∧ 𝑗 ≤ 𝑘))
24	23	ralbii 3091	. . . . . . 7 ⊢ (∀𝑘 ∈ (ℤ≥‘𝑗)𝜑 ↔ ∀𝑘 ∈ (ℤ≥‘𝑗)(𝑗 = 0 ∧ 𝑗 ≤ 𝑘))
25	24	rexbii 3092	. . . . . 6 ⊢ (∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑗)𝜑 ↔ ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑗)(𝑗 = 0 ∧ 𝑗 ≤ 𝑘))
26	22, 25	mpbir 231	. . . . 5 ⊢ ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑗)𝜑
27		1nn0 12540	. . . . . . . 8 ⊢ 1 ∈ ℕ0
28		nngt0 12295	. . . . . . . . 9 ⊢ (𝑘 ∈ ℕ → 0 < 𝑘)
29	28	rgen 3061	. . . . . . . 8 ⊢ ∀𝑘 ∈ ℕ 0 < 𝑘
30		fveq2 6907	. . . . . . . . . . 11 ⊢ (𝑗 = 1 → (ℤ≥‘𝑗) = (ℤ≥‘1))
31		nnuz 12919	. . . . . . . . . . 11 ⊢ ℕ = (ℤ≥‘1)
32	30, 31	eqtr4di 2793	. . . . . . . . . 10 ⊢ (𝑗 = 1 → (ℤ≥‘𝑗) = ℕ)
33	32	raleqdv 3324	. . . . . . . . 9 ⊢ (𝑗 = 1 → (∀𝑘 ∈ (ℤ≥‘𝑗)0 < 𝑘 ↔ ∀𝑘 ∈ ℕ 0 < 𝑘))
34	33	rspcev 3622	. . . . . . . 8 ⊢ ((1 ∈ ℕ0 ∧ ∀𝑘 ∈ ℕ 0 < 𝑘) → ∃𝑗 ∈ ℕ0 ∀𝑘 ∈ (ℤ≥‘𝑗)0 < 𝑘)
35	27, 29, 34	mp2an 692	. . . . . . 7 ⊢ ∃𝑗 ∈ ℕ0 ∀𝑘 ∈ (ℤ≥‘𝑗)0 < 𝑘
36	20, 19, 18	rexeqif 45109	. . . . . . 7 ⊢ (∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑗)0 < 𝑘 ↔ ∃𝑗 ∈ ℕ0 ∀𝑘 ∈ (ℤ≥‘𝑗)0 < 𝑘)
37	35, 36	mpbir 231	. . . . . 6 ⊢ ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑗)0 < 𝑘
38		rexanuz2nf.3	. . . . . . . 8 ⊢ (𝜓 ↔ 0 < 𝑘)
39	38	ralbii 3091	. . . . . . 7 ⊢ (∀𝑘 ∈ (ℤ≥‘𝑗)𝜓 ↔ ∀𝑘 ∈ (ℤ≥‘𝑗)0 < 𝑘)
40	39	rexbii 3092	. . . . . 6 ⊢ (∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑗)𝜓 ↔ ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑗)0 < 𝑘)
41	37, 40	mpbir 231	. . . . 5 ⊢ ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑗)𝜓
42	26, 41	pm3.2i 470	. . . 4 ⊢ (∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑗)𝜑 ∧ ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑗)𝜓)
43		nfv 1912	. . . . . . . . 9 ⊢ Ⅎ𝑘 ¬ ((𝑗 = 0 ∧ 𝑗 ≤ 𝑗) ∧ 0 < 𝑗)
44		nfcv 2903	. . . . . . . . 9 ⊢ Ⅎ𝑘𝑗
45		nfcv 2903	. . . . . . . . 9 ⊢ Ⅎ𝑘(ℤ≥‘𝑗)
46	5	uzid3 45385	. . . . . . . . . 10 ⊢ (𝑗 ∈ ℕ0 → 𝑗 ∈ (ℤ≥‘𝑗))
47	46	adantr 480	. . . . . . . . 9 ⊢ ((𝑗 ∈ ℕ0 ∧ 𝑗 = 0) → 𝑗 ∈ (ℤ≥‘𝑗))
48		0re 11261	. . . . . . . . . . . . . 14 ⊢ 0 ∈ ℝ
49	48	ltnri 11368	. . . . . . . . . . . . 13 ⊢ ¬ 0 < 0
50	49	a1i 11	. . . . . . . . . . . 12 ⊢ (𝑗 = 0 → ¬ 0 < 0)
51		eqcom 2742	. . . . . . . . . . . . 13 ⊢ (𝑗 = 0 ↔ 0 = 𝑗)
52	51	biimpi 216	. . . . . . . . . . . 12 ⊢ (𝑗 = 0 → 0 = 𝑗)
53	50, 52	brneqtrd 45016	. . . . . . . . . . 11 ⊢ (𝑗 = 0 → ¬ 0 < 𝑗)
54	53	intnand 488	. . . . . . . . . 10 ⊢ (𝑗 = 0 → ¬ ((𝑗 = 0 ∧ 𝑗 ≤ 𝑗) ∧ 0 < 𝑗))
55	54	adantl 481	. . . . . . . . 9 ⊢ ((𝑗 ∈ ℕ0 ∧ 𝑗 = 0) → ¬ ((𝑗 = 0 ∧ 𝑗 ≤ 𝑗) ∧ 0 < 𝑗))
56		breq2 5152	. . . . . . . . . . . . 13 ⊢ (𝑘 = 𝑗 → (𝑗 ≤ 𝑘 ↔ 𝑗 ≤ 𝑗))
57	56	anbi2d 630	. . . . . . . . . . . 12 ⊢ (𝑘 = 𝑗 → ((𝑗 = 0 ∧ 𝑗 ≤ 𝑘) ↔ (𝑗 = 0 ∧ 𝑗 ≤ 𝑗)))
58	23, 57	bitrid 283	. . . . . . . . . . 11 ⊢ (𝑘 = 𝑗 → (𝜑 ↔ (𝑗 = 0 ∧ 𝑗 ≤ 𝑗)))
59		breq2 5152	. . . . . . . . . . . 12 ⊢ (𝑘 = 𝑗 → (0 < 𝑘 ↔ 0 < 𝑗))
60	38, 59	bitrid 283	. . . . . . . . . . 11 ⊢ (𝑘 = 𝑗 → (𝜓 ↔ 0 < 𝑗))
61	58, 60	anbi12d 632	. . . . . . . . . 10 ⊢ (𝑘 = 𝑗 → ((𝜑 ∧ 𝜓) ↔ ((𝑗 = 0 ∧ 𝑗 ≤ 𝑗) ∧ 0 < 𝑗)))
62	61	notbid 318	. . . . . . . . 9 ⊢ (𝑘 = 𝑗 → (¬ (𝜑 ∧ 𝜓) ↔ ¬ ((𝑗 = 0 ∧ 𝑗 ≤ 𝑗) ∧ 0 < 𝑗)))
63	43, 44, 45, 47, 55, 62	rspced 45110	. . . . . . . 8 ⊢ ((𝑗 ∈ ℕ0 ∧ 𝑗 = 0) → ∃𝑘 ∈ (ℤ≥‘𝑗) ¬ (𝜑 ∧ 𝜓))
64	46	adantr 480	. . . . . . . . 9 ⊢ ((𝑗 ∈ ℕ0 ∧ ¬ 𝑗 = 0) → 𝑗 ∈ (ℤ≥‘𝑗))
65		id 22	. . . . . . . . . . . 12 ⊢ (¬ 𝑗 = 0 → ¬ 𝑗 = 0)
66	65	intnanrd 489	. . . . . . . . . . 11 ⊢ (¬ 𝑗 = 0 → ¬ (𝑗 = 0 ∧ 𝑗 ≤ 𝑗))
67	66	intnanrd 489	. . . . . . . . . 10 ⊢ (¬ 𝑗 = 0 → ¬ ((𝑗 = 0 ∧ 𝑗 ≤ 𝑗) ∧ 0 < 𝑗))
68	67	adantl 481	. . . . . . . . 9 ⊢ ((𝑗 ∈ ℕ0 ∧ ¬ 𝑗 = 0) → ¬ ((𝑗 = 0 ∧ 𝑗 ≤ 𝑗) ∧ 0 < 𝑗))
69	43, 44, 45, 64, 68, 62	rspced 45110	. . . . . . . 8 ⊢ ((𝑗 ∈ ℕ0 ∧ ¬ 𝑗 = 0) → ∃𝑘 ∈ (ℤ≥‘𝑗) ¬ (𝜑 ∧ 𝜓))
70	63, 69	pm2.61dan 813	. . . . . . 7 ⊢ (𝑗 ∈ ℕ0 → ∃𝑘 ∈ (ℤ≥‘𝑗) ¬ (𝜑 ∧ 𝜓))
71		rexnal 3098	. . . . . . 7 ⊢ (∃𝑘 ∈ (ℤ≥‘𝑗) ¬ (𝜑 ∧ 𝜓) ↔ ¬ ∀𝑘 ∈ (ℤ≥‘𝑗)(𝜑 ∧ 𝜓))
72	70, 71	sylib 218	. . . . . 6 ⊢ (𝑗 ∈ ℕ0 → ¬ ∀𝑘 ∈ (ℤ≥‘𝑗)(𝜑 ∧ 𝜓))
73	72	nrex 3072	. . . . 5 ⊢ ¬ ∃𝑗 ∈ ℕ0 ∀𝑘 ∈ (ℤ≥‘𝑗)(𝜑 ∧ 𝜓)
74	20, 19, 18	rexeqif 45109	. . . . 5 ⊢ (∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑗)(𝜑 ∧ 𝜓) ↔ ∃𝑗 ∈ ℕ0 ∀𝑘 ∈ (ℤ≥‘𝑗)(𝜑 ∧ 𝜓))
75	73, 74	mtbir 323	. . . 4 ⊢ ¬ ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑗)(𝜑 ∧ 𝜓)
76	42, 75	pm3.2i 470	. . 3 ⊢ ((∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑗)𝜑 ∧ ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑗)𝜓) ∧ ¬ ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑗)(𝜑 ∧ 𝜓))
77		annim 403	. . 3 ⊢ (((∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑗)𝜑 ∧ ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑗)𝜓) ∧ ¬ ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑗)(𝜑 ∧ 𝜓)) ↔ ¬ ((∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑗)𝜑 ∧ ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑗)𝜓) → ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑗)(𝜑 ∧ 𝜓)))
78	76, 77	mpbi 230	. 2 ⊢ ¬ ((∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑗)𝜑 ∧ ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑗)𝜓) → ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑗)(𝜑 ∧ 𝜓))
79	78	nimnbi2 45107	1 ⊢ ¬ (∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑗)(𝜑 ∧ 𝜓) ↔ (∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑗)𝜑 ∧ ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ≥‘𝑗)𝜓))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 206   ∧ wa 395   = wceq 1537   ∈ wcel 2106  ∀wral 3059  ∃wrex 3068   class class class wbr 5148  ‘cfv 6563  0cc0 11153  1c1 11154   < clt 11293   ≤ cle 11294  ℕcn 12264  ℕ₀cn0 12524  ℤ_≥cuz 12876

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-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

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-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-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-pnf 11295  df-mnf 11296  df-xr 11297  df-ltxr 11298  df-le 11299  df-sub 11492  df-neg 11493  df-nn 12265  df-n0 12525  df-z 12612  df-uz 12877

This theorem is referenced by: (None)