Theorem iuneqfzuzlem 42763

Description: Lemma for iuneqfzuz 42764: here, inclusion is proven; aiuneqfzuz uses this lemma twice, to prove equality. (Contributed by Glauco Siliprandi, 17-Aug-2020.)

Hypothesis

Ref	Expression
iuneqfzuzlem.z	⊢ 𝑍 = (ℤ≥‘𝑁)

Assertion

Ref	Expression
iuneqfzuzlem	⊢ (∀𝑚 ∈ 𝑍 ∪ 𝑛 ∈ (𝑁...𝑚)𝐴 = ∪ 𝑛 ∈ (𝑁...𝑚)𝐵 → ∪ 𝑛 ∈ 𝑍 𝐴 ⊆ ∪ 𝑛 ∈ 𝑍 𝐵)

Distinct variable groups:   𝐴,𝑚   𝐵,𝑚   𝑛,𝑁   𝑚,𝑍,𝑛

Allowed substitution hints:   𝐴(𝑛)   𝐵(𝑛)   𝑁(𝑚)

Proof of Theorem iuneqfzuzlem

Dummy variable 𝑥 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		nfcv 2906	. . . . . . . . 9 ⊢ Ⅎ𝑚𝐴
2		nfcsb1v 3853	. . . . . . . . 9 ⊢ Ⅎ𝑛⦋𝑚 / 𝑛⦌𝐴
3		csbeq1a 3842	. . . . . . . . 9 ⊢ (𝑛 = 𝑚 → 𝐴 = ⦋𝑚 / 𝑛⦌𝐴)
4	1, 2, 3	cbviun 4962	. . . . . . . 8 ⊢ ∪ 𝑛 ∈ 𝑍 𝐴 = ∪ 𝑚 ∈ 𝑍 ⦋𝑚 / 𝑛⦌𝐴
5	4	eleq2i 2830	. . . . . . 7 ⊢ (𝑥 ∈ ∪ 𝑛 ∈ 𝑍 𝐴 ↔ 𝑥 ∈ ∪ 𝑚 ∈ 𝑍 ⦋𝑚 / 𝑛⦌𝐴)
6		eliun 4925	. . . . . . 7 ⊢ (𝑥 ∈ ∪ 𝑚 ∈ 𝑍 ⦋𝑚 / 𝑛⦌𝐴 ↔ ∃𝑚 ∈ 𝑍 𝑥 ∈ ⦋𝑚 / 𝑛⦌𝐴)
7	5, 6	bitri 274	. . . . . 6 ⊢ (𝑥 ∈ ∪ 𝑛 ∈ 𝑍 𝐴 ↔ ∃𝑚 ∈ 𝑍 𝑥 ∈ ⦋𝑚 / 𝑛⦌𝐴)
8	7	biimpi 215	. . . . 5 ⊢ (𝑥 ∈ ∪ 𝑛 ∈ 𝑍 𝐴 → ∃𝑚 ∈ 𝑍 𝑥 ∈ ⦋𝑚 / 𝑛⦌𝐴)
9	8	adantl 481	. . . 4 ⊢ ((∀𝑚 ∈ 𝑍 ∪ 𝑛 ∈ (𝑁...𝑚)𝐴 = ∪ 𝑛 ∈ (𝑁...𝑚)𝐵 ∧ 𝑥 ∈ ∪ 𝑛 ∈ 𝑍 𝐴) → ∃𝑚 ∈ 𝑍 𝑥 ∈ ⦋𝑚 / 𝑛⦌𝐴)
10		nfra1 3142	. . . . . 6 ⊢ Ⅎ𝑚∀𝑚 ∈ 𝑍 ∪ 𝑛 ∈ (𝑁...𝑚)𝐴 = ∪ 𝑛 ∈ (𝑁...𝑚)𝐵
11		nfv 1918	. . . . . 6 ⊢ Ⅎ𝑚 𝑥 ∈ ∪ 𝑛 ∈ 𝑍 𝐵
12		simp2 1135	. . . . . . . 8 ⊢ ((∀𝑚 ∈ 𝑍 ∪ 𝑛 ∈ (𝑁...𝑚)𝐴 = ∪ 𝑛 ∈ (𝑁...𝑚)𝐵 ∧ 𝑚 ∈ 𝑍 ∧ 𝑥 ∈ ⦋𝑚 / 𝑛⦌𝐴) → 𝑚 ∈ 𝑍)
13		rspa 3130	. . . . . . . . 9 ⊢ ((∀𝑚 ∈ 𝑍 ∪ 𝑛 ∈ (𝑁...𝑚)𝐴 = ∪ 𝑛 ∈ (𝑁...𝑚)𝐵 ∧ 𝑚 ∈ 𝑍) → ∪ 𝑛 ∈ (𝑁...𝑚)𝐴 = ∪ 𝑛 ∈ (𝑁...𝑚)𝐵)
14	13	3adant3 1130	. . . . . . . 8 ⊢ ((∀𝑚 ∈ 𝑍 ∪ 𝑛 ∈ (𝑁...𝑚)𝐴 = ∪ 𝑛 ∈ (𝑁...𝑚)𝐵 ∧ 𝑚 ∈ 𝑍 ∧ 𝑥 ∈ ⦋𝑚 / 𝑛⦌𝐴) → ∪ 𝑛 ∈ (𝑁...𝑚)𝐴 = ∪ 𝑛 ∈ (𝑁...𝑚)𝐵)
15		simp3 1136	. . . . . . . 8 ⊢ ((∀𝑚 ∈ 𝑍 ∪ 𝑛 ∈ (𝑁...𝑚)𝐴 = ∪ 𝑛 ∈ (𝑁...𝑚)𝐵 ∧ 𝑚 ∈ 𝑍 ∧ 𝑥 ∈ ⦋𝑚 / 𝑛⦌𝐴) → 𝑥 ∈ ⦋𝑚 / 𝑛⦌𝐴)
16		id 22	. . . . . . . . . . 11 ⊢ (∪ 𝑛 ∈ (𝑁...𝑚)𝐴 = ∪ 𝑛 ∈ (𝑁...𝑚)𝐵 → ∪ 𝑛 ∈ (𝑁...𝑚)𝐴 = ∪ 𝑛 ∈ (𝑁...𝑚)𝐵)
17		fzssuz 13226	. . . . . . . . . . . . 13 ⊢ (𝑁...𝑚) ⊆ (ℤ≥‘𝑁)
18		iuneqfzuzlem.z	. . . . . . . . . . . . . 14 ⊢ 𝑍 = (ℤ≥‘𝑁)
19	18	eqcomi 2747	. . . . . . . . . . . . 13 ⊢ (ℤ≥‘𝑁) = 𝑍
20	17, 19	sseqtri 3953	. . . . . . . . . . . 12 ⊢ (𝑁...𝑚) ⊆ 𝑍
21		iunss1 4935	. . . . . . . . . . . 12 ⊢ ((𝑁...𝑚) ⊆ 𝑍 → ∪ 𝑛 ∈ (𝑁...𝑚)𝐵 ⊆ ∪ 𝑛 ∈ 𝑍 𝐵)
22	20, 21	mp1i 13	. . . . . . . . . . 11 ⊢ (∪ 𝑛 ∈ (𝑁...𝑚)𝐴 = ∪ 𝑛 ∈ (𝑁...𝑚)𝐵 → ∪ 𝑛 ∈ (𝑁...𝑚)𝐵 ⊆ ∪ 𝑛 ∈ 𝑍 𝐵)
23	16, 22	eqsstrd 3955	. . . . . . . . . 10 ⊢ (∪ 𝑛 ∈ (𝑁...𝑚)𝐴 = ∪ 𝑛 ∈ (𝑁...𝑚)𝐵 → ∪ 𝑛 ∈ (𝑁...𝑚)𝐴 ⊆ ∪ 𝑛 ∈ 𝑍 𝐵)
24	23	3ad2ant2 1132	. . . . . . . . 9 ⊢ ((𝑚 ∈ 𝑍 ∧ ∪ 𝑛 ∈ (𝑁...𝑚)𝐴 = ∪ 𝑛 ∈ (𝑁...𝑚)𝐵 ∧ 𝑥 ∈ ⦋𝑚 / 𝑛⦌𝐴) → ∪ 𝑛 ∈ (𝑁...𝑚)𝐴 ⊆ ∪ 𝑛 ∈ 𝑍 𝐵)
25	18	eleq2i 2830	. . . . . . . . . . . . . . 15 ⊢ (𝑚 ∈ 𝑍 ↔ 𝑚 ∈ (ℤ≥‘𝑁))
26	25	biimpi 215	. . . . . . . . . . . . . 14 ⊢ (𝑚 ∈ 𝑍 → 𝑚 ∈ (ℤ≥‘𝑁))
27		eluzel2 12516	. . . . . . . . . . . . . 14 ⊢ (𝑚 ∈ (ℤ≥‘𝑁) → 𝑁 ∈ ℤ)
28	26, 27	syl 17	. . . . . . . . . . . . 13 ⊢ (𝑚 ∈ 𝑍 → 𝑁 ∈ ℤ)
29		eluzelz 12521	. . . . . . . . . . . . . 14 ⊢ (𝑚 ∈ (ℤ≥‘𝑁) → 𝑚 ∈ ℤ)
30	26, 29	syl 17	. . . . . . . . . . . . 13 ⊢ (𝑚 ∈ 𝑍 → 𝑚 ∈ ℤ)
31		eluzle 12524	. . . . . . . . . . . . . 14 ⊢ (𝑚 ∈ (ℤ≥‘𝑁) → 𝑁 ≤ 𝑚)
32	26, 31	syl 17	. . . . . . . . . . . . 13 ⊢ (𝑚 ∈ 𝑍 → 𝑁 ≤ 𝑚)
33	30	zred 12355	. . . . . . . . . . . . . 14 ⊢ (𝑚 ∈ 𝑍 → 𝑚 ∈ ℝ)
34		leid 11001	. . . . . . . . . . . . . 14 ⊢ (𝑚 ∈ ℝ → 𝑚 ≤ 𝑚)
35	33, 34	syl 17	. . . . . . . . . . . . 13 ⊢ (𝑚 ∈ 𝑍 → 𝑚 ≤ 𝑚)
36	28, 30, 30, 32, 35	elfzd 13176	. . . . . . . . . . . 12 ⊢ (𝑚 ∈ 𝑍 → 𝑚 ∈ (𝑁...𝑚))
37		nfcv 2906	. . . . . . . . . . . . . 14 ⊢ Ⅎ𝑛𝑥
38	37, 2	nfel 2920	. . . . . . . . . . . . 13 ⊢ Ⅎ𝑛 𝑥 ∈ ⦋𝑚 / 𝑛⦌𝐴
39	3	eleq2d 2824	. . . . . . . . . . . . 13 ⊢ (𝑛 = 𝑚 → (𝑥 ∈ 𝐴 ↔ 𝑥 ∈ ⦋𝑚 / 𝑛⦌𝐴))
40	38, 39	rspce 3540	. . . . . . . . . . . 12 ⊢ ((𝑚 ∈ (𝑁...𝑚) ∧ 𝑥 ∈ ⦋𝑚 / 𝑛⦌𝐴) → ∃𝑛 ∈ (𝑁...𝑚)𝑥 ∈ 𝐴)
41	36, 40	sylan 579	. . . . . . . . . . 11 ⊢ ((𝑚 ∈ 𝑍 ∧ 𝑥 ∈ ⦋𝑚 / 𝑛⦌𝐴) → ∃𝑛 ∈ (𝑁...𝑚)𝑥 ∈ 𝐴)
42		eliun 4925	. . . . . . . . . . 11 ⊢ (𝑥 ∈ ∪ 𝑛 ∈ (𝑁...𝑚)𝐴 ↔ ∃𝑛 ∈ (𝑁...𝑚)𝑥 ∈ 𝐴)
43	41, 42	sylibr 233	. . . . . . . . . 10 ⊢ ((𝑚 ∈ 𝑍 ∧ 𝑥 ∈ ⦋𝑚 / 𝑛⦌𝐴) → 𝑥 ∈ ∪ 𝑛 ∈ (𝑁...𝑚)𝐴)
44	43	3adant2 1129	. . . . . . . . 9 ⊢ ((𝑚 ∈ 𝑍 ∧ ∪ 𝑛 ∈ (𝑁...𝑚)𝐴 = ∪ 𝑛 ∈ (𝑁...𝑚)𝐵 ∧ 𝑥 ∈ ⦋𝑚 / 𝑛⦌𝐴) → 𝑥 ∈ ∪ 𝑛 ∈ (𝑁...𝑚)𝐴)
45	24, 44	sseldd 3918	. . . . . . . 8 ⊢ ((𝑚 ∈ 𝑍 ∧ ∪ 𝑛 ∈ (𝑁...𝑚)𝐴 = ∪ 𝑛 ∈ (𝑁...𝑚)𝐵 ∧ 𝑥 ∈ ⦋𝑚 / 𝑛⦌𝐴) → 𝑥 ∈ ∪ 𝑛 ∈ 𝑍 𝐵)
46	12, 14, 15, 45	syl3anc 1369	. . . . . . 7 ⊢ ((∀𝑚 ∈ 𝑍 ∪ 𝑛 ∈ (𝑁...𝑚)𝐴 = ∪ 𝑛 ∈ (𝑁...𝑚)𝐵 ∧ 𝑚 ∈ 𝑍 ∧ 𝑥 ∈ ⦋𝑚 / 𝑛⦌𝐴) → 𝑥 ∈ ∪ 𝑛 ∈ 𝑍 𝐵)
47	46	3exp 1117	. . . . . 6 ⊢ (∀𝑚 ∈ 𝑍 ∪ 𝑛 ∈ (𝑁...𝑚)𝐴 = ∪ 𝑛 ∈ (𝑁...𝑚)𝐵 → (𝑚 ∈ 𝑍 → (𝑥 ∈ ⦋𝑚 / 𝑛⦌𝐴 → 𝑥 ∈ ∪ 𝑛 ∈ 𝑍 𝐵)))
48	10, 11, 47	rexlimd 3245	. . . . 5 ⊢ (∀𝑚 ∈ 𝑍 ∪ 𝑛 ∈ (𝑁...𝑚)𝐴 = ∪ 𝑛 ∈ (𝑁...𝑚)𝐵 → (∃𝑚 ∈ 𝑍 𝑥 ∈ ⦋𝑚 / 𝑛⦌𝐴 → 𝑥 ∈ ∪ 𝑛 ∈ 𝑍 𝐵))
49	48	adantr 480	. . . 4 ⊢ ((∀𝑚 ∈ 𝑍 ∪ 𝑛 ∈ (𝑁...𝑚)𝐴 = ∪ 𝑛 ∈ (𝑁...𝑚)𝐵 ∧ 𝑥 ∈ ∪ 𝑛 ∈ 𝑍 𝐴) → (∃𝑚 ∈ 𝑍 𝑥 ∈ ⦋𝑚 / 𝑛⦌𝐴 → 𝑥 ∈ ∪ 𝑛 ∈ 𝑍 𝐵))
50	9, 49	mpd 15	. . 3 ⊢ ((∀𝑚 ∈ 𝑍 ∪ 𝑛 ∈ (𝑁...𝑚)𝐴 = ∪ 𝑛 ∈ (𝑁...𝑚)𝐵 ∧ 𝑥 ∈ ∪ 𝑛 ∈ 𝑍 𝐴) → 𝑥 ∈ ∪ 𝑛 ∈ 𝑍 𝐵)
51	50	ralrimiva 3107	. 2 ⊢ (∀𝑚 ∈ 𝑍 ∪ 𝑛 ∈ (𝑁...𝑚)𝐴 = ∪ 𝑛 ∈ (𝑁...𝑚)𝐵 → ∀𝑥 ∈ ∪ 𝑛 ∈ 𝑍 𝐴𝑥 ∈ ∪ 𝑛 ∈ 𝑍 𝐵)
52		dfss3 3905	. 2 ⊢ (∪ 𝑛 ∈ 𝑍 𝐴 ⊆ ∪ 𝑛 ∈ 𝑍 𝐵 ↔ ∀𝑥 ∈ ∪ 𝑛 ∈ 𝑍 𝐴𝑥 ∈ ∪ 𝑛 ∈ 𝑍 𝐵)
53	51, 52	sylibr 233	1 ⊢ (∀𝑚 ∈ 𝑍 ∪ 𝑛 ∈ (𝑁...𝑚)𝐴 = ∪ 𝑛 ∈ (𝑁...𝑚)𝐵 → ∪ 𝑛 ∈ 𝑍 𝐴 ⊆ ∪ 𝑛 ∈ 𝑍 𝐵)

Syntax hints:   → wi 4   ∧ wa 395   ∧ w3a 1085   = wceq 1539   ∈ wcel 2108  ∀wral 3063  ∃wrex 3064  ⦋csb 3828   ⊆ wss 3883  ∪ ciun 4921   class class class wbr 5070  ‘cfv 6418  (class class class)co 7255  ℝcr 10801   ≤ cle 10941  ℤcz 12249  ℤ_≥cuz 12511  ...cfz 13168

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-pre-lttri 10876

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-rab 3072  df-v 3424  df-sbc 3712  df-csb 3829  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-nul 4254  df-if 4457  df-pw 4532  df-sn 4559  df-pr 4561  df-op 4565  df-uni 4837  df-iun 4923  df-br 5071  df-opab 5133  df-mpt 5154  df-id 5480  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-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-oprab 7259  df-mpo 7260  df-1st 7804  df-2nd 7805  df-er 8456  df-en 8692  df-dom 8693  df-sdom 8694  df-pnf 10942  df-mnf 10943  df-xr 10944  df-ltxr 10945  df-le 10946  df-neg 11138  df-z 12250  df-uz 12512  df-fz 13169

This theorem is referenced by:  iuneqfzuz  42764