Theorem elrfirn 43004

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

Assertion

Ref	Expression
elrfirn	⊢ ((𝐵 ∈ 𝑉 ∧ 𝐹:𝐼⟶𝒫 𝐵) → (𝐴 ∈ (fi‘({𝐵} ∪ ran 𝐹)) ↔ ∃𝑣 ∈ (𝒫 𝐼 ∩ Fin)𝐴 = (𝐵 ∩ ∩ 𝑦 ∈ 𝑣 (𝐹‘𝑦))))

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

Allowed substitution hints:   𝐴(𝑦)   𝐵(𝑦)   𝐼(𝑦)   𝑉(𝑦)

Proof of Theorem elrfirn

Dummy variable 𝑤 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		frn 6670	. . 3 ⊢ (𝐹:𝐼⟶𝒫 𝐵 → ran 𝐹 ⊆ 𝒫 𝐵)
2		elrfi 43003	. . 3 ⊢ ((𝐵 ∈ 𝑉 ∧ ran 𝐹 ⊆ 𝒫 𝐵) → (𝐴 ∈ (fi‘({𝐵} ∪ ran 𝐹)) ↔ ∃𝑤 ∈ (𝒫 ran 𝐹 ∩ Fin)𝐴 = (𝐵 ∩ ∩ 𝑤)))
3	1, 2	sylan2 594	. 2 ⊢ ((𝐵 ∈ 𝑉 ∧ 𝐹:𝐼⟶𝒫 𝐵) → (𝐴 ∈ (fi‘({𝐵} ∪ ran 𝐹)) ↔ ∃𝑤 ∈ (𝒫 ran 𝐹 ∩ Fin)𝐴 = (𝐵 ∩ ∩ 𝑤)))
4		imassrn 6031	. . . . . 6 ⊢ (𝐹 “ 𝑣) ⊆ ran 𝐹
5		pwexg 5324	. . . . . . . 8 ⊢ (𝐵 ∈ 𝑉 → 𝒫 𝐵 ∈ V)
6		ssexg 5269	. . . . . . . 8 ⊢ ((ran 𝐹 ⊆ 𝒫 𝐵 ∧ 𝒫 𝐵 ∈ V) → ran 𝐹 ∈ V)
7	1, 5, 6	syl2anr 598	. . . . . . 7 ⊢ ((𝐵 ∈ 𝑉 ∧ 𝐹:𝐼⟶𝒫 𝐵) → ran 𝐹 ∈ V)
8		elpw2g 5279	. . . . . . 7 ⊢ (ran 𝐹 ∈ V → ((𝐹 “ 𝑣) ∈ 𝒫 ran 𝐹 ↔ (𝐹 “ 𝑣) ⊆ ran 𝐹))
9	7, 8	syl 17	. . . . . 6 ⊢ ((𝐵 ∈ 𝑉 ∧ 𝐹:𝐼⟶𝒫 𝐵) → ((𝐹 “ 𝑣) ∈ 𝒫 ran 𝐹 ↔ (𝐹 “ 𝑣) ⊆ ran 𝐹))
10	4, 9	mpbiri 258	. . . . 5 ⊢ ((𝐵 ∈ 𝑉 ∧ 𝐹:𝐼⟶𝒫 𝐵) → (𝐹 “ 𝑣) ∈ 𝒫 ran 𝐹)
11	10	adantr 480	. . . 4 ⊢ (((𝐵 ∈ 𝑉 ∧ 𝐹:𝐼⟶𝒫 𝐵) ∧ 𝑣 ∈ (𝒫 𝐼 ∩ Fin)) → (𝐹 “ 𝑣) ∈ 𝒫 ran 𝐹)
12		ffun 6666	. . . . . 6 ⊢ (𝐹:𝐼⟶𝒫 𝐵 → Fun 𝐹)
13	12	ad2antlr 728	. . . . 5 ⊢ (((𝐵 ∈ 𝑉 ∧ 𝐹:𝐼⟶𝒫 𝐵) ∧ 𝑣 ∈ (𝒫 𝐼 ∩ Fin)) → Fun 𝐹)
14		inss2 4191	. . . . . . 7 ⊢ (𝒫 𝐼 ∩ Fin) ⊆ Fin
15	14	sseli 3930	. . . . . 6 ⊢ (𝑣 ∈ (𝒫 𝐼 ∩ Fin) → 𝑣 ∈ Fin)
16	15	adantl 481	. . . . 5 ⊢ (((𝐵 ∈ 𝑉 ∧ 𝐹:𝐼⟶𝒫 𝐵) ∧ 𝑣 ∈ (𝒫 𝐼 ∩ Fin)) → 𝑣 ∈ Fin)
17		imafi 9219	. . . . 5 ⊢ ((Fun 𝐹 ∧ 𝑣 ∈ Fin) → (𝐹 “ 𝑣) ∈ Fin)
18	13, 16, 17	syl2anc 585	. . . 4 ⊢ (((𝐵 ∈ 𝑉 ∧ 𝐹:𝐼⟶𝒫 𝐵) ∧ 𝑣 ∈ (𝒫 𝐼 ∩ Fin)) → (𝐹 “ 𝑣) ∈ Fin)
19	11, 18	elind 4153	. . 3 ⊢ (((𝐵 ∈ 𝑉 ∧ 𝐹:𝐼⟶𝒫 𝐵) ∧ 𝑣 ∈ (𝒫 𝐼 ∩ Fin)) → (𝐹 “ 𝑣) ∈ (𝒫 ran 𝐹 ∩ Fin))
20		ffn 6663	. . . . . 6 ⊢ (𝐹:𝐼⟶𝒫 𝐵 → 𝐹 Fn 𝐼)
21	20	ad2antlr 728	. . . . 5 ⊢ (((𝐵 ∈ 𝑉 ∧ 𝐹:𝐼⟶𝒫 𝐵) ∧ 𝑤 ∈ (𝒫 ran 𝐹 ∩ Fin)) → 𝐹 Fn 𝐼)
22		inss1 4190	. . . . . . . 8 ⊢ (𝒫 ran 𝐹 ∩ Fin) ⊆ 𝒫 ran 𝐹
23	22	sseli 3930	. . . . . . 7 ⊢ (𝑤 ∈ (𝒫 ran 𝐹 ∩ Fin) → 𝑤 ∈ 𝒫 ran 𝐹)
24	23	elpwid 4564	. . . . . 6 ⊢ (𝑤 ∈ (𝒫 ran 𝐹 ∩ Fin) → 𝑤 ⊆ ran 𝐹)
25	24	adantl 481	. . . . 5 ⊢ (((𝐵 ∈ 𝑉 ∧ 𝐹:𝐼⟶𝒫 𝐵) ∧ 𝑤 ∈ (𝒫 ran 𝐹 ∩ Fin)) → 𝑤 ⊆ ran 𝐹)
26		inss2 4191	. . . . . . 7 ⊢ (𝒫 ran 𝐹 ∩ Fin) ⊆ Fin
27	26	sseli 3930	. . . . . 6 ⊢ (𝑤 ∈ (𝒫 ran 𝐹 ∩ Fin) → 𝑤 ∈ Fin)
28	27	adantl 481	. . . . 5 ⊢ (((𝐵 ∈ 𝑉 ∧ 𝐹:𝐼⟶𝒫 𝐵) ∧ 𝑤 ∈ (𝒫 ran 𝐹 ∩ Fin)) → 𝑤 ∈ Fin)
29		fipreima 9262	. . . . 5 ⊢ ((𝐹 Fn 𝐼 ∧ 𝑤 ⊆ ran 𝐹 ∧ 𝑤 ∈ Fin) → ∃𝑣 ∈ (𝒫 𝐼 ∩ Fin)(𝐹 “ 𝑣) = 𝑤)
30	21, 25, 28, 29	syl3anc 1374	. . . 4 ⊢ (((𝐵 ∈ 𝑉 ∧ 𝐹:𝐼⟶𝒫 𝐵) ∧ 𝑤 ∈ (𝒫 ran 𝐹 ∩ Fin)) → ∃𝑣 ∈ (𝒫 𝐼 ∩ Fin)(𝐹 “ 𝑣) = 𝑤)
31		eqcom 2744	. . . . 5 ⊢ ((𝐹 “ 𝑣) = 𝑤 ↔ 𝑤 = (𝐹 “ 𝑣))
32	31	rexbii 3084	. . . 4 ⊢ (∃𝑣 ∈ (𝒫 𝐼 ∩ Fin)(𝐹 “ 𝑣) = 𝑤 ↔ ∃𝑣 ∈ (𝒫 𝐼 ∩ Fin)𝑤 = (𝐹 “ 𝑣))
33	30, 32	sylib 218	. . 3 ⊢ (((𝐵 ∈ 𝑉 ∧ 𝐹:𝐼⟶𝒫 𝐵) ∧ 𝑤 ∈ (𝒫 ran 𝐹 ∩ Fin)) → ∃𝑣 ∈ (𝒫 𝐼 ∩ Fin)𝑤 = (𝐹 “ 𝑣))
34		inteq 4906	. . . . . 6 ⊢ (𝑤 = (𝐹 “ 𝑣) → ∩ 𝑤 = ∩ (𝐹 “ 𝑣))
35	34	ineq2d 4173	. . . . 5 ⊢ (𝑤 = (𝐹 “ 𝑣) → (𝐵 ∩ ∩ 𝑤) = (𝐵 ∩ ∩ (𝐹 “ 𝑣)))
36	35	eqeq2d 2748	. . . 4 ⊢ (𝑤 = (𝐹 “ 𝑣) → (𝐴 = (𝐵 ∩ ∩ 𝑤) ↔ 𝐴 = (𝐵 ∩ ∩ (𝐹 “ 𝑣))))
37	36	adantl 481	. . 3 ⊢ (((𝐵 ∈ 𝑉 ∧ 𝐹:𝐼⟶𝒫 𝐵) ∧ 𝑤 = (𝐹 “ 𝑣)) → (𝐴 = (𝐵 ∩ ∩ 𝑤) ↔ 𝐴 = (𝐵 ∩ ∩ (𝐹 “ 𝑣))))
38	19, 33, 37	rexxfrd 5355	. 2 ⊢ ((𝐵 ∈ 𝑉 ∧ 𝐹:𝐼⟶𝒫 𝐵) → (∃𝑤 ∈ (𝒫 ran 𝐹 ∩ Fin)𝐴 = (𝐵 ∩ ∩ 𝑤) ↔ ∃𝑣 ∈ (𝒫 𝐼 ∩ Fin)𝐴 = (𝐵 ∩ ∩ (𝐹 “ 𝑣))))
39	20	ad2antlr 728	. . . . . . 7 ⊢ (((𝐵 ∈ 𝑉 ∧ 𝐹:𝐼⟶𝒫 𝐵) ∧ 𝑣 ∈ (𝒫 𝐼 ∩ Fin)) → 𝐹 Fn 𝐼)
40		inss1 4190	. . . . . . . . . 10 ⊢ (𝒫 𝐼 ∩ Fin) ⊆ 𝒫 𝐼
41	40	sseli 3930	. . . . . . . . 9 ⊢ (𝑣 ∈ (𝒫 𝐼 ∩ Fin) → 𝑣 ∈ 𝒫 𝐼)
42	41	elpwid 4564	. . . . . . . 8 ⊢ (𝑣 ∈ (𝒫 𝐼 ∩ Fin) → 𝑣 ⊆ 𝐼)
43	42	adantl 481	. . . . . . 7 ⊢ (((𝐵 ∈ 𝑉 ∧ 𝐹:𝐼⟶𝒫 𝐵) ∧ 𝑣 ∈ (𝒫 𝐼 ∩ Fin)) → 𝑣 ⊆ 𝐼)
44		imaiinfv 43002	. . . . . . 7 ⊢ ((𝐹 Fn 𝐼 ∧ 𝑣 ⊆ 𝐼) → ∩ 𝑦 ∈ 𝑣 (𝐹‘𝑦) = ∩ (𝐹 “ 𝑣))
45	39, 43, 44	syl2anc 585	. . . . . 6 ⊢ (((𝐵 ∈ 𝑉 ∧ 𝐹:𝐼⟶𝒫 𝐵) ∧ 𝑣 ∈ (𝒫 𝐼 ∩ Fin)) → ∩ 𝑦 ∈ 𝑣 (𝐹‘𝑦) = ∩ (𝐹 “ 𝑣))
46	45	eqcomd 2743	. . . . 5 ⊢ (((𝐵 ∈ 𝑉 ∧ 𝐹:𝐼⟶𝒫 𝐵) ∧ 𝑣 ∈ (𝒫 𝐼 ∩ Fin)) → ∩ (𝐹 “ 𝑣) = ∩ 𝑦 ∈ 𝑣 (𝐹‘𝑦))
47	46	ineq2d 4173	. . . 4 ⊢ (((𝐵 ∈ 𝑉 ∧ 𝐹:𝐼⟶𝒫 𝐵) ∧ 𝑣 ∈ (𝒫 𝐼 ∩ Fin)) → (𝐵 ∩ ∩ (𝐹 “ 𝑣)) = (𝐵 ∩ ∩ 𝑦 ∈ 𝑣 (𝐹‘𝑦)))
48	47	eqeq2d 2748	. . 3 ⊢ (((𝐵 ∈ 𝑉 ∧ 𝐹:𝐼⟶𝒫 𝐵) ∧ 𝑣 ∈ (𝒫 𝐼 ∩ Fin)) → (𝐴 = (𝐵 ∩ ∩ (𝐹 “ 𝑣)) ↔ 𝐴 = (𝐵 ∩ ∩ 𝑦 ∈ 𝑣 (𝐹‘𝑦))))
49	48	rexbidva 3159	. 2 ⊢ ((𝐵 ∈ 𝑉 ∧ 𝐹:𝐼⟶𝒫 𝐵) → (∃𝑣 ∈ (𝒫 𝐼 ∩ Fin)𝐴 = (𝐵 ∩ ∩ (𝐹 “ 𝑣)) ↔ ∃𝑣 ∈ (𝒫 𝐼 ∩ Fin)𝐴 = (𝐵 ∩ ∩ 𝑦 ∈ 𝑣 (𝐹‘𝑦))))
50	3, 38, 49	3bitrd 305	1 ⊢ ((𝐵 ∈ 𝑉 ∧ 𝐹:𝐼⟶𝒫 𝐵) → (𝐴 ∈ (fi‘({𝐵} ∪ ran 𝐹)) ↔ ∃𝑣 ∈ (𝒫 𝐼 ∩ Fin)𝐴 = (𝐵 ∩ ∩ 𝑦 ∈ 𝑣 (𝐹‘𝑦))))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   = wceq 1542   ∈ wcel 2114  ∃wrex 3061  Vcvv 3441   ∪ cun 3900   ∩ cin 3901   ⊆ wss 3902  𝒫 cpw 4555  {csn 4581  ∩ cint 4903  ∩ ciin 4948  ran crn 5626   “ cima 5628  Fun wfun 6487   Fn wfn 6488  ⟶wf 6489  ‘cfv 6493  Fincfn 8887  ficfi 9317

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-sep 5242  ax-nul 5252  ax-pow 5311  ax-pr 5378  ax-un 7682

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-ral 3053  df-rex 3062  df-reu 3352  df-rab 3401  df-v 3443  df-sbc 3742  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-pss 3922  df-nul 4287  df-if 4481  df-pw 4557  df-sn 4582  df-pr 4584  df-op 4588  df-uni 4865  df-int 4904  df-iin 4950  df-br 5100  df-opab 5162  df-mpt 5181  df-tr 5207  df-id 5520  df-eprel 5525  df-po 5533  df-so 5534  df-fr 5578  df-we 5580  df-xp 5631  df-rel 5632  df-cnv 5633  df-co 5634  df-dm 5635  df-rn 5636  df-res 5637  df-ima 5638  df-ord 6321  df-on 6322  df-lim 6323  df-suc 6324  df-iota 6449  df-fun 6495  df-fn 6496  df-f 6497  df-f1 6498  df-fo 6499  df-f1o 6500  df-fv 6501  df-om 7811  df-1o 8399  df-en 8888  df-dom 8889  df-fin 8891  df-fi 9318

This theorem is referenced by:  elrfirn2  43005