Theorem elrfirn2 41736

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 5343	. . . . . . 7 ⊢ (𝐵 ∈ 𝑉 → (𝐶 ∈ 𝒫 𝐵 ↔ 𝐶 ⊆ 𝐵))
2	1	biimprd 247	. . . . . 6 ⊢ (𝐵 ∈ 𝑉 → (𝐶 ⊆ 𝐵 → 𝐶 ∈ 𝒫 𝐵))
3	2	ralimdv 3167	. . . . 5 ⊢ (𝐵 ∈ 𝑉 → (∀𝑦 ∈ 𝐼 𝐶 ⊆ 𝐵 → ∀𝑦 ∈ 𝐼 𝐶 ∈ 𝒫 𝐵))
4	3	imp 405	. . . 4 ⊢ ((𝐵 ∈ 𝑉 ∧ ∀𝑦 ∈ 𝐼 𝐶 ⊆ 𝐵) → ∀𝑦 ∈ 𝐼 𝐶 ∈ 𝒫 𝐵)
5		eqid 2730	. . . . 5 ⊢ (𝑦 ∈ 𝐼 ↦ 𝐶) = (𝑦 ∈ 𝐼 ↦ 𝐶)
6	5	fmpt 7110	. . . 4 ⊢ (∀𝑦 ∈ 𝐼 𝐶 ∈ 𝒫 𝐵 ↔ (𝑦 ∈ 𝐼 ↦ 𝐶):𝐼⟶𝒫 𝐵)
7	4, 6	sylib 217	. . 3 ⊢ ((𝐵 ∈ 𝑉 ∧ ∀𝑦 ∈ 𝐼 𝐶 ⊆ 𝐵) → (𝑦 ∈ 𝐼 ↦ 𝐶):𝐼⟶𝒫 𝐵)
8		elrfirn 41735	. . 3 ⊢ ((𝐵 ∈ 𝑉 ∧ (𝑦 ∈ 𝐼 ↦ 𝐶):𝐼⟶𝒫 𝐵) → (𝐴 ∈ (fi‘({𝐵} ∪ ran (𝑦 ∈ 𝐼 ↦ 𝐶))) ↔ ∃𝑣 ∈ (𝒫 𝐼 ∩ Fin)𝐴 = (𝐵 ∩ ∩ 𝑧 ∈ 𝑣 ((𝑦 ∈ 𝐼 ↦ 𝐶)‘𝑧))))
9	7, 8	syldan 589	. 2 ⊢ ((𝐵 ∈ 𝑉 ∧ ∀𝑦 ∈ 𝐼 𝐶 ⊆ 𝐵) → (𝐴 ∈ (fi‘({𝐵} ∪ ran (𝑦 ∈ 𝐼 ↦ 𝐶))) ↔ ∃𝑣 ∈ (𝒫 𝐼 ∩ Fin)𝐴 = (𝐵 ∩ ∩ 𝑧 ∈ 𝑣 ((𝑦 ∈ 𝐼 ↦ 𝐶)‘𝑧))))
10		inss1 4227	. . . . . 6 ⊢ (𝒫 𝐼 ∩ Fin) ⊆ 𝒫 𝐼
11	10	sseli 3977	. . . . 5 ⊢ (𝑣 ∈ (𝒫 𝐼 ∩ Fin) → 𝑣 ∈ 𝒫 𝐼)
12	11	elpwid 4610	. . . 4 ⊢ (𝑣 ∈ (𝒫 𝐼 ∩ Fin) → 𝑣 ⊆ 𝐼)
13		nffvmpt1 6901	. . . . . . . 8 ⊢ Ⅎ𝑦((𝑦 ∈ 𝐼 ↦ 𝐶)‘𝑧)
14		nfcv 2901	. . . . . . . 8 ⊢ Ⅎ𝑧((𝑦 ∈ 𝐼 ↦ 𝐶)‘𝑦)
15		fveq2 6890	. . . . . . . 8 ⊢ (𝑧 = 𝑦 → ((𝑦 ∈ 𝐼 ↦ 𝐶)‘𝑧) = ((𝑦 ∈ 𝐼 ↦ 𝐶)‘𝑦))
16	13, 14, 15	cbviin 5039	. . . . . . 7 ⊢ ∩ 𝑧 ∈ 𝑣 ((𝑦 ∈ 𝐼 ↦ 𝐶)‘𝑧) = ∩ 𝑦 ∈ 𝑣 ((𝑦 ∈ 𝐼 ↦ 𝐶)‘𝑦)
17		simplr 765	. . . . . . . . . . . . 13 ⊢ (((𝐵 ∈ 𝑉 ∧ 𝑦 ∈ 𝐼) ∧ 𝐶 ⊆ 𝐵) → 𝑦 ∈ 𝐼)
18		simpll 763	. . . . . . . . . . . . . 14 ⊢ (((𝐵 ∈ 𝑉 ∧ 𝑦 ∈ 𝐼) ∧ 𝐶 ⊆ 𝐵) → 𝐵 ∈ 𝑉)
19		simpr 483	. . . . . . . . . . . . . 14 ⊢ (((𝐵 ∈ 𝑉 ∧ 𝑦 ∈ 𝐼) ∧ 𝐶 ⊆ 𝐵) → 𝐶 ⊆ 𝐵)
20	18, 19	ssexd 5323	. . . . . . . . . . . . 13 ⊢ (((𝐵 ∈ 𝑉 ∧ 𝑦 ∈ 𝐼) ∧ 𝐶 ⊆ 𝐵) → 𝐶 ∈ V)
21	5	fvmpt2 7008	. . . . . . . . . . . . 13 ⊢ ((𝑦 ∈ 𝐼 ∧ 𝐶 ∈ V) → ((𝑦 ∈ 𝐼 ↦ 𝐶)‘𝑦) = 𝐶)
22	17, 20, 21	syl2anc 582	. . . . . . . . . . . 12 ⊢ (((𝐵 ∈ 𝑉 ∧ 𝑦 ∈ 𝐼) ∧ 𝐶 ⊆ 𝐵) → ((𝑦 ∈ 𝐼 ↦ 𝐶)‘𝑦) = 𝐶)
23	22	ex 411	. . . . . . . . . . 11 ⊢ ((𝐵 ∈ 𝑉 ∧ 𝑦 ∈ 𝐼) → (𝐶 ⊆ 𝐵 → ((𝑦 ∈ 𝐼 ↦ 𝐶)‘𝑦) = 𝐶))
24	23	ralimdva 3165	. . . . . . . . . 10 ⊢ (𝐵 ∈ 𝑉 → (∀𝑦 ∈ 𝐼 𝐶 ⊆ 𝐵 → ∀𝑦 ∈ 𝐼 ((𝑦 ∈ 𝐼 ↦ 𝐶)‘𝑦) = 𝐶))
25	24	imp 405	. . . . . . . . 9 ⊢ ((𝐵 ∈ 𝑉 ∧ ∀𝑦 ∈ 𝐼 𝐶 ⊆ 𝐵) → ∀𝑦 ∈ 𝐼 ((𝑦 ∈ 𝐼 ↦ 𝐶)‘𝑦) = 𝐶)
26		ssralv 4049	. . . . . . . . 9 ⊢ (𝑣 ⊆ 𝐼 → (∀𝑦 ∈ 𝐼 ((𝑦 ∈ 𝐼 ↦ 𝐶)‘𝑦) = 𝐶 → ∀𝑦 ∈ 𝑣 ((𝑦 ∈ 𝐼 ↦ 𝐶)‘𝑦) = 𝐶))
27	25, 26	mpan9 505	. . . . . . . 8 ⊢ (((𝐵 ∈ 𝑉 ∧ ∀𝑦 ∈ 𝐼 𝐶 ⊆ 𝐵) ∧ 𝑣 ⊆ 𝐼) → ∀𝑦 ∈ 𝑣 ((𝑦 ∈ 𝐼 ↦ 𝐶)‘𝑦) = 𝐶)
28		iineq2 5016	. . . . . . . 8 ⊢ (∀𝑦 ∈ 𝑣 ((𝑦 ∈ 𝐼 ↦ 𝐶)‘𝑦) = 𝐶 → ∩ 𝑦 ∈ 𝑣 ((𝑦 ∈ 𝐼 ↦ 𝐶)‘𝑦) = ∩ 𝑦 ∈ 𝑣 𝐶)
29	27, 28	syl 17	. . . . . . 7 ⊢ (((𝐵 ∈ 𝑉 ∧ ∀𝑦 ∈ 𝐼 𝐶 ⊆ 𝐵) ∧ 𝑣 ⊆ 𝐼) → ∩ 𝑦 ∈ 𝑣 ((𝑦 ∈ 𝐼 ↦ 𝐶)‘𝑦) = ∩ 𝑦 ∈ 𝑣 𝐶)
30	16, 29	eqtrid 2782	. . . . . 6 ⊢ (((𝐵 ∈ 𝑉 ∧ ∀𝑦 ∈ 𝐼 𝐶 ⊆ 𝐵) ∧ 𝑣 ⊆ 𝐼) → ∩ 𝑧 ∈ 𝑣 ((𝑦 ∈ 𝐼 ↦ 𝐶)‘𝑧) = ∩ 𝑦 ∈ 𝑣 𝐶)
31	30	ineq2d 4211	. . . . 5 ⊢ (((𝐵 ∈ 𝑉 ∧ ∀𝑦 ∈ 𝐼 𝐶 ⊆ 𝐵) ∧ 𝑣 ⊆ 𝐼) → (𝐵 ∩ ∩ 𝑧 ∈ 𝑣 ((𝑦 ∈ 𝐼 ↦ 𝐶)‘𝑧)) = (𝐵 ∩ ∩ 𝑦 ∈ 𝑣 𝐶))
32	31	eqeq2d 2741	. . . 4 ⊢ (((𝐵 ∈ 𝑉 ∧ ∀𝑦 ∈ 𝐼 𝐶 ⊆ 𝐵) ∧ 𝑣 ⊆ 𝐼) → (𝐴 = (𝐵 ∩ ∩ 𝑧 ∈ 𝑣 ((𝑦 ∈ 𝐼 ↦ 𝐶)‘𝑧)) ↔ 𝐴 = (𝐵 ∩ ∩ 𝑦 ∈ 𝑣 𝐶)))
33	12, 32	sylan2 591	. . 3 ⊢ (((𝐵 ∈ 𝑉 ∧ ∀𝑦 ∈ 𝐼 𝐶 ⊆ 𝐵) ∧ 𝑣 ∈ (𝒫 𝐼 ∩ Fin)) → (𝐴 = (𝐵 ∩ ∩ 𝑧 ∈ 𝑣 ((𝑦 ∈ 𝐼 ↦ 𝐶)‘𝑧)) ↔ 𝐴 = (𝐵 ∩ ∩ 𝑦 ∈ 𝑣 𝐶)))
34	33	rexbidva 3174	. 2 ⊢ ((𝐵 ∈ 𝑉 ∧ ∀𝑦 ∈ 𝐼 𝐶 ⊆ 𝐵) → (∃𝑣 ∈ (𝒫 𝐼 ∩ Fin)𝐴 = (𝐵 ∩ ∩ 𝑧 ∈ 𝑣 ((𝑦 ∈ 𝐼 ↦ 𝐶)‘𝑧)) ↔ ∃𝑣 ∈ (𝒫 𝐼 ∩ Fin)𝐴 = (𝐵 ∩ ∩ 𝑦 ∈ 𝑣 𝐶)))
35	9, 34	bitrd 278	1 ⊢ ((𝐵 ∈ 𝑉 ∧ ∀𝑦 ∈ 𝐼 𝐶 ⊆ 𝐵) → (𝐴 ∈ (fi‘({𝐵} ∪ ran (𝑦 ∈ 𝐼 ↦ 𝐶))) ↔ ∃𝑣 ∈ (𝒫 𝐼 ∩ Fin)𝐴 = (𝐵 ∩ ∩ 𝑦 ∈ 𝑣 𝐶)))

