Theorem elrfirn2 43544

Description: Elementhood in a set of relative finite intersections of an indexed family of sets (implicit). (Contributed by Stefan O'Rear, 22-Feb-2015.)

Assertion

Ref	Expression
elrfirn2	⊢ ((𝐵 ∈ 𝑉 ∧ ∀𝑦 ∈ 𝐼 𝐶 ⊆ 𝐵) → (𝐴 ∈ (fi‘({𝐵} ∪ ran (𝑦 ∈ 𝐼 ↦ 𝐶))) ↔ ∃𝑣 ∈ (𝒫 𝐼 ∩ Fin)𝐴 = (𝐵 ∩ ∩ 𝑦 ∈ 𝑣 𝐶)))

Distinct variable groups:   𝑣,𝐴   𝑣,𝐵,𝑦   𝑣,𝐶   𝑣,𝐼,𝑦   𝑣,𝑉,𝑦

Allowed substitution hints:   𝐴(𝑦)   𝐶(𝑦)

Proof of Theorem elrfirn2

Dummy variable 𝑧 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		elpw2g 5298	. . . . . . 7 ⊢ (𝐵 ∈ 𝑉 → (𝐶 ∈ 𝒫 𝐵 ↔ 𝐶 ⊆ 𝐵))
2	1	biimprd 251	. . . . . 6 ⊢ (𝐵 ∈ 𝑉 → (𝐶 ⊆ 𝐵 → 𝐶 ∈ 𝒫 𝐵))
3	2	ralimdv 3176	. . . . 5 ⊢ (𝐵 ∈ 𝑉 → (∀𝑦 ∈ 𝐼 𝐶 ⊆ 𝐵 → ∀𝑦 ∈ 𝐼 𝐶 ∈ 𝒫 𝐵))
4	3	imp 412	. . . 4 ⊢ ((𝐵 ∈ 𝑉 ∧ ∀𝑦 ∈ 𝐼 𝐶 ⊆ 𝐵) → ∀𝑦 ∈ 𝐼 𝐶 ∈ 𝒫 𝐵)
5		eqid 2760	. . . . 5 ⊢ (𝑦 ∈ 𝐼 ↦ 𝐶) = (𝑦 ∈ 𝐼 ↦ 𝐶)
6	5	fmpt 7104	. . . 4 ⊢ (∀𝑦 ∈ 𝐼 𝐶 ∈ 𝒫 𝐵 ↔ (𝑦 ∈ 𝐼 ↦ 𝐶):𝐼⟶𝒫 𝐵)
7	4, 6	sylib 221	. . 3 ⊢ ((𝐵 ∈ 𝑉 ∧ ∀𝑦 ∈ 𝐼 𝐶 ⊆ 𝐵) → (𝑦 ∈ 𝐼 ↦ 𝐶):𝐼⟶𝒫 𝐵)
8		elrfirn 43543	. . 3 ⊢ ((𝐵 ∈ 𝑉 ∧ (𝑦 ∈ 𝐼 ↦ 𝐶):𝐼⟶𝒫 𝐵) → (𝐴 ∈ (fi‘({𝐵} ∪ ran (𝑦 ∈ 𝐼 ↦ 𝐶))) ↔ ∃𝑣 ∈ (𝒫 𝐼 ∩ Fin)𝐴 = (𝐵 ∩ ∩ 𝑧 ∈ 𝑣 ((𝑦 ∈ 𝐼 ↦ 𝐶)‘𝑧))))
9	7, 8	syldan 603	. 2 ⊢ ((𝐵 ∈ 𝑉 ∧ ∀𝑦 ∈ 𝐼 𝐶 ⊆ 𝐵) → (𝐴 ∈ (fi‘({𝐵} ∪ ran (𝑦 ∈ 𝐼 ↦ 𝐶))) ↔ ∃𝑣 ∈ (𝒫 𝐼 ∩ Fin)𝐴 = (𝐵 ∩ ∩ 𝑧 ∈ 𝑣 ((𝑦 ∈ 𝐼 ↦ 𝐶)‘𝑧))))
10		inss1 4182	. . . . . 6 ⊢ (𝒫 𝐼 ∩ Fin) ⊆ 𝒫 𝐼
11	10	sseli 3927	. . . . 5 ⊢ (𝑣 ∈ (𝒫 𝐼 ∩ Fin) → 𝑣 ∈ 𝒫 𝐼)
12	11	elpwid 4566	. . . 4 ⊢ (𝑣 ∈ (𝒫 𝐼 ∩ Fin) → 𝑣 ⊆ 𝐼)
13		nffvmpt1 6890	. . . . . . . 8 ⊢ Ⅎ𝑦((𝑦 ∈ 𝐼 ↦ 𝐶)‘𝑧)
14		nfcv 2922	. . . . . . . 8 ⊢ Ⅎ𝑧((𝑦 ∈ 𝐼 ↦ 𝐶)‘𝑦)
15		fveq2 6879	. . . . . . . 8 ⊢ (𝑧 = 𝑦 → ((𝑦 ∈ 𝐼 ↦ 𝐶)‘𝑧) = ((𝑦 ∈ 𝐼 ↦ 𝐶)‘𝑦))
16	13, 14, 15	cbviin 4994	. . . . . . 7 ⊢ ∩ 𝑧 ∈ 𝑣 ((𝑦 ∈ 𝐼 ↦ 𝐶)‘𝑧) = ∩ 𝑦 ∈ 𝑣 ((𝑦 ∈ 𝐼 ↦ 𝐶)‘𝑦)
17		simplr 781	. . . . . . . . . . . . 13 ⊢ (((𝐵 ∈ 𝑉 ∧ 𝑦 ∈ 𝐼) ∧ 𝐶 ⊆ 𝐵) → 𝑦 ∈ 𝐼)
18		simpll 779	. . . . . . . . . . . . . 14 ⊢ (((𝐵 ∈ 𝑉 ∧ 𝑦 ∈ 𝐼) ∧ 𝐶 ⊆ 𝐵) → 𝐵 ∈ 𝑉)
19		simpr 490	. . . . . . . . . . . . . 14 ⊢ (((𝐵 ∈ 𝑉 ∧ 𝑦 ∈ 𝐼) ∧ 𝐶 ⊆ 𝐵) → 𝐶 ⊆ 𝐵)
20	18, 19	ssexd 5289	. . . . . . . . . . . . 13 ⊢ (((𝐵 ∈ 𝑉 ∧ 𝑦 ∈ 𝐼) ∧ 𝐶 ⊆ 𝐵) → 𝐶 ∈ V)
21	5	fvmpt2 6999	. . . . . . . . . . . . 13 ⊢ ((𝑦 ∈ 𝐼 ∧ 𝐶 ∈ V) → ((𝑦 ∈ 𝐼 ↦ 𝐶)‘𝑦) = 𝐶)
22	17, 20, 21	syl2anc 596	. . . . . . . . . . . 12 ⊢ (((𝐵 ∈ 𝑉 ∧ 𝑦 ∈ 𝐼) ∧ 𝐶 ⊆ 𝐵) → ((𝑦 ∈ 𝐼 ↦ 𝐶)‘𝑦) = 𝐶)
23	22	ex 418	. . . . . . . . . . 11 ⊢ ((𝐵 ∈ 𝑉 ∧ 𝑦 ∈ 𝐼) → (𝐶 ⊆ 𝐵 → ((𝑦 ∈ 𝐼 ↦ 𝐶)‘𝑦) = 𝐶))
24	23	ralimdva 3174	. . . . . . . . . 10 ⊢ (𝐵 ∈ 𝑉 → (∀𝑦 ∈ 𝐼 𝐶 ⊆ 𝐵 → ∀𝑦 ∈ 𝐼 ((𝑦 ∈ 𝐼 ↦ 𝐶)‘𝑦) = 𝐶))
25	24	imp 412	. . . . . . . . 9 ⊢ ((𝐵 ∈ 𝑉 ∧ ∀𝑦 ∈ 𝐼 𝐶 ⊆ 𝐵) → ∀𝑦 ∈ 𝐼 ((𝑦 ∈ 𝐼 ↦ 𝐶)‘𝑦) = 𝐶)
26		ssralv 4000	. . . . . . . . 9 ⊢ (𝑣 ⊆ 𝐼 → (∀𝑦 ∈ 𝐼 ((𝑦 ∈ 𝐼 ↦ 𝐶)‘𝑦) = 𝐶 → ∀𝑦 ∈ 𝑣 ((𝑦 ∈ 𝐼 ↦ 𝐶)‘𝑦) = 𝐶))
27	25, 26	mpan9 516	. . . . . . . 8 ⊢ (((𝐵 ∈ 𝑉 ∧ ∀𝑦 ∈ 𝐼 𝐶 ⊆ 𝐵) ∧ 𝑣 ⊆ 𝐼) → ∀𝑦 ∈ 𝑣 ((𝑦 ∈ 𝐼 ↦ 𝐶)‘𝑦) = 𝐶)
28		iineq2 4972	. . . . . . . 8 ⊢ (∀𝑦 ∈ 𝑣 ((𝑦 ∈ 𝐼 ↦ 𝐶)‘𝑦) = 𝐶 → ∩ 𝑦 ∈ 𝑣 ((𝑦 ∈ 𝐼 ↦ 𝐶)‘𝑦) = ∩ 𝑦 ∈ 𝑣 𝐶)
29	27, 28	syl 18	. . . . . . 7 ⊢ (((𝐵 ∈ 𝑉 ∧ ∀𝑦 ∈ 𝐼 𝐶 ⊆ 𝐵) ∧ 𝑣 ⊆ 𝐼) → ∩ 𝑦 ∈ 𝑣 ((𝑦 ∈ 𝐼 ↦ 𝐶)‘𝑦) = ∩ 𝑦 ∈ 𝑣 𝐶)
30	16, 29	eqtrid 2807	. . . . . 6 ⊢ (((𝐵 ∈ 𝑉 ∧ ∀𝑦 ∈ 𝐼 𝐶 ⊆ 𝐵) ∧ 𝑣 ⊆ 𝐼) → ∩ 𝑧 ∈ 𝑣 ((𝑦 ∈ 𝐼 ↦ 𝐶)‘𝑧) = ∩ 𝑦 ∈ 𝑣 𝐶)
31	30	ineq2d 4166	. . . . 5 ⊢ (((𝐵 ∈ 𝑉 ∧ ∀𝑦 ∈ 𝐼 𝐶 ⊆ 𝐵) ∧ 𝑣 ⊆ 𝐼) → (𝐵 ∩ ∩ 𝑧 ∈ 𝑣 ((𝑦 ∈ 𝐼 ↦ 𝐶)‘𝑧)) = (𝐵 ∩ ∩ 𝑦 ∈ 𝑣 𝐶))
32	31	eqeq2d 2771	. . . 4 ⊢ (((𝐵 ∈ 𝑉 ∧ ∀𝑦 ∈ 𝐼 𝐶 ⊆ 𝐵) ∧ 𝑣 ⊆ 𝐼) → (𝐴 = (𝐵 ∩ ∩ 𝑧 ∈ 𝑣 ((𝑦 ∈ 𝐼 ↦ 𝐶)‘𝑧)) ↔ 𝐴 = (𝐵 ∩ ∩ 𝑦 ∈ 𝑣 𝐶)))
33	12, 32	sylan2 605	. . 3 ⊢ (((𝐵 ∈ 𝑉 ∧ ∀𝑦 ∈ 𝐼 𝐶 ⊆ 𝐵) ∧ 𝑣 ∈ (𝒫 𝐼 ∩ Fin)) → (𝐴 = (𝐵 ∩ ∩ 𝑧 ∈ 𝑣 ((𝑦 ∈ 𝐼 ↦ 𝐶)‘𝑧)) ↔ 𝐴 = (𝐵 ∩ ∩ 𝑦 ∈ 𝑣 𝐶)))
34	33	rexbidva 3184	. 2 ⊢ ((𝐵 ∈ 𝑉 ∧ ∀𝑦 ∈ 𝐼 𝐶 ⊆ 𝐵) → (∃𝑣 ∈ (𝒫 𝐼 ∩ Fin)𝐴 = (𝐵 ∩ ∩ 𝑧 ∈ 𝑣 ((𝑦 ∈ 𝐼 ↦ 𝐶)‘𝑧)) ↔ ∃𝑣 ∈ (𝒫 𝐼 ∩ Fin)𝐴 = (𝐵 ∩ ∩ 𝑦 ∈ 𝑣 𝐶)))
35	9, 34	bitrd 282	1 ⊢ ((𝐵 ∈ 𝑉 ∧ ∀𝑦 ∈ 𝐼 𝐶 ⊆ 𝐵) → (𝐴 ∈ (fi‘({𝐵} ∪ ran (𝑦 ∈ 𝐼 ↦ 𝐶))) ↔ ∃𝑣 ∈ (𝒫 𝐼 ∩ Fin)𝐴 = (𝐵 ∩ ∩ 𝑦 ∈ 𝑣 𝐶)))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2145  ∀wral 3076  ∃wrex 3086  Vcvv 3450   ∪ cun 3897   ∩ cin 3898   ⊆ wss 3899  𝒫 cpw 4557  {csn 4584  ∩ ciin 4952   ↦ cmpt 5186  ran crn 5656  ⟶wf 6529  ‘cfv 6533  Fincfn 8955  ficfi 9383

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 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2732  ax-sep 5251  ax-nul 5263  ax-pow 5330  ax-pr 5398  ax-un 7737

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 2100  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-pss 3919  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-int 4908  df-iin 4954  df-br 5104  df-opab 5168  df-mpt 5187  df-tr 5213  df-id 5550  df-eprel 5555  df-po 5563  df-so 5564  df-fr 5608  df-we 5610  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-ord 6360  df-on 6361  df-lim 6362  df-suc 6363  df-iota 6489  df-fun 6535  df-fn 6536  df-f 6537  df-f1 6538  df-fo 6539  df-f1o 6540  df-fv 6541  df-om 7864  df-1o 8458  df-en 8956  df-dom 8957  df-fin 8959  df-fi 9384

This theorem is used by:  cmpfiiin  43545