Theorem elfm 22710

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 22706	. . 3 ⊢ ((𝑋 ∈ 𝐶 ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌⟶𝑋) → ((𝑋 FilMap 𝐹)‘𝐵) = (𝑋filGenran (𝑡 ∈ 𝐵 ↦ (𝐹 “ 𝑡))))
2	1	eleq2d 2819	. 2 ⊢ ((𝑋 ∈ 𝐶 ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌⟶𝑋) → (𝐴 ∈ ((𝑋 FilMap 𝐹)‘𝐵) ↔ 𝐴 ∈ (𝑋filGenran (𝑡 ∈ 𝐵 ↦ (𝐹 “ 𝑡)))))
3		eqid 2739	. . . . 5 ⊢ ran (𝑡 ∈ 𝐵 ↦ (𝐹 “ 𝑡)) = ran (𝑡 ∈ 𝐵 ↦ (𝐹 “ 𝑡))
4	3	fbasrn 22647	. . . 4 ⊢ ((𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌⟶𝑋 ∧ 𝑋 ∈ 𝐶) → ran (𝑡 ∈ 𝐵 ↦ (𝐹 “ 𝑡)) ∈ (fBas‘𝑋))
5	4	3comr 1126	. . 3 ⊢ ((𝑋 ∈ 𝐶 ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌⟶𝑋) → ran (𝑡 ∈ 𝐵 ↦ (𝐹 “ 𝑡)) ∈ (fBas‘𝑋))
6		elfg 22634	. . 3 ⊢ (ran (𝑡 ∈ 𝐵 ↦ (𝐹 “ 𝑡)) ∈ (fBas‘𝑋) → (𝐴 ∈ (𝑋filGenran (𝑡 ∈ 𝐵 ↦ (𝐹 “ 𝑡))) ↔ (𝐴 ⊆ 𝑋 ∧ ∃𝑦 ∈ ran (𝑡 ∈ 𝐵 ↦ (𝐹 “ 𝑡))𝑦 ⊆ 𝐴)))
7	5, 6	syl 17	. 2 ⊢ ((𝑋 ∈ 𝐶 ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌⟶𝑋) → (𝐴 ∈ (𝑋filGenran (𝑡 ∈ 𝐵 ↦ (𝐹 “ 𝑡))) ↔ (𝐴 ⊆ 𝑋 ∧ ∃𝑦 ∈ ran (𝑡 ∈ 𝐵 ↦ (𝐹 “ 𝑡))𝑦 ⊆ 𝐴)))
8		simpr 488	. . . . . 6 ⊢ (((𝑋 ∈ 𝐶 ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌⟶𝑋) ∧ 𝑥 ∈ 𝐵) → 𝑥 ∈ 𝐵)
9		eqid 2739	. . . . . 6 ⊢ (𝐹 “ 𝑥) = (𝐹 “ 𝑥)
10		imaeq2 5909	. . . . . . 7 ⊢ (𝑡 = 𝑥 → (𝐹 “ 𝑡) = (𝐹 “ 𝑥))
11	10	rspceeqv 3544	. . . . . 6 ⊢ ((𝑥 ∈ 𝐵 ∧ (𝐹 “ 𝑥) = (𝐹 “ 𝑥)) → ∃𝑡 ∈ 𝐵 (𝐹 “ 𝑥) = (𝐹 “ 𝑡))
12	8, 9, 11	sylancl 589	. . . . 5 ⊢ (((𝑋 ∈ 𝐶 ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌⟶𝑋) ∧ 𝑥 ∈ 𝐵) → ∃𝑡 ∈ 𝐵 (𝐹 “ 𝑥) = (𝐹 “ 𝑡))
13		simpl1 1192	. . . . . . 7 ⊢ (((𝑋 ∈ 𝐶 ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌⟶𝑋) ∧ 𝑥 ∈ 𝐵) → 𝑋 ∈ 𝐶)
14		imassrn 5924	. . . . . . . 8 ⊢ (𝐹 “ 𝑥) ⊆ ran 𝐹
15		frn 6521	. . . . . . . . . 10 ⊢ (𝐹:𝑌⟶𝑋 → ran 𝐹 ⊆ 𝑋)
16	15	3ad2ant3 1136	. . . . . . . . 9 ⊢ ((𝑋 ∈ 𝐶 ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌⟶𝑋) → ran 𝐹 ⊆ 𝑋)
17	16	adantr 484	. . . . . . . 8 ⊢ (((𝑋 ∈ 𝐶 ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌⟶𝑋) ∧ 𝑥 ∈ 𝐵) → ran 𝐹 ⊆ 𝑋)
18	14, 17	sstrid 3898	. . . . . . 7 ⊢ (((𝑋 ∈ 𝐶 ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌⟶𝑋) ∧ 𝑥 ∈ 𝐵) → (𝐹 “ 𝑥) ⊆ 𝑋)
19	13, 18	ssexd 5202	. . . . . 6 ⊢ (((𝑋 ∈ 𝐶 ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌⟶𝑋) ∧ 𝑥 ∈ 𝐵) → (𝐹 “ 𝑥) ∈ V)
20		eqid 2739	. . . . . . 7 ⊢ (𝑡 ∈ 𝐵 ↦ (𝐹 “ 𝑡)) = (𝑡 ∈ 𝐵 ↦ (𝐹 “ 𝑡))
21	20	elrnmpt 5809	. . . . . 6 ⊢ ((𝐹 “ 𝑥) ∈ V → ((𝐹 “ 𝑥) ∈ ran (𝑡 ∈ 𝐵 ↦ (𝐹 “ 𝑡)) ↔ ∃𝑡 ∈ 𝐵 (𝐹 “ 𝑥) = (𝐹 “ 𝑡)))
22	19, 21	syl 17	. . . . 5 ⊢ (((𝑋 ∈ 𝐶 ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌⟶𝑋) ∧ 𝑥 ∈ 𝐵) → ((𝐹 “ 𝑥) ∈ ran (𝑡 ∈ 𝐵 ↦ (𝐹 “ 𝑡)) ↔ ∃𝑡 ∈ 𝐵 (𝐹 “ 𝑥) = (𝐹 “ 𝑡)))
23	12, 22	mpbird 260	. . . 4 ⊢ (((𝑋 ∈ 𝐶 ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌⟶𝑋) ∧ 𝑥 ∈ 𝐵) → (𝐹 “ 𝑥) ∈ ran (𝑡 ∈ 𝐵 ↦ (𝐹 “ 𝑡)))
24	10	cbvmptv 5143	. . . . . . 7 ⊢ (𝑡 ∈ 𝐵 ↦ (𝐹 “ 𝑡)) = (𝑥 ∈ 𝐵 ↦ (𝐹 “ 𝑥))
25	24	elrnmpt 5809	. . . . . 6 ⊢ (𝑦 ∈ ran (𝑡 ∈ 𝐵 ↦ (𝐹 “ 𝑡)) → (𝑦 ∈ ran (𝑡 ∈ 𝐵 ↦ (𝐹 “ 𝑡)) ↔ ∃𝑥 ∈ 𝐵 𝑦 = (𝐹 “ 𝑥)))
26	25	ibi 270	. . . . 5 ⊢ (𝑦 ∈ ran (𝑡 ∈ 𝐵 ↦ (𝐹 “ 𝑡)) → ∃𝑥 ∈ 𝐵 𝑦 = (𝐹 “ 𝑥))
27	26	adantl 485	. . . 4 ⊢ (((𝑋 ∈ 𝐶 ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌⟶𝑋) ∧ 𝑦 ∈ ran (𝑡 ∈ 𝐵 ↦ (𝐹 “ 𝑡))) → ∃𝑥 ∈ 𝐵 𝑦 = (𝐹 “ 𝑥))
28		simpr 488	. . . . 5 ⊢ (((𝑋 ∈ 𝐶 ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌⟶𝑋) ∧ 𝑦 = (𝐹 “ 𝑥)) → 𝑦 = (𝐹 “ 𝑥))
29	28	sseq1d 3918	. . . 4 ⊢ (((𝑋 ∈ 𝐶 ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌⟶𝑋) ∧ 𝑦 = (𝐹 “ 𝑥)) → (𝑦 ⊆ 𝐴 ↔ (𝐹 “ 𝑥) ⊆ 𝐴))
30	23, 27, 29	rexxfrd 5286	. . 3 ⊢ ((𝑋 ∈ 𝐶 ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌⟶𝑋) → (∃𝑦 ∈ ran (𝑡 ∈ 𝐵 ↦ (𝐹 “ 𝑡))𝑦 ⊆ 𝐴 ↔ ∃𝑥 ∈ 𝐵 (𝐹 “ 𝑥) ⊆ 𝐴))
31	30	anbi2d 632	. 2 ⊢ ((𝑋 ∈ 𝐶 ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌⟶𝑋) → ((𝐴 ⊆ 𝑋 ∧ ∃𝑦 ∈ ran (𝑡 ∈ 𝐵 ↦ (𝐹 “ 𝑡))𝑦 ⊆ 𝐴) ↔ (𝐴 ⊆ 𝑋 ∧ ∃𝑥 ∈ 𝐵 (𝐹 “ 𝑥) ⊆ 𝐴)))
32	2, 7, 31	3bitrd 308	1 ⊢ ((𝑋 ∈ 𝐶 ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌⟶𝑋) → (𝐴 ∈ ((𝑋 FilMap 𝐹)‘𝐵) ↔ (𝐴 ⊆ 𝑋 ∧ ∃𝑥 ∈ 𝐵 (𝐹 “ 𝑥) ⊆ 𝐴)))

