MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  elfm3 Structured version   Visualization version   GIF version

Theorem elfm3 22555
Description: An alternate formulation of elementhood in a mapping filter that requires 𝐹 to be onto. (Contributed by Jeff Hankins, 1-Oct-2009.) (Revised by Stefan O'Rear, 6-Aug-2015.)
Hypothesis
Ref Expression
elfm2.l 𝐿 = (𝑌filGen𝐵)
Assertion
Ref Expression
elfm3 ((𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌onto𝑋) → (𝐴 ∈ ((𝑋 FilMap 𝐹)‘𝐵) ↔ ∃𝑥𝐿 𝐴 = (𝐹𝑥)))
Distinct variable groups:   𝑥,𝐵   𝑥,𝐹   𝑥,𝑋   𝑥,𝐴   𝑥,𝐿   𝑥,𝑌

Proof of Theorem elfm3
Dummy variables 𝑦 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 foima 6570 . . . 4 (𝐹:𝑌onto𝑋 → (𝐹𝑌) = 𝑋)
21adantl 485 . . 3 ((𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌onto𝑋) → (𝐹𝑌) = 𝑋)
3 fofun 6566 . . . 4 (𝐹:𝑌onto𝑋 → Fun 𝐹)
4 elfvdm 6677 . . . 4 (𝐵 ∈ (fBas‘𝑌) → 𝑌 ∈ dom fBas)
5 funimaexg 6410 . . . 4 ((Fun 𝐹𝑌 ∈ dom fBas) → (𝐹𝑌) ∈ V)
63, 4, 5syl2anr 599 . . 3 ((𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌onto𝑋) → (𝐹𝑌) ∈ V)
72, 6eqeltrrd 2891 . 2 ((𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌onto𝑋) → 𝑋 ∈ V)
8 fof 6565 . . . . 5 (𝐹:𝑌onto𝑋𝐹:𝑌𝑋)
9 elfm2.l . . . . . 6 𝐿 = (𝑌filGen𝐵)
109elfm2 22553 . . . . 5 ((𝑋 ∈ V ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌𝑋) → (𝐴 ∈ ((𝑋 FilMap 𝐹)‘𝐵) ↔ (𝐴𝑋 ∧ ∃𝑦𝐿 (𝐹𝑦) ⊆ 𝐴)))
118, 10syl3an3 1162 . . . 4 ((𝑋 ∈ V ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌onto𝑋) → (𝐴 ∈ ((𝑋 FilMap 𝐹)‘𝐵) ↔ (𝐴𝑋 ∧ ∃𝑦𝐿 (𝐹𝑦) ⊆ 𝐴)))
12 fgcl 22483 . . . . . . . . . . . 12 (𝐵 ∈ (fBas‘𝑌) → (𝑌filGen𝐵) ∈ (Fil‘𝑌))
139, 12eqeltrid 2894 . . . . . . . . . . 11 (𝐵 ∈ (fBas‘𝑌) → 𝐿 ∈ (Fil‘𝑌))
14133ad2ant2 1131 . . . . . . . . . 10 ((𝑋 ∈ V ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌onto𝑋) → 𝐿 ∈ (Fil‘𝑌))
1514ad2antrr 725 . . . . . . . . 9 ((((𝑋 ∈ V ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌onto𝑋) ∧ 𝐴𝑋) ∧ (𝑦𝐿 ∧ (𝐹𝑦) ⊆ 𝐴)) → 𝐿 ∈ (Fil‘𝑌))
16 simprl 770 . . . . . . . . 9 ((((𝑋 ∈ V ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌onto𝑋) ∧ 𝐴𝑋) ∧ (𝑦𝐿 ∧ (𝐹𝑦) ⊆ 𝐴)) → 𝑦𝐿)
17 cnvimass 5916 . . . . . . . . . . . 12 (𝐹𝐴) ⊆ dom 𝐹
18 fofn 6567 . . . . . . . . . . . . 13 (𝐹:𝑌onto𝑋𝐹 Fn 𝑌)
1918fndmd 6427 . . . . . . . . . . . 12 (𝐹:𝑌onto𝑋 → dom 𝐹 = 𝑌)
2017, 19sseqtrid 3967 . . . . . . . . . . 11 (𝐹:𝑌onto𝑋 → (𝐹𝐴) ⊆ 𝑌)
21203ad2ant3 1132 . . . . . . . . . 10 ((𝑋 ∈ V ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌onto𝑋) → (𝐹𝐴) ⊆ 𝑌)
2221ad2antrr 725 . . . . . . . . 9 ((((𝑋 ∈ V ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌onto𝑋) ∧ 𝐴𝑋) ∧ (𝑦𝐿 ∧ (𝐹𝑦) ⊆ 𝐴)) → (𝐹𝐴) ⊆ 𝑌)
2333ad2ant3 1132 . . . . . . . . . . . . 13 ((𝑋 ∈ V ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌onto𝑋) → Fun 𝐹)
2423ad2antrr 725 . . . . . . . . . . . 12 ((((𝑋 ∈ V ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌onto𝑋) ∧ 𝐴𝑋) ∧ 𝑦𝐿) → Fun 𝐹)
259eleq2i 2881 . . . . . . . . . . . . . . 15 (𝑦𝐿𝑦 ∈ (𝑌filGen𝐵))
26 elfg 22476 . . . . . . . . . . . . . . . . 17 (𝐵 ∈ (fBas‘𝑌) → (𝑦 ∈ (𝑌filGen𝐵) ↔ (𝑦𝑌 ∧ ∃𝑧𝐵 𝑧𝑦)))
27263ad2ant2 1131 . . . . . . . . . . . . . . . 16 ((𝑋 ∈ V ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌onto𝑋) → (𝑦 ∈ (𝑌filGen𝐵) ↔ (𝑦𝑌 ∧ ∃𝑧𝐵 𝑧𝑦)))
2827adantr 484 . . . . . . . . . . . . . . 15 (((𝑋 ∈ V ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌onto𝑋) ∧ 𝐴𝑋) → (𝑦 ∈ (𝑌filGen𝐵) ↔ (𝑦𝑌 ∧ ∃𝑧𝐵 𝑧𝑦)))
2925, 28syl5bb 286 . . . . . . . . . . . . . 14 (((𝑋 ∈ V ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌onto𝑋) ∧ 𝐴𝑋) → (𝑦𝐿 ↔ (𝑦𝑌 ∧ ∃𝑧𝐵 𝑧𝑦)))
3029simprbda 502 . . . . . . . . . . . . 13 ((((𝑋 ∈ V ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌onto𝑋) ∧ 𝐴𝑋) ∧ 𝑦𝐿) → 𝑦𝑌)
31 sseq2 3941 . . . . . . . . . . . . . . . . 17 (dom 𝐹 = 𝑌 → (𝑦 ⊆ dom 𝐹𝑦𝑌))
3231biimpar 481 . . . . . . . . . . . . . . . 16 ((dom 𝐹 = 𝑌𝑦𝑌) → 𝑦 ⊆ dom 𝐹)
3319, 32sylan 583 . . . . . . . . . . . . . . 15 ((𝐹:𝑌onto𝑋𝑦𝑌) → 𝑦 ⊆ dom 𝐹)
34333ad2antl3 1184 . . . . . . . . . . . . . 14 (((𝑋 ∈ V ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌onto𝑋) ∧ 𝑦𝑌) → 𝑦 ⊆ dom 𝐹)
3534adantlr 714 . . . . . . . . . . . . 13 ((((𝑋 ∈ V ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌onto𝑋) ∧ 𝐴𝑋) ∧ 𝑦𝑌) → 𝑦 ⊆ dom 𝐹)
3630, 35syldan 594 . . . . . . . . . . . 12 ((((𝑋 ∈ V ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌onto𝑋) ∧ 𝐴𝑋) ∧ 𝑦𝐿) → 𝑦 ⊆ dom 𝐹)
37 funimass3 6801 . . . . . . . . . . . 12 ((Fun 𝐹𝑦 ⊆ dom 𝐹) → ((𝐹𝑦) ⊆ 𝐴𝑦 ⊆ (𝐹𝐴)))
3824, 36, 37syl2anc 587 . . . . . . . . . . 11 ((((𝑋 ∈ V ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌onto𝑋) ∧ 𝐴𝑋) ∧ 𝑦𝐿) → ((𝐹𝑦) ⊆ 𝐴𝑦 ⊆ (𝐹𝐴)))
3938biimpd 232 . . . . . . . . . 10 ((((𝑋 ∈ V ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌onto𝑋) ∧ 𝐴𝑋) ∧ 𝑦𝐿) → ((𝐹𝑦) ⊆ 𝐴𝑦 ⊆ (𝐹𝐴)))
4039impr 458 . . . . . . . . 9 ((((𝑋 ∈ V ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌onto𝑋) ∧ 𝐴𝑋) ∧ (𝑦𝐿 ∧ (𝐹𝑦) ⊆ 𝐴)) → 𝑦 ⊆ (𝐹𝐴))
41 filss 22458 . . . . . . . . 9 ((𝐿 ∈ (Fil‘𝑌) ∧ (𝑦𝐿 ∧ (𝐹𝐴) ⊆ 𝑌𝑦 ⊆ (𝐹𝐴))) → (𝐹𝐴) ∈ 𝐿)
4215, 16, 22, 40, 41syl13anc 1369 . . . . . . . 8 ((((𝑋 ∈ V ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌onto𝑋) ∧ 𝐴𝑋) ∧ (𝑦𝐿 ∧ (𝐹𝑦) ⊆ 𝐴)) → (𝐹𝐴) ∈ 𝐿)
43 foimacnv 6607 . . . . . . . . . . 11 ((𝐹:𝑌onto𝑋𝐴𝑋) → (𝐹 “ (𝐹𝐴)) = 𝐴)
4443eqcomd 2804 . . . . . . . . . 10 ((𝐹:𝑌onto𝑋𝐴𝑋) → 𝐴 = (𝐹 “ (𝐹𝐴)))
45443ad2antl3 1184 . . . . . . . . 9 (((𝑋 ∈ V ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌onto𝑋) ∧ 𝐴𝑋) → 𝐴 = (𝐹 “ (𝐹𝐴)))
4645adantr 484 . . . . . . . 8 ((((𝑋 ∈ V ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌onto𝑋) ∧ 𝐴𝑋) ∧ (𝑦𝐿 ∧ (𝐹𝑦) ⊆ 𝐴)) → 𝐴 = (𝐹 “ (𝐹𝐴)))
47 imaeq2 5892 . . . . . . . . 9 (𝑥 = (𝐹𝐴) → (𝐹𝑥) = (𝐹 “ (𝐹𝐴)))
4847rspceeqv 3586 . . . . . . . 8 (((𝐹𝐴) ∈ 𝐿𝐴 = (𝐹 “ (𝐹𝐴))) → ∃𝑥𝐿 𝐴 = (𝐹𝑥))
4942, 46, 48syl2anc 587 . . . . . . 7 ((((𝑋 ∈ V ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌onto𝑋) ∧ 𝐴𝑋) ∧ (𝑦𝐿 ∧ (𝐹𝑦) ⊆ 𝐴)) → ∃𝑥𝐿 𝐴 = (𝐹𝑥))
5049rexlimdvaa 3244 . . . . . 6 (((𝑋 ∈ V ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌onto𝑋) ∧ 𝐴𝑋) → (∃𝑦𝐿 (𝐹𝑦) ⊆ 𝐴 → ∃𝑥𝐿 𝐴 = (𝐹𝑥)))
5150expimpd 457 . . . . 5 ((𝑋 ∈ V ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌onto𝑋) → ((𝐴𝑋 ∧ ∃𝑦𝐿 (𝐹𝑦) ⊆ 𝐴) → ∃𝑥𝐿 𝐴 = (𝐹𝑥)))
52 simprr 772 . . . . . . . 8 (((𝑋 ∈ V ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌onto𝑋) ∧ (𝑥𝐿𝐴 = (𝐹𝑥))) → 𝐴 = (𝐹𝑥))
53 imassrn 5907 . . . . . . . . 9 (𝐹𝑥) ⊆ ran 𝐹
54 forn 6568 . . . . . . . . . . 11 (𝐹:𝑌onto𝑋 → ran 𝐹 = 𝑋)
55543ad2ant3 1132 . . . . . . . . . 10 ((𝑋 ∈ V ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌onto𝑋) → ran 𝐹 = 𝑋)
5655adantr 484 . . . . . . . . 9 (((𝑋 ∈ V ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌onto𝑋) ∧ (𝑥𝐿𝐴 = (𝐹𝑥))) → ran 𝐹 = 𝑋)
5753, 56sseqtrid 3967 . . . . . . . 8 (((𝑋 ∈ V ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌onto𝑋) ∧ (𝑥𝐿𝐴 = (𝐹𝑥))) → (𝐹𝑥) ⊆ 𝑋)
5852, 57eqsstrd 3953 . . . . . . 7 (((𝑋 ∈ V ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌onto𝑋) ∧ (𝑥𝐿𝐴 = (𝐹𝑥))) → 𝐴𝑋)
59 eqimss2 3972 . . . . . . . . 9 (𝐴 = (𝐹𝑥) → (𝐹𝑥) ⊆ 𝐴)
60 imaeq2 5892 . . . . . . . . . . 11 (𝑦 = 𝑥 → (𝐹𝑦) = (𝐹𝑥))
6160sseq1d 3946 . . . . . . . . . 10 (𝑦 = 𝑥 → ((𝐹𝑦) ⊆ 𝐴 ↔ (𝐹𝑥) ⊆ 𝐴))
6261rspcev 3571 . . . . . . . . 9 ((𝑥𝐿 ∧ (𝐹𝑥) ⊆ 𝐴) → ∃𝑦𝐿 (𝐹𝑦) ⊆ 𝐴)
6359, 62sylan2 595 . . . . . . . 8 ((𝑥𝐿𝐴 = (𝐹𝑥)) → ∃𝑦𝐿 (𝐹𝑦) ⊆ 𝐴)
6463adantl 485 . . . . . . 7 (((𝑋 ∈ V ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌onto𝑋) ∧ (𝑥𝐿𝐴 = (𝐹𝑥))) → ∃𝑦𝐿 (𝐹𝑦) ⊆ 𝐴)
6558, 64jca 515 . . . . . 6 (((𝑋 ∈ V ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌onto𝑋) ∧ (𝑥𝐿𝐴 = (𝐹𝑥))) → (𝐴𝑋 ∧ ∃𝑦𝐿 (𝐹𝑦) ⊆ 𝐴))
6665rexlimdvaa 3244 . . . . 5 ((𝑋 ∈ V ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌onto𝑋) → (∃𝑥𝐿 𝐴 = (𝐹𝑥) → (𝐴𝑋 ∧ ∃𝑦𝐿 (𝐹𝑦) ⊆ 𝐴)))
6751, 66impbid 215 . . . 4 ((𝑋 ∈ V ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌onto𝑋) → ((𝐴𝑋 ∧ ∃𝑦𝐿 (𝐹𝑦) ⊆ 𝐴) ↔ ∃𝑥𝐿 𝐴 = (𝐹𝑥)))
6811, 67bitrd 282 . . 3 ((𝑋 ∈ V ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌onto𝑋) → (𝐴 ∈ ((𝑋 FilMap 𝐹)‘𝐵) ↔ ∃𝑥𝐿 𝐴 = (𝐹𝑥)))
69683coml 1124 . 2 ((𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌onto𝑋𝑋 ∈ V) → (𝐴 ∈ ((𝑋 FilMap 𝐹)‘𝐵) ↔ ∃𝑥𝐿 𝐴 = (𝐹𝑥)))
707, 69mpd3an3 1459 1 ((𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌onto𝑋) → (𝐴 ∈ ((𝑋 FilMap 𝐹)‘𝐵) ↔ ∃𝑥𝐿 𝐴 = (𝐹𝑥)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 209  wa 399  w3a 1084   = wceq 1538  wcel 2111  wrex 3107  Vcvv 3441  wss 3881  ccnv 5518  dom cdm 5519  ran crn 5520  cima 5522  Fun wfun 6318  wf 6320  ontowfo 6322  cfv 6324  (class class class)co 7135  fBascfbas 20079  filGencfg 20080  Filcfil 22450   FilMap cfm 22538
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 1911  ax-6 1970  ax-7 2015  ax-8 2113  ax-9 2121  ax-10 2142  ax-11 2158  ax-12 2175  ax-ext 2770  ax-rep 5154  ax-sep 5167  ax-nul 5174  ax-pow 5231  ax-pr 5295  ax-un 7441
This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3an 1086  df-tru 1541  df-ex 1782  df-nf 1786  df-sb 2070  df-mo 2598  df-eu 2629  df-clab 2777  df-cleq 2791  df-clel 2870  df-nfc 2938  df-ne 2988  df-nel 3092  df-ral 3111  df-rex 3112  df-reu 3113  df-rab 3115  df-v 3443  df-sbc 3721  df-csb 3829  df-dif 3884  df-un 3886  df-in 3888  df-ss 3898  df-nul 4244  df-if 4426  df-pw 4499  df-sn 4526  df-pr 4528  df-op 4532  df-uni 4801  df-iun 4883  df-br 5031  df-opab 5093  df-mpt 5111  df-id 5425  df-xp 5525  df-rel 5526  df-cnv 5527  df-co 5528  df-dm 5529  df-rn 5530  df-res 5531  df-ima 5532  df-iota 6283  df-fun 6326  df-fn 6327  df-f 6328  df-f1 6329  df-fo 6330  df-f1o 6331  df-fv 6332  df-ov 7138  df-oprab 7139  df-mpo 7140  df-fbas 20088  df-fg 20089  df-fil 22451  df-fm 22543
This theorem is referenced by:  fmid  22565
  Copyright terms: Public domain W3C validator