Syntax hints:   → wi 4   ↔ wb 205   ∧ wa 394   = wceq 1539   ∈ wcel 2104  ∀wral 3059  ∃wrex 3068  Vcvv 3472   ∪ cun 3945   ∩ cin 3946   ⊆ wss 3947  𝒫 cpw 4601  {csn 4627  ∩ ciin 4997   ↦ cmpt 5230  ran crn 5676  ⟶wf 6538  ‘cfv 6542  Fincfn 8941  ficfi 9407

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1911  ax-6 1969  ax-7 2009  ax-8 2106  ax-9 2114  ax-10 2135  ax-11 2152  ax-12 2169  ax-ext 2701  ax-sep 5298  ax-nul 5305  ax-pow 5362  ax-pr 5426  ax-un 7727

This theorem depends on definitions:  df-bi 206  df-an 395  df-or 844  df-3or 1086  df-3an 1087  df-tru 1542  df-fal 1552  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2532  df-eu 2561  df-clab 2708  df-cleq 2722  df-clel 2808  df-nfc 2883  df-ne 2939  df-ral 3060  df-rex 3069  df-reu 3375  df-rab 3431  df-v 3474  df-sbc 3777  df-csb 3893  df-dif 3950  df-un 3952  df-in 3954  df-ss 3964  df-pss 3966  df-nul 4322  df-if 4528  df-pw 4603  df-sn 4628  df-pr 4630  df-op 4634  df-uni 4908  df-int 4950  df-iin 4999  df-br 5148  df-opab 5210  df-mpt 5231  df-tr 5265  df-id 5573  df-eprel 5579  df-po 5587  df-so 5588  df-fr 5630  df-we 5632  df-xp 5681  df-rel 5682  df-cnv 5683  df-co 5684  df-dm 5685  df-rn 5686  df-res 5687  df-ima 5688  df-ord 6366  df-on 6367  df-lim 6368  df-suc 6369  df-iota 6494  df-fun 6544  df-fn 6545  df-f 6546  df-f1 6547  df-fo 6548  df-f1o 6549  df-fv 6550  df-om 7858  df-1o 8468  df-en 8942  df-fin 8945  df-fi 9408

This theorem is referenced by:  cmpfiiin  41737