Theorem elfm 24176

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 24172	. . 3 ⊢ ((𝑋 ∈ 𝐶 ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌⟶𝑋) → ((𝑋 FilMap 𝐹)‘𝐵) = (𝑋filGenran (𝑡 ∈ 𝐵 ↦ (𝐹 “ 𝑡))))
2	1	eleq2d 2846	. 2 ⊢ ((𝑋 ∈ 𝐶 ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌⟶𝑋) → (𝐴 ∈ ((𝑋 FilMap 𝐹)‘𝐵) ↔ 𝐴 ∈ (𝑋filGenran (𝑡 ∈ 𝐵 ↦ (𝐹 “ 𝑡)))))
3		eqid 2760	. . . . 5 ⊢ ran (𝑡 ∈ 𝐵 ↦ (𝐹 “ 𝑡)) = ran (𝑡 ∈ 𝐵 ↦ (𝐹 “ 𝑡))
4	3	fbasrn 24113	. . . 4 ⊢ ((𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌⟶𝑋 ∧ 𝑋 ∈ 𝐶) → ran (𝑡 ∈ 𝐵 ↦ (𝐹 “ 𝑡)) ∈ (fBas‘𝑋))
5	4	3comr 1143	. . 3 ⊢ ((𝑋 ∈ 𝐶 ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌⟶𝑋) → ran (𝑡 ∈ 𝐵 ↦ (𝐹 “ 𝑡)) ∈ (fBas‘𝑋))
6		elfg 24100	. . 3 ⊢ (ran (𝑡 ∈ 𝐵 ↦ (𝐹 “ 𝑡)) ∈ (fBas‘𝑋) → (𝐴 ∈ (𝑋filGenran (𝑡 ∈ 𝐵 ↦ (𝐹 “ 𝑡))) ↔ (𝐴 ⊆ 𝑋 ∧ ∃𝑦 ∈ ran (𝑡 ∈ 𝐵 ↦ (𝐹 “ 𝑡))𝑦 ⊆ 𝐴)))
7	5, 6	syl 18	. 2 ⊢ ((𝑋 ∈ 𝐶 ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌⟶𝑋) → (𝐴 ∈ (𝑋filGenran (𝑡 ∈ 𝐵 ↦ (𝐹 “ 𝑡))) ↔ (𝐴 ⊆ 𝑋 ∧ ∃𝑦 ∈ ran (𝑡 ∈ 𝐵 ↦ (𝐹 “ 𝑡))𝑦 ⊆ 𝐴)))
8		simpr 490	. . . . . 6 ⊢ (((𝑋 ∈ 𝐶 ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌⟶𝑋) ∧ 𝑥 ∈ 𝐵) → 𝑥 ∈ 𝐵)
9		eqid 2760	. . . . . 6 ⊢ (𝐹 “ 𝑥) = (𝐹 “ 𝑥)
10		imaeq2 6052	. . . . . . 7 ⊢ (𝑡 = 𝑥 → (𝐹 “ 𝑡) = (𝐹 “ 𝑥))
11	10	rspceeqv 3599	. . . . . 6 ⊢ ((𝑥 ∈ 𝐵 ∧ (𝐹 “ 𝑥) = (𝐹 “ 𝑥)) → ∃𝑡 ∈ 𝐵 (𝐹 “ 𝑥) = (𝐹 “ 𝑡))
12	8, 9, 11	sylancl 598	. . . . 5 ⊢ (((𝑋 ∈ 𝐶 ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌⟶𝑋) ∧ 𝑥 ∈ 𝐵) → ∃𝑡 ∈ 𝐵 (𝐹 “ 𝑥) = (𝐹 “ 𝑡))
13		simpl1 1210	. . . . . . 7 ⊢ (((𝑋 ∈ 𝐶 ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌⟶𝑋) ∧ 𝑥 ∈ 𝐵) → 𝑋 ∈ 𝐶)
14		imassrn 6067	. . . . . . . 8 ⊢ (𝐹 “ 𝑥) ⊆ ran 𝐹
15		frn 6711	. . . . . . . . . 10 ⊢ (𝐹:𝑌⟶𝑋 → ran 𝐹 ⊆ 𝑋)
16	15	3ad2ant3 1153	. . . . . . . . 9 ⊢ ((𝑋 ∈ 𝐶 ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌⟶𝑋) → ran 𝐹 ⊆ 𝑋)
17	16	adantr 486	. . . . . . . 8 ⊢ (((𝑋 ∈ 𝐶 ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌⟶𝑋) ∧ 𝑥 ∈ 𝐵) → ran 𝐹 ⊆ 𝑋)
18	14, 17	sstrid 3942	. . . . . . 7 ⊢ (((𝑋 ∈ 𝐶 ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌⟶𝑋) ∧ 𝑥 ∈ 𝐵) → (𝐹 “ 𝑥) ⊆ 𝑋)
19	13, 18	ssexd 5289	. . . . . 6 ⊢ (((𝑋 ∈ 𝐶 ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌⟶𝑋) ∧ 𝑥 ∈ 𝐵) → (𝐹 “ 𝑥) ∈ V)
20		eqid 2760	. . . . . . 7 ⊢ (𝑡 ∈ 𝐵 ↦ (𝐹 “ 𝑡)) = (𝑡 ∈ 𝐵 ↦ (𝐹 “ 𝑡))
21	20	elrnmpt 5942	. . . . . 6 ⊢ ((𝐹 “ 𝑥) ∈ V → ((𝐹 “ 𝑥) ∈ ran (𝑡 ∈ 𝐵 ↦ (𝐹 “ 𝑡)) ↔ ∃𝑡 ∈ 𝐵 (𝐹 “ 𝑥) = (𝐹 “ 𝑡)))
22	19, 21	syl 18	. . . . 5 ⊢ (((𝑋 ∈ 𝐶 ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌⟶𝑋) ∧ 𝑥 ∈ 𝐵) → ((𝐹 “ 𝑥) ∈ ran (𝑡 ∈ 𝐵 ↦ (𝐹 “ 𝑡)) ↔ ∃𝑡 ∈ 𝐵 (𝐹 “ 𝑥) = (𝐹 “ 𝑡)))
23	12, 22	mpbird 260	. . . 4 ⊢ (((𝑋 ∈ 𝐶 ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌⟶𝑋) ∧ 𝑥 ∈ 𝐵) → (𝐹 “ 𝑥) ∈ ran (𝑡 ∈ 𝐵 ↦ (𝐹 “ 𝑡)))
24	10	cbvmptv 5209	. . . . . . 7 ⊢ (𝑡 ∈ 𝐵 ↦ (𝐹 “ 𝑡)) = (𝑥 ∈ 𝐵 ↦ (𝐹 “ 𝑥))
25	24	elrnmpt 5942	. . . . . 6 ⊢ (𝑦 ∈ ran (𝑡 ∈ 𝐵 ↦ (𝐹 “ 𝑡)) → (𝑦 ∈ ran (𝑡 ∈ 𝐵 ↦ (𝐹 “ 𝑡)) ↔ ∃𝑥 ∈ 𝐵 𝑦 = (𝐹 “ 𝑥)))
26	25	ibi 270	. . . . 5 ⊢ (𝑦 ∈ ran (𝑡 ∈ 𝐵 ↦ (𝐹 “ 𝑡)) → ∃𝑥 ∈ 𝐵 𝑦 = (𝐹 “ 𝑥))
27	26	adantl 487	. . . 4 ⊢ (((𝑋 ∈ 𝐶 ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌⟶𝑋) ∧ 𝑦 ∈ ran (𝑡 ∈ 𝐵 ↦ (𝐹 “ 𝑡))) → ∃𝑥 ∈ 𝐵 𝑦 = (𝐹 “ 𝑥))
28		simpr 490	. . . . 5 ⊢ (((𝑋 ∈ 𝐶 ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌⟶𝑋) ∧ 𝑦 = (𝐹 “ 𝑥)) → 𝑦 = (𝐹 “ 𝑥))
29	28	sseq1d 3962	. . . 4 ⊢ (((𝑋 ∈ 𝐶 ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌⟶𝑋) ∧ 𝑦 = (𝐹 “ 𝑥)) → (𝑦 ⊆ 𝐴 ↔ (𝐹 “ 𝑥) ⊆ 𝐴))
30	23, 27, 29	rexxfrd 5374	. . 3 ⊢ ((𝑋 ∈ 𝐶 ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌⟶𝑋) → (∃𝑦 ∈ ran (𝑡 ∈ 𝐵 ↦ (𝐹 “ 𝑡))𝑦 ⊆ 𝐴 ↔ ∃𝑥 ∈ 𝐵 (𝐹 “ 𝑥) ⊆ 𝐴))
31	30	anbi2d 642	. 2 ⊢ ((𝑋 ∈ 𝐶 ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌⟶𝑋) → ((𝐴 ⊆ 𝑋 ∧ ∃𝑦 ∈ ran (𝑡 ∈ 𝐵 ↦ (𝐹 “ 𝑡))𝑦 ⊆ 𝐴) ↔ (𝐴 ⊆ 𝑋 ∧ ∃𝑥 ∈ 𝐵 (𝐹 “ 𝑥) ⊆ 𝐴)))
32	2, 7, 31	3bitrd 308	1 ⊢ ((𝑋 ∈ 𝐶 ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌⟶𝑋) → (𝐴 ∈ ((𝑋 FilMap 𝐹)‘𝐵) ↔ (𝐴 ⊆ 𝑋 ∧ ∃𝑥 ∈ 𝐵 (𝐹 “ 𝑥) ⊆ 𝐴)))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2145  ∃wrex 3086  Vcvv 3450   ⊆ wss 3899   ↦ cmpt 5186  ran crn 5656   “ cima 5658  ⟶wf 6529  ‘cfv 6533  (class class class)co 7414  fBascfbas 21576  filGencfg 21577   FilMap cfm 24162

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-rep 5232  ax-sep 5251  ax-nul 5263  ax-pow 5330  ax-pr 5398

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  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-nel 3062  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-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  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 6489  df-fun 6535  df-fn 6536  df-f 6537  df-f1 6538  df-fo 6539  df-f1o 6540  df-fv 6541  df-ov 7417  df-oprab 7418  df-mpo 7419  df-fbas 21585  df-fg 21586  df-fm 24167

This theorem is used by:  elfm2  24177  fmfg  24178  rnelfm  24182  fmfnfmlem1  24183  fmfnfm  24187  fmco  24190  flfnei  24220  isflf  24222  isfcf  24263  filnetlem4  37003