Theorem elfm 21561

Description: An element of a mapping filter. (Contributed by Jeff Hankins, 8-Sep-2009.) (Revised by Stefan O'Rear, 6-Aug-2015.)

Assertion

Ref	Expression
elfm	⊢ ((𝑋 ∈ 𝐶 ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌⟶𝑋) → (𝐴 ∈ ((𝑋 FilMap 𝐹)‘𝐵) ↔ (𝐴 ⊆ 𝑋 ∧ ∃𝑥 ∈ 𝐵 (𝐹 “ 𝑥) ⊆ 𝐴)))

Distinct variable groups:   𝑥,𝐵   𝑥,𝐶   𝑥,𝐹   𝑥,𝑋   𝑥,𝐴   𝑥,𝑌

Proof of Theorem elfm

Dummy variables 𝑡 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		fmval 21557	. . 3 ⊢ ((𝑋 ∈ 𝐶 ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌⟶𝑋) → ((𝑋 FilMap 𝐹)‘𝐵) = (𝑋filGenran (𝑡 ∈ 𝐵 ↦ (𝐹 “ 𝑡))))
2	1	eleq2d 2673	. 2 ⊢ ((𝑋 ∈ 𝐶 ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌⟶𝑋) → (𝐴 ∈ ((𝑋 FilMap 𝐹)‘𝐵) ↔ 𝐴 ∈ (𝑋filGenran (𝑡 ∈ 𝐵 ↦ (𝐹 “ 𝑡)))))
3		eqid 2610	. . . . 5 ⊢ ran (𝑡 ∈ 𝐵 ↦ (𝐹 “ 𝑡)) = ran (𝑡 ∈ 𝐵 ↦ (𝐹 “ 𝑡))
4	3	fbasrn 21498	. . . 4 ⊢ ((𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌⟶𝑋 ∧ 𝑋 ∈ 𝐶) → ran (𝑡 ∈ 𝐵 ↦ (𝐹 “ 𝑡)) ∈ (fBas‘𝑋))
5	4	3comr 1265	. . 3 ⊢ ((𝑋 ∈ 𝐶 ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌⟶𝑋) → ran (𝑡 ∈ 𝐵 ↦ (𝐹 “ 𝑡)) ∈ (fBas‘𝑋))
6		elfg 21485	. . 3 ⊢ (ran (𝑡 ∈ 𝐵 ↦ (𝐹 “ 𝑡)) ∈ (fBas‘𝑋) → (𝐴 ∈ (𝑋filGenran (𝑡 ∈ 𝐵 ↦ (𝐹 “ 𝑡))) ↔ (𝐴 ⊆ 𝑋 ∧ ∃𝑦 ∈ ran (𝑡 ∈ 𝐵 ↦ (𝐹 “ 𝑡))𝑦 ⊆ 𝐴)))
7	5, 6	syl 17	. 2 ⊢ ((𝑋 ∈ 𝐶 ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌⟶𝑋) → (𝐴 ∈ (𝑋filGenran (𝑡 ∈ 𝐵 ↦ (𝐹 “ 𝑡))) ↔ (𝐴 ⊆ 𝑋 ∧ ∃𝑦 ∈ ran (𝑡 ∈ 𝐵 ↦ (𝐹 “ 𝑡))𝑦 ⊆ 𝐴)))
8		simpr 476	. . . . . 6 ⊢ (((𝑋 ∈ 𝐶 ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌⟶𝑋) ∧ 𝑥 ∈ 𝐵) → 𝑥 ∈ 𝐵)
9		eqid 2610	. . . . . 6 ⊢ (𝐹 “ 𝑥) = (𝐹 “ 𝑥)
10		imaeq2 5381	. . . . . . . 8 ⊢ (𝑡 = 𝑥 → (𝐹 “ 𝑡) = (𝐹 “ 𝑥))
11	10	eqeq2d 2620	. . . . . . 7 ⊢ (𝑡 = 𝑥 → ((𝐹 “ 𝑥) = (𝐹 “ 𝑡) ↔ (𝐹 “ 𝑥) = (𝐹 “ 𝑥)))
12	11	rspcev 3282	. . . . . 6 ⊢ ((𝑥 ∈ 𝐵 ∧ (𝐹 “ 𝑥) = (𝐹 “ 𝑥)) → ∃𝑡 ∈ 𝐵 (𝐹 “ 𝑥) = (𝐹 “ 𝑡))
13	8, 9, 12	sylancl 693	. . . . 5 ⊢ (((𝑋 ∈ 𝐶 ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌⟶𝑋) ∧ 𝑥 ∈ 𝐵) → ∃𝑡 ∈ 𝐵 (𝐹 “ 𝑥) = (𝐹 “ 𝑡))
14		simpl1 1057	. . . . . . 7 ⊢ (((𝑋 ∈ 𝐶 ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌⟶𝑋) ∧ 𝑥 ∈ 𝐵) → 𝑋 ∈ 𝐶)
15		imassrn 5396	. . . . . . . 8 ⊢ (𝐹 “ 𝑥) ⊆ ran 𝐹
16		frn 5966	. . . . . . . . . 10 ⊢ (𝐹:𝑌⟶𝑋 → ran 𝐹 ⊆ 𝑋)
17	16	3ad2ant3 1077	. . . . . . . . 9 ⊢ ((𝑋 ∈ 𝐶 ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌⟶𝑋) → ran 𝐹 ⊆ 𝑋)
18	17	adantr 480	. . . . . . . 8 ⊢ (((𝑋 ∈ 𝐶 ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌⟶𝑋) ∧ 𝑥 ∈ 𝐵) → ran 𝐹 ⊆ 𝑋)
19	15, 18	syl5ss 3579	. . . . . . 7 ⊢ (((𝑋 ∈ 𝐶 ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌⟶𝑋) ∧ 𝑥 ∈ 𝐵) → (𝐹 “ 𝑥) ⊆ 𝑋)
20	14, 19	ssexd 4733	. . . . . 6 ⊢ (((𝑋 ∈ 𝐶 ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌⟶𝑋) ∧ 𝑥 ∈ 𝐵) → (𝐹 “ 𝑥) ∈ V)
21		eqid 2610	. . . . . . 7 ⊢ (𝑡 ∈ 𝐵 ↦ (𝐹 “ 𝑡)) = (𝑡 ∈ 𝐵 ↦ (𝐹 “ 𝑡))
22	21	elrnmpt 5293	. . . . . 6 ⊢ ((𝐹 “ 𝑥) ∈ V → ((𝐹 “ 𝑥) ∈ ran (𝑡 ∈ 𝐵 ↦ (𝐹 “ 𝑡)) ↔ ∃𝑡 ∈ 𝐵 (𝐹 “ 𝑥) = (𝐹 “ 𝑡)))
23	20, 22	syl 17	. . . . 5 ⊢ (((𝑋 ∈ 𝐶 ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌⟶𝑋) ∧ 𝑥 ∈ 𝐵) → ((𝐹 “ 𝑥) ∈ ran (𝑡 ∈ 𝐵 ↦ (𝐹 “ 𝑡)) ↔ ∃𝑡 ∈ 𝐵 (𝐹 “ 𝑥) = (𝐹 “ 𝑡)))
24	13, 23	mpbird 246	. . . 4 ⊢ (((𝑋 ∈ 𝐶 ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌⟶𝑋) ∧ 𝑥 ∈ 𝐵) → (𝐹 “ 𝑥) ∈ ran (𝑡 ∈ 𝐵 ↦ (𝐹 “ 𝑡)))
25	10	cbvmptv 4678	. . . . . . 7 ⊢ (𝑡 ∈ 𝐵 ↦ (𝐹 “ 𝑡)) = (𝑥 ∈ 𝐵 ↦ (𝐹 “ 𝑥))
26	25	elrnmpt 5293	. . . . . 6 ⊢ (𝑦 ∈ ran (𝑡 ∈ 𝐵 ↦ (𝐹 “ 𝑡)) → (𝑦 ∈ ran (𝑡 ∈ 𝐵 ↦ (𝐹 “ 𝑡)) ↔ ∃𝑥 ∈ 𝐵 𝑦 = (𝐹 “ 𝑥)))
27	26	ibi 255	. . . . 5 ⊢ (𝑦 ∈ ran (𝑡 ∈ 𝐵 ↦ (𝐹 “ 𝑡)) → ∃𝑥 ∈ 𝐵 𝑦 = (𝐹 “ 𝑥))
28	27	adantl 481	. . . 4 ⊢ (((𝑋 ∈ 𝐶 ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌⟶𝑋) ∧ 𝑦 ∈ ran (𝑡 ∈ 𝐵 ↦ (𝐹 “ 𝑡))) → ∃𝑥 ∈ 𝐵 𝑦 = (𝐹 “ 𝑥))
29		simpr 476	. . . . 5 ⊢ (((𝑋 ∈ 𝐶 ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌⟶𝑋) ∧ 𝑦 = (𝐹 “ 𝑥)) → 𝑦 = (𝐹 “ 𝑥))
30	29	sseq1d 3595	. . . 4 ⊢ (((𝑋 ∈ 𝐶 ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌⟶𝑋) ∧ 𝑦 = (𝐹 “ 𝑥)) → (𝑦 ⊆ 𝐴 ↔ (𝐹 “ 𝑥) ⊆ 𝐴))
31	24, 28, 30	rexxfrd 4807	. . 3 ⊢ ((𝑋 ∈ 𝐶 ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌⟶𝑋) → (∃𝑦 ∈ ran (𝑡 ∈ 𝐵 ↦ (𝐹 “ 𝑡))𝑦 ⊆ 𝐴 ↔ ∃𝑥 ∈ 𝐵 (𝐹 “ 𝑥) ⊆ 𝐴))
32	31	anbi2d 736	. 2 ⊢ ((𝑋 ∈ 𝐶 ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌⟶𝑋) → ((𝐴 ⊆ 𝑋 ∧ ∃𝑦 ∈ ran (𝑡 ∈ 𝐵 ↦ (𝐹 “ 𝑡))𝑦 ⊆ 𝐴) ↔ (𝐴 ⊆ 𝑋 ∧ ∃𝑥 ∈ 𝐵 (𝐹 “ 𝑥) ⊆ 𝐴)))
33	2, 7, 32	3bitrd 293	1 ⊢ ((𝑋 ∈ 𝐶 ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌⟶𝑋) → (𝐴 ∈ ((𝑋 FilMap 𝐹)‘𝐵) ↔ (𝐴 ⊆ 𝑋 ∧ ∃𝑥 ∈ 𝐵 (𝐹 “ 𝑥) ⊆ 𝐴)))

Syntax hints:   → wi 4   ↔ wb 195   ∧ wa 383   ∧ w3a 1031   = wceq 1475   ∈ wcel 1977  ∃wrex 2897  Vcvv 3173   ⊆ wss 3540   ↦ cmpt 4643  ran crn 5039   “ cima 5041  ⟶wf 5800  ‘cfv 5804  (class class class)co 6549  fBascfbas 19555  filGencfg 19556   FilMap cfm 21547

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-8 1979  ax-9 1986  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590  ax-rep 4699  ax-sep 4709  ax-nul 4717  ax-pow 4769  ax-pr 4833  ax-un 6847

This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-3an 1033  df-tru 1478  df-ex 1696  df-nf 1701  df-sb 1868  df-eu 2462  df-mo 2463  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-ne 2782  df-nel 2783  df-ral 2901  df-rex 2902  df-reu 2903  df-rab 2905  df-v 3175  df-sbc 3403  df-csb 3500  df-dif 3543  df-un 3545  df-in 3547  df-ss 3554  df-nul 3875  df-if 4037  df-pw 4110  df-sn 4126  df-pr 4128  df-op 4132  df-uni 4373  df-iun 4457  df-br 4584  df-opab 4644  df-mpt 4645  df-id 4953  df-xp 5044  df-rel 5045  df-cnv 5046  df-co 5047  df-dm 5048  df-rn 5049  df-res 5050  df-ima 5051  df-iota 5768  df-fun 5806  df-fn 5807  df-f 5808  df-f1 5809  df-fo 5810  df-f1o 5811  df-fv 5812  df-ov 6552  df-oprab 6553  df-mpt2 6554  df-fbas 19564  df-fg 19565  df-fm 21552

This theorem is referenced by:  elfm2  21562  fmfg  21563  rnelfm  21567  fmfnfmlem1  21568  fmfnfm  21572  fmco  21575  flfnei  21605  isflf  21607  isfcf  21648  filnetlem4  31546