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

Theorem elfm2 24322
Description: An element of a mapping filter. (Contributed by Jeff Hankins, 26-Sep-2009.) (Revised by Stefan O'Rear, 6-Aug-2015.)
Hypothesis
Ref Expression
elfm2.l 𝐿 = (𝑌filGen𝐵)
Assertion
Ref Expression
elfm2 ((𝑋 ∈ 𝐶 ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌⟶𝑋) → (𝐴 ∈ ((𝑋 FilMap 𝐹)‘𝐵) ↔ (𝐴 ⊆ 𝑋 ∧ ∃𝑥 ∈ 𝐿 (𝐹 “ 𝑥) ⊆ 𝐴)))
Distinct variable groups:   𝑥,𝐵   𝑥,𝐶   𝑥,𝐹   𝑥,𝑋   𝑥,𝐴   𝑥,𝐿   𝑥,𝑌

Proof of Theorem elfm2
Dummy variable 𝑦 is distinct from all other variables.
StepHypRef Expression
1 elfm 24321 . 2 ((𝑋 ∈ 𝐶 ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌⟶𝑋) → (𝐴 ∈ ((𝑋 FilMap 𝐹)‘𝐵) ↔ (𝐴 ⊆ 𝑋 ∧ ∃𝑦 ∈ 𝐵 (𝐹 “ 𝑦) ⊆ 𝐴)))
2 ssfg 24246 . . . . . . . . . 10 (𝐵 ∈ (fBas‘𝑌) → 𝐵 ⊆ (𝑌filGen𝐵))
3 elfm2.l . . . . . . . . . 10 𝐿 = (𝑌filGen𝐵)
42, 3sseqtrrdi 3954 . . . . . . . . 9 (𝐵 ∈ (fBas‘𝑌) → 𝐵 ⊆ 𝐿)
54sselda 3913 . . . . . . . 8 ((𝐵 ∈ (fBas‘𝑌) ∧ 𝑦 ∈ 𝐵) → 𝑦 ∈ 𝐿)
65adantrr 730 . . . . . . 7 ((𝐵 ∈ (fBas‘𝑌) ∧ (𝑦 ∈ 𝐵 ∧ (𝐹 “ 𝑦) ⊆ 𝐴)) → 𝑦 ∈ 𝐿)
763ad2antl2 1205 . . . . . 6 (((𝑋 ∈ 𝐶 ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌⟶𝑋) ∧ (𝑦 ∈ 𝐵 ∧ (𝐹 “ 𝑦) ⊆ 𝐴)) → 𝑦 ∈ 𝐿)
8 simprr 785 . . . . . 6 (((𝑋 ∈ 𝐶 ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌⟶𝑋) ∧ (𝑦 ∈ 𝐵 ∧ (𝐹 “ 𝑦) ⊆ 𝐴)) → (𝐹 “ 𝑦) ⊆ 𝐴)
9 imaeq2 6066 . . . . . . . 8 (𝑥 = 𝑦 → (𝐹 “ 𝑥) = (𝐹 “ 𝑦))
109sseq1d 3944 . . . . . . 7 (𝑥 = 𝑦 → ((𝐹 “ 𝑥) ⊆ 𝐴 ↔ (𝐹 “ 𝑦) ⊆ 𝐴))
1110rspcev 3580 . . . . . 6 ((𝑦 ∈ 𝐿 ∧ (𝐹 “ 𝑦) ⊆ 𝐴) → ∃𝑥 ∈ 𝐿 (𝐹 “ 𝑥) ⊆ 𝐴)
127, 8, 11syl2anc 596 . . . . 5 (((𝑋 ∈ 𝐶 ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌⟶𝑋) ∧ (𝑦 ∈ 𝐵 ∧ (𝐹 “ 𝑦) ⊆ 𝐴)) → ∃𝑥 ∈ 𝐿 (𝐹 “ 𝑥) ⊆ 𝐴)
1312rexlimdvaa 3168 . . . 4 ((𝑋 ∈ 𝐶 ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌⟶𝑋) → (∃𝑦 ∈ 𝐵 (𝐹 “ 𝑦) ⊆ 𝐴 → ∃𝑥 ∈ 𝐿 (𝐹 “ 𝑥) ⊆ 𝐴))
143eleq2i 2856 . . . . . . . 8 (𝑥 ∈ 𝐿 ↔ 𝑥 ∈ (𝑌filGen𝐵))
15 elfg 24245 . . . . . . . 8 (𝐵 ∈ (fBas‘𝑌) → (𝑥 ∈ (𝑌filGen𝐵) ↔ (𝑥 ⊆ 𝑌 ∧ ∃𝑦 ∈ 𝐵 𝑦 ⊆ 𝑥)))
1614, 15bitrid 286 . . . . . . 7 (𝐵 ∈ (fBas‘𝑌) → (𝑥 ∈ 𝐿 ↔ (𝑥 ⊆ 𝑌 ∧ ∃𝑦 ∈ 𝐵 𝑦 ⊆ 𝑥)))
17163ad2ant2 1152 . . . . . 6 ((𝑋 ∈ 𝐶 ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌⟶𝑋) → (𝑥 ∈ 𝐿 ↔ (𝑥 ⊆ 𝑌 ∧ ∃𝑦 ∈ 𝐵 𝑦 ⊆ 𝑥)))
18 imass2 6073 . . . . . . . . . . 11 (𝑦 ⊆ 𝑥 → (𝐹 “ 𝑦) ⊆ (𝐹 “ 𝑥))
19 sstr2 3920 . . . . . . . . . . . . 13 ((𝐹 “ 𝑦) ⊆ (𝐹 “ 𝑥) → ((𝐹 “ 𝑥) ⊆ 𝐴 → (𝐹 “ 𝑦) ⊆ 𝐴))
2019com12 33 . . . . . . . . . . . 12 ((𝐹 “ 𝑥) ⊆ 𝐴 → ((𝐹 “ 𝑦) ⊆ (𝐹 “ 𝑥) → (𝐹 “ 𝑦) ⊆ 𝐴))
2120ad2antll 742 . . . . . . . . . . 11 (((𝑋 ∈ 𝐶 ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌⟶𝑋) ∧ (𝑥 ⊆ 𝑌 ∧ (𝐹 “ 𝑥) ⊆ 𝐴)) → ((𝐹 “ 𝑦) ⊆ (𝐹 “ 𝑥) → (𝐹 “ 𝑦) ⊆ 𝐴))
2218, 21syl5 35 . . . . . . . . . 10 (((𝑋 ∈ 𝐶 ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌⟶𝑋) ∧ (𝑥 ⊆ 𝑌 ∧ (𝐹 “ 𝑥) ⊆ 𝐴)) → (𝑦 ⊆ 𝑥 → (𝐹 “ 𝑦) ⊆ 𝐴))
2322reximdv 3181 . . . . . . . . 9 (((𝑋 ∈ 𝐶 ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌⟶𝑋) ∧ (𝑥 ⊆ 𝑌 ∧ (𝐹 “ 𝑥) ⊆ 𝐴)) → (∃𝑦 ∈ 𝐵 𝑦 ⊆ 𝑥 → ∃𝑦 ∈ 𝐵 (𝐹 “ 𝑦) ⊆ 𝐴))
2423expr 462 . . . . . . . 8 (((𝑋 ∈ 𝐶 ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌⟶𝑋) ∧ 𝑥 ⊆ 𝑌) → ((𝐹 “ 𝑥) ⊆ 𝐴 → (∃𝑦 ∈ 𝐵 𝑦 ⊆ 𝑥 → ∃𝑦 ∈ 𝐵 (𝐹 “ 𝑦) ⊆ 𝐴)))
2524com23 87 . . . . . . 7 (((𝑋 ∈ 𝐶 ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌⟶𝑋) ∧ 𝑥 ⊆ 𝑌) → (∃𝑦 ∈ 𝐵 𝑦 ⊆ 𝑥 → ((𝐹 “ 𝑥) ⊆ 𝐴 → ∃𝑦 ∈ 𝐵 (𝐹 “ 𝑦) ⊆ 𝐴)))
2625expimpd 459 . . . . . 6 ((𝑋 ∈ 𝐶 ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌⟶𝑋) → ((𝑥 ⊆ 𝑌 ∧ ∃𝑦 ∈ 𝐵 𝑦 ⊆ 𝑥) → ((𝐹 “ 𝑥) ⊆ 𝐴 → ∃𝑦 ∈ 𝐵 (𝐹 “ 𝑦) ⊆ 𝐴)))
2717, 26sylbid 243 . . . . 5 ((𝑋 ∈ 𝐶 ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌⟶𝑋) → (𝑥 ∈ 𝐿 → ((𝐹 “ 𝑥) ⊆ 𝐴 → ∃𝑦 ∈ 𝐵 (𝐹 “ 𝑦) ⊆ 𝐴)))
2827rexlimdv 3165 . . . 4 ((𝑋 ∈ 𝐶 ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌⟶𝑋) → (∃𝑥 ∈ 𝐿 (𝐹 “ 𝑥) ⊆ 𝐴 → ∃𝑦 ∈ 𝐵 (𝐹 “ 𝑦) ⊆ 𝐴))
2913, 28impbid 215 . . 3 ((𝑋 ∈ 𝐶 ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌⟶𝑋) → (∃𝑦 ∈ 𝐵 (𝐹 “ 𝑦) ⊆ 𝐴 ↔ ∃𝑥 ∈ 𝐿 (𝐹 “ 𝑥) ⊆ 𝐴))
3029anbi2d 642 . 2 ((𝑋 ∈ 𝐶 ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌⟶𝑋) → ((𝐴 ⊆ 𝑋 ∧ ∃𝑦 ∈ 𝐵 (𝐹 “ 𝑦) ⊆ 𝐴) ↔ (𝐴 ⊆ 𝑋 ∧ ∃𝑥 ∈ 𝐿 (𝐹 “ 𝑥) ⊆ 𝐴)))
311, 30bitrd 282 1 ((𝑋 ∈ 𝐶 ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌⟶𝑋) → (𝐴 ∈ ((𝑋 FilMap 𝐹)‘𝐵) ↔ (𝐴 ⊆ 𝑋 ∧ ∃𝑥 ∈ 𝐿 (𝐹 “ 𝑥) ⊆ 𝐴)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2147  ∃wrex 3090   ⊆ wss 3900   “ cima 5661  ⟶wf 6562  ‘cfv 6566  (class class class)co 7451  fBascfbas 21717  filGencfg 21718   FilMap cfm 24307
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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-rep 5238  ax-sep 5255  ax-nul 5266  ax-pow 5334  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 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-nel 3066  df-ral 3081  df-rex 3091  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-iun 4958  df-br 5109  df-opab 5174  df-mpt 5193  df-id 5553  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-f1 6571  df-fo 6572  df-f1o 6573  df-fv 6574  df-ov 7454  df-oprab 7455  df-mpo 7456  df-fbas 21726  df-fg 21727  df-fm 24312
This theorem is used by:  fmfg  24323  elfm3  24324  imaelfm  24325
  Copyright terms: Public domain W3C validator