Syntax hints:   → wi 4   ↔ wb 209   ∧ wa 399   ∧ w3a 1088   = wceq 1542   ∈ wcel 2114  ∃wrex 3055  Vcvv 3400   ⊆ wss 3853   ↦ cmpt 5120  ran crn 5536   “ cima 5538  ⟶wf 6345  ‘cfv 6349  (class class class)co 7182  fBascfbas 20217  filGencfg 20218   FilMap cfm 22696

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1975  ax-7 2020  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2162  ax-12 2179  ax-ext 2711  ax-rep 5164  ax-sep 5177  ax-nul 5184  ax-pow 5242  ax-pr 5306

This theorem depends on definitions:  df-bi 210  df-an 400  df-or 847  df-3an 1090  df-tru 1545  df-fal 1555  df-ex 1787  df-nf 1791  df-sb 2075  df-mo 2541  df-eu 2571  df-clab 2718  df-cleq 2731  df-clel 2812  df-nfc 2882  df-ne 2936  df-nel 3040  df-ral 3059  df-rex 3060  df-reu 3061  df-rab 3063  df-v 3402  df-sbc 3686  df-csb 3801  df-dif 3856  df-un 3858  df-in 3860  df-ss 3870  df-nul 4222  df-if 4425  df-pw 4500  df-sn 4527  df-pr 4529  df-op 4533  df-uni 4807  df-iun 4893  df-br 5041  df-opab 5103  df-mpt 5121  df-id 5439  df-xp 5541  df-rel 5542  df-cnv 5543  df-co 5544  df-dm 5545  df-rn 5546  df-res 5547  df-ima 5548  df-iota 6307  df-fun 6351  df-fn 6352  df-f 6353  df-f1 6354  df-fo 6355  df-f1o 6356  df-fv 6357  df-ov 7185  df-oprab 7186  df-mpo 7187  df-fbas 20226  df-fg 20227  df-fm 22701

This theorem is referenced by:  elfm2  22711  fmfg  22712  rnelfm  22716  fmfnfmlem1  22717  fmfnfm  22721  fmco  22724  flfnei  22754  isflf  22756  isfcf  22797  filnetlem4  34225