Theorem iuneqfzuzlem 46549

Description: Lemma for iuneqfzuz 46550: 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 2926	. . . . . . . 8 ⊢ Ⅎ𝑚𝐴
2		nfcsb1v 3875	. . . . . . . 8 ⊢ Ⅎ𝑛⦋𝑚 / 𝑛⦌𝐴
3		csbeq1a 3865	. . . . . . . 8 ⊢ (𝑛 = 𝑚 → 𝐴 = ⦋𝑚 / 𝑛⦌𝐴)
4	1, 2, 3	cbviun 4996	. . . . . . 7 ⊢ ∪ 𝑛 ∈ 𝑍 𝐴 = ∪ 𝑚 ∈ 𝑍 ⦋𝑚 / 𝑛⦌𝐴
5	4	eleq2i 2856	. . . . . 6 ⊢ (𝑥 ∈ ∪ 𝑛 ∈ 𝑍 𝐴 ↔ 𝑥 ∈ ∪ 𝑚 ∈ 𝑍 ⦋𝑚 / 𝑛⦌𝐴)
6		eliun 4958	. . . . . 6 ⊢ (𝑥 ∈ ∪ 𝑚 ∈ 𝑍 ⦋𝑚 / 𝑛⦌𝐴 ↔ ∃𝑚 ∈ 𝑍 𝑥 ∈ ⦋𝑚 / 𝑛⦌𝐴)
7	5, 6	bitri 278	. . . . 5 ⊢ (𝑥 ∈ ∪ 𝑛 ∈ 𝑍 𝐴 ↔ ∃𝑚 ∈ 𝑍 𝑥 ∈ ⦋𝑚 / 𝑛⦌𝐴)
8	7	bilani 510	. . . 4 ⊢ ((∀𝑚 ∈ 𝑍 ∪ 𝑛 ∈ (𝑁...𝑚)𝐴 = ∪ 𝑛 ∈ (𝑁...𝑚)𝐵 ∧ 𝑥 ∈ ∪ 𝑛 ∈ 𝑍 𝐴) → ∃𝑚 ∈ 𝑍 𝑥 ∈ ⦋𝑚 / 𝑛⦌𝐴)
9		nfra1 3290	. . . . . 6 ⊢ Ⅎ𝑚∀𝑚 ∈ 𝑍 ∪ 𝑛 ∈ (𝑁...𝑚)𝐴 = ∪ 𝑛 ∈ (𝑁...𝑚)𝐵
10		nfv 1949	. . . . . 6 ⊢ Ⅎ𝑚 𝑥 ∈ ∪ 𝑛 ∈ 𝑍 𝐵
11		simp2 1155	. . . . . . . 8 ⊢ ((∀𝑚 ∈ 𝑍 ∪ 𝑛 ∈ (𝑁...𝑚)𝐴 = ∪ 𝑛 ∈ (𝑁...𝑚)𝐵 ∧ 𝑚 ∈ 𝑍 ∧ 𝑥 ∈ ⦋𝑚 / 𝑛⦌𝐴) → 𝑚 ∈ 𝑍)
12		rspa 3255	. . . . . . . . 9 ⊢ ((∀𝑚 ∈ 𝑍 ∪ 𝑛 ∈ (𝑁...𝑚)𝐴 = ∪ 𝑛 ∈ (𝑁...𝑚)𝐵 ∧ 𝑚 ∈ 𝑍) → ∪ 𝑛 ∈ (𝑁...𝑚)𝐴 = ∪ 𝑛 ∈ (𝑁...𝑚)𝐵)
13	12	3adant3 1150	. . . . . . . 8 ⊢ ((∀𝑚 ∈ 𝑍 ∪ 𝑛 ∈ (𝑁...𝑚)𝐴 = ∪ 𝑛 ∈ (𝑁...𝑚)𝐵 ∧ 𝑚 ∈ 𝑍 ∧ 𝑥 ∈ ⦋𝑚 / 𝑛⦌𝐴) → ∪ 𝑛 ∈ (𝑁...𝑚)𝐴 = ∪ 𝑛 ∈ (𝑁...𝑚)𝐵)
14		simp3 1156	. . . . . . . 8 ⊢ ((∀𝑚 ∈ 𝑍 ∪ 𝑛 ∈ (𝑁...𝑚)𝐴 = ∪ 𝑛 ∈ (𝑁...𝑚)𝐵 ∧ 𝑚 ∈ 𝑍 ∧ 𝑥 ∈ ⦋𝑚 / 𝑛⦌𝐴) → 𝑥 ∈ ⦋𝑚 / 𝑛⦌𝐴)
15		id 23	. . . . . . . . . . 11 ⊢ (∪ 𝑛 ∈ (𝑁...𝑚)𝐴 = ∪ 𝑛 ∈ (𝑁...𝑚)𝐵 → ∪ 𝑛 ∈ (𝑁...𝑚)𝐴 = ∪ 𝑛 ∈ (𝑁...𝑚)𝐵)
16		fzssuz 13723	. . . . . . . . . . . . 13 ⊢ (𝑁...𝑚) ⊆ (ℤ≥‘𝑁)
17		iuneqfzuzlem.z	. . . . . . . . . . . . . 14 ⊢ 𝑍 = (ℤ≥‘𝑁)
18	17	eqcomi 2772	. . . . . . . . . . . . 13 ⊢ (ℤ≥‘𝑁) = 𝑍
19	16, 18	sseqtri 3961	. . . . . . . . . . . 12 ⊢ (𝑁...𝑚) ⊆ 𝑍
20		iunss1 4969	. . . . . . . . . . . 12 ⊢ ((𝑁...𝑚) ⊆ 𝑍 → ∪ 𝑛 ∈ (𝑁...𝑚)𝐵 ⊆ ∪ 𝑛 ∈ 𝑍 𝐵)
21	19, 20	mp1i 14	. . . . . . . . . . 11 ⊢ (∪ 𝑛 ∈ (𝑁...𝑚)𝐴 = ∪ 𝑛 ∈ (𝑁...𝑚)𝐵 → ∪ 𝑛 ∈ (𝑁...𝑚)𝐵 ⊆ ∪ 𝑛 ∈ 𝑍 𝐵)
22	15, 21	eqsstrd 3947	. . . . . . . . . 10 ⊢ (∪ 𝑛 ∈ (𝑁...𝑚)𝐴 = ∪ 𝑛 ∈ (𝑁...𝑚)𝐵 → ∪ 𝑛 ∈ (𝑁...𝑚)𝐴 ⊆ ∪ 𝑛 ∈ 𝑍 𝐵)
23	22	3ad2ant2 1152	. . . . . . . . 9 ⊢ ((𝑚 ∈ 𝑍 ∧ ∪ 𝑛 ∈ (𝑁...𝑚)𝐴 = ∪ 𝑛 ∈ (𝑁...𝑚)𝐵 ∧ 𝑥 ∈ ⦋𝑚 / 𝑛⦌𝐴) → ∪ 𝑛 ∈ (𝑁...𝑚)𝐴 ⊆ ∪ 𝑛 ∈ 𝑍 𝐵)
24	17	eleq2i 2856	. . . . . . . . . . . . . . 15 ⊢ (𝑚 ∈ 𝑍 ↔ 𝑚 ∈ (ℤ≥‘𝑁))
25	24	biimpi 219	. . . . . . . . . . . . . 14 ⊢ (𝑚 ∈ 𝑍 → 𝑚 ∈ (ℤ≥‘𝑁))
26		eluzel2 12994	. . . . . . . . . . . . . 14 ⊢ (𝑚 ∈ (ℤ≥‘𝑁) → 𝑁 ∈ ℤ)
27	25, 26	syl 18	. . . . . . . . . . . . 13 ⊢ (𝑚 ∈ 𝑍 → 𝑁 ∈ ℤ)
28		eluzelz 12999	. . . . . . . . . . . . . 14 ⊢ (𝑚 ∈ (ℤ≥‘𝑁) → 𝑚 ∈ ℤ)
29	25, 28	syl 18	. . . . . . . . . . . . 13 ⊢ (𝑚 ∈ 𝑍 → 𝑚 ∈ ℤ)
30		eluzle 13002	. . . . . . . . . . . . . 14 ⊢ (𝑚 ∈ (ℤ≥‘𝑁) → 𝑁 ≤ 𝑚)
31	25, 30	syl 18	. . . . . . . . . . . . 13 ⊢ (𝑚 ∈ 𝑍 → 𝑁 ≤ 𝑚)
32	29	zred 12827	. . . . . . . . . . . . . 14 ⊢ (𝑚 ∈ 𝑍 → 𝑚 ∈ ℝ)
33		leid 11430	. . . . . . . . . . . . . 14 ⊢ (𝑚 ∈ ℝ → 𝑚 ≤ 𝑚)
34	32, 33	syl 18	. . . . . . . . . . . . 13 ⊢ (𝑚 ∈ 𝑍 → 𝑚 ≤ 𝑚)
35	27, 29, 29, 31, 34	elfzd 13671	. . . . . . . . . . . 12 ⊢ (𝑚 ∈ 𝑍 → 𝑚 ∈ (𝑁...𝑚))
36		nfcv 2926	. . . . . . . . . . . . . 14 ⊢ Ⅎ𝑛𝑥
37	36, 2	nfel 2940	. . . . . . . . . . . . 13 ⊢ Ⅎ𝑛 𝑥 ∈ ⦋𝑚 / 𝑛⦌𝐴
38	3	eleq2d 2850	. . . . . . . . . . . . 13 ⊢ (𝑛 = 𝑚 → (𝑥 ∈ 𝐴 ↔ 𝑥 ∈ ⦋𝑚 / 𝑛⦌𝐴))
39	37, 38	rspce 3569	. . . . . . . . . . . 12 ⊢ ((𝑚 ∈ (𝑁...𝑚) ∧ 𝑥 ∈ ⦋𝑚 / 𝑛⦌𝐴) → ∃𝑛 ∈ (𝑁...𝑚)𝑥 ∈ 𝐴)
40	35, 39	sylan 592	. . . . . . . . . . 11 ⊢ ((𝑚 ∈ 𝑍 ∧ 𝑥 ∈ ⦋𝑚 / 𝑛⦌𝐴) → ∃𝑛 ∈ (𝑁...𝑚)𝑥 ∈ 𝐴)
41		eliun 4958	. . . . . . . . . . 11 ⊢ (𝑥 ∈ ∪ 𝑛 ∈ (𝑁...𝑚)𝐴 ↔ ∃𝑛 ∈ (𝑁...𝑚)𝑥 ∈ 𝐴)
42	40, 41	sylibr 237	. . . . . . . . . 10 ⊢ ((𝑚 ∈ 𝑍 ∧ 𝑥 ∈ ⦋𝑚 / 𝑛⦌𝐴) → 𝑥 ∈ ∪ 𝑛 ∈ (𝑁...𝑚)𝐴)
43	42	3adant2 1149	. . . . . . . . 9 ⊢ ((𝑚 ∈ 𝑍 ∧ ∪ 𝑛 ∈ (𝑁...𝑚)𝐴 = ∪ 𝑛 ∈ (𝑁...𝑚)𝐵 ∧ 𝑥 ∈ ⦋𝑚 / 𝑛⦌𝐴) → 𝑥 ∈ ∪ 𝑛 ∈ (𝑁...𝑚)𝐴)
44	23, 43	sseldd 3914	. . . . . . . 8 ⊢ ((𝑚 ∈ 𝑍 ∧ ∪ 𝑛 ∈ (𝑁...𝑚)𝐴 = ∪ 𝑛 ∈ (𝑁...𝑚)𝐵 ∧ 𝑥 ∈ ⦋𝑚 / 𝑛⦌𝐴) → 𝑥 ∈ ∪ 𝑛 ∈ 𝑍 𝐵)
45	11, 13, 14, 44	syl3anc 1399	. . . . . . 7 ⊢ ((∀𝑚 ∈ 𝑍 ∪ 𝑛 ∈ (𝑁...𝑚)𝐴 = ∪ 𝑛 ∈ (𝑁...𝑚)𝐵 ∧ 𝑚 ∈ 𝑍 ∧ 𝑥 ∈ ⦋𝑚 / 𝑛⦌𝐴) → 𝑥 ∈ ∪ 𝑛 ∈ 𝑍 𝐵)
46	45	3exp 1137	. . . . . 6 ⊢ (∀𝑚 ∈ 𝑍 ∪ 𝑛 ∈ (𝑁...𝑚)𝐴 = ∪ 𝑛 ∈ (𝑁...𝑚)𝐵 → (𝑚 ∈ 𝑍 → (𝑥 ∈ ⦋𝑚 / 𝑛⦌𝐴 → 𝑥 ∈ ∪ 𝑛 ∈ 𝑍 𝐵)))
47	9, 10, 46	rexlimd 3273	. . . . 5 ⊢ (∀𝑚 ∈ 𝑍 ∪ 𝑛 ∈ (𝑁...𝑚)𝐴 = ∪ 𝑛 ∈ (𝑁...𝑚)𝐵 → (∃𝑚 ∈ 𝑍 𝑥 ∈ ⦋𝑚 / 𝑛⦌𝐴 → 𝑥 ∈ ∪ 𝑛 ∈ 𝑍 𝐵))
48	47	adantr 486	. . . 4 ⊢ ((∀𝑚 ∈ 𝑍 ∪ 𝑛 ∈ (𝑁...𝑚)𝐴 = ∪ 𝑛 ∈ (𝑁...𝑚)𝐵 ∧ 𝑥 ∈ ∪ 𝑛 ∈ 𝑍 𝐴) → (∃𝑚 ∈ 𝑍 𝑥 ∈ ⦋𝑚 / 𝑛⦌𝐴 → 𝑥 ∈ ∪ 𝑛 ∈ 𝑍 𝐵))
49	8, 48	mpd 16	. . 3 ⊢ ((∀𝑚 ∈ 𝑍 ∪ 𝑛 ∈ (𝑁...𝑚)𝐴 = ∪ 𝑛 ∈ (𝑁...𝑚)𝐵 ∧ 𝑥 ∈ ∪ 𝑛 ∈ 𝑍 𝐴) → 𝑥 ∈ ∪ 𝑛 ∈ 𝑍 𝐵)
50	49	ralrimiva 3158	. 2 ⊢ (∀𝑚 ∈ 𝑍 ∪ 𝑛 ∈ (𝑁...𝑚)𝐴 = ∪ 𝑛 ∈ (𝑁...𝑚)𝐵 → ∀𝑥 ∈ ∪ 𝑛 ∈ 𝑍 𝐴𝑥 ∈ ∪ 𝑛 ∈ 𝑍 𝐵)
51		dfss3 3902	. 2 ⊢ (∪ 𝑛 ∈ 𝑍 𝐴 ⊆ ∪ 𝑛 ∈ 𝑍 𝐵 ↔ ∀𝑥 ∈ ∪ 𝑛 ∈ 𝑍 𝐴𝑥 ∈ ∪ 𝑛 ∈ 𝑍 𝐵)
52	50, 51	sylibr 237	1 ⊢ (∀𝑚 ∈ 𝑍 ∪ 𝑛 ∈ (𝑁...𝑚)𝐴 = ∪ 𝑛 ∈ (𝑁...𝑚)𝐵 → ∪ 𝑛 ∈ 𝑍 𝐴 ⊆ ∪ 𝑛 ∈ 𝑍 𝐵)

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2147  ∀wral 3080  ∃wrex 3090  ⦋csb 3851   ⊆ wss 3900  ∪ ciun 4954   class class class wbr 5106  ‘cfv 6555  (class class class)co 7440  ℝcr 11223   ≤ cle 11368  ℤcz 12717  ℤ_≥cuz 12989  ...cfz 13663

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5252  ax-nul 5263  ax-pow 5331  ax-pr 5395  ax-un 7772  ax-cnex 11280  ax-resscn 11281  ax-pre-lttri 11298

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-nel 3066  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-iun 4956  df-br 5107  df-opab 5171  df-mpt 5190  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-iota 6509  df-fun 6557  df-fn 6558  df-f 6559  df-f1 6560  df-fo 6561  df-f1o 6562  df-fv 6563  df-ov 7443  df-oprab 7444  df-mpo 7445  df-1st 8022  df-2nd 8023  df-er 8742  df-en 8999  df-dom 9000  df-sdom 9001  df-pnf 11369  df-mnf 11370  df-xr 11371  df-ltxr 11372  df-le 11373  df-neg 11568  df-z 12718  df-uz 12990  df-fz 13664

This theorem is used by:  iuneqfzuz  46550