Theorem elfm 24113

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 24109	. . 3 ⊢ ((𝑋 ∈ 𝐶 ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌⟶𝑋) → ((𝑋 FilMap 𝐹)‘𝐵) = (𝑋filGenran (𝑡 ∈ 𝐵 ↦ (𝐹 “ 𝑡))))
2	1	eleq2d 2849	. 2 ⊢ ((𝑋 ∈ 𝐶 ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌⟶𝑋) → (𝐴 ∈ ((𝑋 FilMap 𝐹)‘𝐵) ↔ 𝐴 ∈ (𝑋filGenran (𝑡 ∈ 𝐵 ↦ (𝐹 “ 𝑡)))))
3		eqid 2763	. . . . 5 ⊢ ran (𝑡 ∈ 𝐵 ↦ (𝐹 “ 𝑡)) = ran (𝑡 ∈ 𝐵 ↦ (𝐹 “ 𝑡))
4	3	fbasrn 24050	. . . 4 ⊢ ((𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌⟶𝑋 ∧ 𝑋 ∈ 𝐶) → ran (𝑡 ∈ 𝐵 ↦ (𝐹 “ 𝑡)) ∈ (fBas‘𝑋))
5	4	3comr 1143	. . 3 ⊢ ((𝑋 ∈ 𝐶 ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌⟶𝑋) → ran (𝑡 ∈ 𝐵 ↦ (𝐹 “ 𝑡)) ∈ (fBas‘𝑋))
6		elfg 24037	. . 3 ⊢ (ran (𝑡 ∈ 𝐵 ↦ (𝐹 “ 𝑡)) ∈ (fBas‘𝑋) → (𝐴 ∈ (𝑋filGenran (𝑡 ∈ 𝐵 ↦ (𝐹 “ 𝑡))) ↔ (𝐴 ⊆ 𝑋 ∧ ∃𝑦 ∈ ran (𝑡 ∈ 𝐵 ↦ (𝐹 “ 𝑡))𝑦 ⊆ 𝐴)))
7	5, 6	syl 18	. 2 ⊢ ((𝑋 ∈ 𝐶 ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌⟶𝑋) → (𝐴 ∈ (𝑋filGenran (𝑡 ∈ 𝐵 ↦ (𝐹 “ 𝑡))) ↔ (𝐴 ⊆ 𝑋 ∧ ∃𝑦 ∈ ran (𝑡 ∈ 𝐵 ↦ (𝐹 “ 𝑡))𝑦 ⊆ 𝐴)))
8		simpr 489	. . . . . 6 ⊢ (((𝑋 ∈ 𝐶 ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌⟶𝑋) ∧ 𝑥 ∈ 𝐵) → 𝑥 ∈ 𝐵)
9		eqid 2763	. . . . . 6 ⊢ (𝐹 “ 𝑥) = (𝐹 “ 𝑥)
10		imaeq2 6058	. . . . . . 7 ⊢ (𝑡 = 𝑥 → (𝐹 “ 𝑡) = (𝐹 “ 𝑥))
11	10	rspceeqv 3604	. . . . . 6 ⊢ ((𝑥 ∈ 𝐵 ∧ (𝐹 “ 𝑥) = (𝐹 “ 𝑥)) → ∃𝑡 ∈ 𝐵 (𝐹 “ 𝑥) = (𝐹 “ 𝑡))
12	8, 9, 11	sylancl 597	. . . . 5 ⊢ (((𝑋 ∈ 𝐶 ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌⟶𝑋) ∧ 𝑥 ∈ 𝐵) → ∃𝑡 ∈ 𝐵 (𝐹 “ 𝑥) = (𝐹 “ 𝑡))
13		simpl1 1210	. . . . . . 7 ⊢ (((𝑋 ∈ 𝐶 ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌⟶𝑋) ∧ 𝑥 ∈ 𝐵) → 𝑋 ∈ 𝐶)
14		imassrn 6073	. . . . . . . 8 ⊢ (𝐹 “ 𝑥) ⊆ ran 𝐹
15		frn 6713	. . . . . . . . . 10 ⊢ (𝐹:𝑌⟶𝑋 → ran 𝐹 ⊆ 𝑋)
16	15	3ad2ant3 1153	. . . . . . . . 9 ⊢ ((𝑋 ∈ 𝐶 ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌⟶𝑋) → ran 𝐹 ⊆ 𝑋)
17	16	adantr 485	. . . . . . . 8 ⊢ (((𝑋 ∈ 𝐶 ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌⟶𝑋) ∧ 𝑥 ∈ 𝐵) → ran 𝐹 ⊆ 𝑋)
18	14, 17	sstrid 3948	. . . . . . 7 ⊢ (((𝑋 ∈ 𝐶 ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌⟶𝑋) ∧ 𝑥 ∈ 𝐵) → (𝐹 “ 𝑥) ⊆ 𝑋)
19	13, 18	ssexd 5295	. . . . . 6 ⊢ (((𝑋 ∈ 𝐶 ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌⟶𝑋) ∧ 𝑥 ∈ 𝐵) → (𝐹 “ 𝑥) ∈ V)
20		eqid 2763	. . . . . . 7 ⊢ (𝑡 ∈ 𝐵 ↦ (𝐹 “ 𝑡)) = (𝑡 ∈ 𝐵 ↦ (𝐹 “ 𝑡))
21	20	elrnmpt 5948	. . . . . 6 ⊢ ((𝐹 “ 𝑥) ∈ V → ((𝐹 “ 𝑥) ∈ ran (𝑡 ∈ 𝐵 ↦ (𝐹 “ 𝑡)) ↔ ∃𝑡 ∈ 𝐵 (𝐹 “ 𝑥) = (𝐹 “ 𝑡)))
22	19, 21	syl 18	. . . . 5 ⊢ (((𝑋 ∈ 𝐶 ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌⟶𝑋) ∧ 𝑥 ∈ 𝐵) → ((𝐹 “ 𝑥) ∈ ran (𝑡 ∈ 𝐵 ↦ (𝐹 “ 𝑡)) ↔ ∃𝑡 ∈ 𝐵 (𝐹 “ 𝑥) = (𝐹 “ 𝑡)))
23	12, 22	mpbird 260	. . . 4 ⊢ (((𝑋 ∈ 𝐶 ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌⟶𝑋) ∧ 𝑥 ∈ 𝐵) → (𝐹 “ 𝑥) ∈ ran (𝑡 ∈ 𝐵 ↦ (𝐹 “ 𝑡)))
24	10	cbvmptv 5215	. . . . . . 7 ⊢ (𝑡 ∈ 𝐵 ↦ (𝐹 “ 𝑡)) = (𝑥 ∈ 𝐵 ↦ (𝐹 “ 𝑥))
25	24	elrnmpt 5948	. . . . . 6 ⊢ (𝑦 ∈ ran (𝑡 ∈ 𝐵 ↦ (𝐹 “ 𝑡)) → (𝑦 ∈ ran (𝑡 ∈ 𝐵 ↦ (𝐹 “ 𝑡)) ↔ ∃𝑥 ∈ 𝐵 𝑦 = (𝐹 “ 𝑥)))
26	25	ibi 270	. . . . 5 ⊢ (𝑦 ∈ ran (𝑡 ∈ 𝐵 ↦ (𝐹 “ 𝑡)) → ∃𝑥 ∈ 𝐵 𝑦 = (𝐹 “ 𝑥))
27	26	adantl 486	. . . 4 ⊢ (((𝑋 ∈ 𝐶 ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌⟶𝑋) ∧ 𝑦 ∈ ran (𝑡 ∈ 𝐵 ↦ (𝐹 “ 𝑡))) → ∃𝑥 ∈ 𝐵 𝑦 = (𝐹 “ 𝑥))
28		simpr 489	. . . . 5 ⊢ (((𝑋 ∈ 𝐶 ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌⟶𝑋) ∧ 𝑦 = (𝐹 “ 𝑥)) → 𝑦 = (𝐹 “ 𝑥))
29	28	sseq1d 3968	. . . 4 ⊢ (((𝑋 ∈ 𝐶 ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌⟶𝑋) ∧ 𝑦 = (𝐹 “ 𝑥)) → (𝑦 ⊆ 𝐴 ↔ (𝐹 “ 𝑥) ⊆ 𝐴))
30	23, 27, 29	rexxfrd 5380	. . 3 ⊢ ((𝑋 ∈ 𝐶 ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌⟶𝑋) → (∃𝑦 ∈ ran (𝑡 ∈ 𝐵 ↦ (𝐹 “ 𝑡))𝑦 ⊆ 𝐴 ↔ ∃𝑥 ∈ 𝐵 (𝐹 “ 𝑥) ⊆ 𝐴))
31	30	anbi2d 641	. 2 ⊢ ((𝑋 ∈ 𝐶 ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌⟶𝑋) → ((𝐴 ⊆ 𝑋 ∧ ∃𝑦 ∈ ran (𝑡 ∈ 𝐵 ↦ (𝐹 “ 𝑡))𝑦 ⊆ 𝐴) ↔ (𝐴 ⊆ 𝑋 ∧ ∃𝑥 ∈ 𝐵 (𝐹 “ 𝑥) ⊆ 𝐴)))
32	2, 7, 31	3bitrd 308	1 ⊢ ((𝑋 ∈ 𝐶 ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌⟶𝑋) → (𝐴 ∈ ((𝑋 FilMap 𝐹)‘𝐵) ↔ (𝐴 ⊆ 𝑋 ∧ ∃𝑥 ∈ 𝐵 (𝐹 “ 𝑥) ⊆ 𝐴)))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 400   ∧ w3a 1103   = wceq 1570   ∈ wcel 2143  ∃wrex 3089  Vcvv 3455   ⊆ wss 3905   ↦ cmpt 5192  ran crn 5662   “ cima 5664  ⟶wf 6532  ‘cfv 6536  (class class class)co 7410  fBascfbas 21519  filGencfg 21520   FilMap cfm 24099

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-10 2176  ax-11 2192  ax-12 2213  ax-ext 2735  ax-rep 5238  ax-sep 5257  ax-nul 5269  ax-pow 5336  ax-pr 5404

This proof depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-nf 1814  df-sb 2097  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2838  df-nfc 2912  df-ne 2959  df-nel 3065  df-ral 3080  df-rex 3090  df-reu 3370  df-rab 3417  df-v 3457  df-sbc 3745  df-csb 3854  df-dif 3908  df-un 3910  df-in 3912  df-ss 3922  df-nul 4287  df-if 4488  df-pw 4564  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4873  df-iun 4958  df-br 5110  df-opab 5174  df-mpt 5193  df-id 5556  df-xp 5667  df-rel 5668  df-cnv 5669  df-co 5670  df-dm 5671  df-rn 5672  df-res 5673  df-ima 5674  df-iota 6492  df-fun 6538  df-fn 6539  df-f 6540  df-f1 6541  df-fo 6542  df-f1o 6543  df-fv 6544  df-ov 7413  df-oprab 7414  df-mpo 7415  df-fbas 21528  df-fg 21529  df-fm 24104

This theorem is used by:  elfm2  24114  fmfg  24115  rnelfm  24119  fmfnfmlem1  24120  fmfnfm  24124  fmco  24127  flfnei  24157  isflf  24159  isfcf  24200  filnetlem4  36920