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

Theorem elfm2 24267
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 24266 . 2 ((𝑋 ∈ 𝐶 ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌⟶𝑋) → (𝐴 ∈ ((𝑋 FilMap 𝐹)‘𝐵) ↔ (𝐴 ⊆ 𝑋 ∧ ∃𝑦 ∈ 𝐵 (𝐹 “ 𝑦) ⊆ 𝐴)))
2 ssfg 24191 . . . . . . . . . 10 (𝐵 ∈ (fBas‘𝑌) → 𝐵 ⊆ (𝑌filGen𝐵))
3 elfm2.l . . . . . . . . . 10 𝐿 = (𝑌filGen𝐵)
42, 3sseqtrrdi 3972 . . . . . . . . 9 (𝐵 ∈ (fBas‘𝑌) → 𝐵 ⊆ 𝐿)
54sselda 3931 . . . . . . . 8 ((𝐵 ∈ (fBas‘𝑌) ∧ 𝑦 ∈ 𝐵) → 𝑦 ∈ 𝐿)
65adantrr 730 . . . . . . 7 ((𝐵 ∈ (fBas‘𝑌) ∧ (𝑦 ∈ 𝐵 ∧ (𝐹 “ 𝑦) ⊆ 𝐴)) → 𝑦 ∈ 𝐿)
763ad2antl2 1205 . . . . . 6 (((𝑋 ∈ 𝐶 ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌⟶𝑋) ∧ (𝑦 ∈ 𝐵 ∧ (𝐹 “ 𝑦) ⊆ 𝐴)) → 𝑦 ∈ 𝐿)
8 simprr 785 . . . . . 6 (((𝑋 ∈ 𝐶 ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌⟶𝑋) ∧ (𝑦 ∈ 𝐵 ∧ (𝐹 “ 𝑦) ⊆ 𝐴)) → (𝐹 “ 𝑦) ⊆ 𝐴)
9 imaeq2 6048 . . . . . . . 8 (𝑥 = 𝑦 → (𝐹 “ 𝑥) = (𝐹 “ 𝑦))
109sseq1d 3962 . . . . . . 7 (𝑥 = 𝑦 → ((𝐹 “ 𝑥) ⊆ 𝐴 ↔ (𝐹 “ 𝑦) ⊆ 𝐴))
1110rspcev 3577 . . . . . 6 ((𝑦 ∈ 𝐿 ∧ (𝐹 “ 𝑦) ⊆ 𝐴) → ∃𝑥 ∈ 𝐿 (𝐹 “ 𝑥) ⊆ 𝐴)
127, 8, 11syl2anc 596 . . . . 5 (((𝑋 ∈ 𝐶 ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌⟶𝑋) ∧ (𝑦 ∈ 𝐵 ∧ (𝐹 “ 𝑦) ⊆ 𝐴)) → ∃𝑥 ∈ 𝐿 (𝐹 “ 𝑥) ⊆ 𝐴)
1312rexlimdvaa 3165 . . . 4 ((𝑋 ∈ 𝐶 ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌⟶𝑋) → (∃𝑦 ∈ 𝐵 (𝐹 “ 𝑦) ⊆ 𝐴 → ∃𝑥 ∈ 𝐿 (𝐹 “ 𝑥) ⊆ 𝐴))
143eleq2i 2853 . . . . . . . 8 (𝑥 ∈ 𝐿 ↔ 𝑥 ∈ (𝑌filGen𝐵))
15 elfg 24190 . . . . . . . 8 (𝐵 ∈ (fBas‘𝑌) → (𝑥 ∈ (𝑌filGen𝐵) ↔ (𝑥 ⊆ 𝑌 ∧ ∃𝑦 ∈ 𝐵 𝑦 ⊆ 𝑥)))
1614, 15bitrid 286 . . . . . . 7 (𝐵 ∈ (fBas‘𝑌) → (𝑥 ∈ 𝐿 ↔ (𝑥 ⊆ 𝑌 ∧ ∃𝑦 ∈ 𝐵 𝑦 ⊆ 𝑥)))
17163ad2ant2 1152 . . . . . 6 ((𝑋 ∈ 𝐶 ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌⟶𝑋) → (𝑥 ∈ 𝐿 ↔ (𝑥 ⊆ 𝑌 ∧ ∃𝑦 ∈ 𝐵 𝑦 ⊆ 𝑥)))
18 imass2 6055 . . . . . . . . . . 11 (𝑦 ⊆ 𝑥 → (𝐹 “ 𝑦) ⊆ (𝐹 “ 𝑥))
19 sstr2 3938 . . . . . . . . . . . . 13 ((𝐹 “ 𝑦) ⊆ (𝐹 “ 𝑥) → ((𝐹 “ 𝑥) ⊆ 𝐴 → (𝐹 “ 𝑦) ⊆ 𝐴))
2019com12 33 . . . . . . . . . . . 12 ((𝐹 “ 𝑥) ⊆ 𝐴 → ((𝐹 “ 𝑦) ⊆ (𝐹 “ 𝑥) → (𝐹 “ 𝑦) ⊆ 𝐴))
2120ad2antll 742 . . . . . . . . . . 11 (((𝑋 ∈ 𝐶 ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌⟶𝑋) ∧ (𝑥 ⊆ 𝑌 ∧ (𝐹 “ 𝑥) ⊆ 𝐴)) → ((𝐹 “ 𝑦) ⊆ (𝐹 “ 𝑥) → (𝐹 “ 𝑦) ⊆ 𝐴))
2218, 21syl5 35 . . . . . . . . . 10 (((𝑋 ∈ 𝐶 ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌⟶𝑋) ∧ (𝑥 ⊆ 𝑌 ∧ (𝐹 “ 𝑥) ⊆ 𝐴)) → (𝑦 ⊆ 𝑥 → (𝐹 “ 𝑦) ⊆ 𝐴))
2322reximdv 3178 . . . . . . . . 9 (((𝑋 ∈ 𝐶 ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌⟶𝑋) ∧ (𝑥 ⊆ 𝑌 ∧ (𝐹 “ 𝑥) ⊆ 𝐴)) → (∃𝑦 ∈ 𝐵 𝑦 ⊆ 𝑥 → ∃𝑦 ∈ 𝐵 (𝐹 “ 𝑦) ⊆ 𝐴))
2423expr 462 . . . . . . . 8 (((𝑋 ∈ 𝐶 ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌⟶𝑋) ∧ 𝑥 ⊆ 𝑌) → ((𝐹 “ 𝑥) ⊆ 𝐴 → (∃𝑦 ∈ 𝐵 𝑦 ⊆ 𝑥 → ∃𝑦 ∈ 𝐵 (𝐹 “ 𝑦) ⊆ 𝐴)))
2524com23 87 . . . . . . 7 (((𝑋 ∈ 𝐶 ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌⟶𝑋) ∧ 𝑥 ⊆ 𝑌) → (∃𝑦 ∈ 𝐵 𝑦 ⊆ 𝑥 → ((𝐹 “ 𝑥) ⊆ 𝐴 → ∃𝑦 ∈ 𝐵 (𝐹 “ 𝑦) ⊆ 𝐴)))
2625expimpd 459 . . . . . 6 ((𝑋 ∈ 𝐶 ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌⟶𝑋) → ((𝑥 ⊆ 𝑌 ∧ ∃𝑦 ∈ 𝐵 𝑦 ⊆ 𝑥) → ((𝐹 “ 𝑥) ⊆ 𝐴 → ∃𝑦 ∈ 𝐵 (𝐹 “ 𝑦) ⊆ 𝐴)))
2717, 26sylbid 243 . . . . 5 ((𝑋 ∈ 𝐶 ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌⟶𝑋) → (𝑥 ∈ 𝐿 → ((𝐹 “ 𝑥) ⊆ 𝐴 → ∃𝑦 ∈ 𝐵 (𝐹 “ 𝑦) ⊆ 𝐴)))
2827rexlimdv 3162 . . . 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 2145  ∃wrex 3087   ⊆ wss 3899   “ cima 5654  ⟶wf 6534  ‘cfv 6538  (class class class)co 7420  fBascfbas 21666  filGencfg 21667   FilMap cfm 24252
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 2733  ax-rep 5232  ax-sep 5249  ax-nul 5260  ax-pow 5327  ax-pr 5391
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 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-nel 3063  df-ral 3078  df-rex 3088  df-reu 3367  df-rab 3414  df-v 3453  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 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-f1 6543  df-fo 6544  df-f1o 6545  df-fv 6546  df-ov 7423  df-oprab 7424  df-mpo 7425  df-fbas 21675  df-fg 21676  df-fm 24257
This theorem is used by:  fmfg  24268  elfm3  24269  imaelfm  24270
  Copyright terms: Public domain W3C validator