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

Theorem sstskm 10609
Description: Being a part of (tarskiMap‘𝐴). (Contributed by FL, 17-Apr-2011.) (Proof shortened by Mario Carneiro, 20-Sep-2014.)
Assertion
Ref Expression
sstskm (𝐴𝑉 → (𝐵 ⊆ (tarskiMap‘𝐴) ↔ ∀𝑥 ∈ Tarski (𝐴𝑥𝐵𝑥)))
Distinct variable groups:   𝑥,𝐴   𝑥,𝐵
Allowed substitution hint:   𝑉(𝑥)

Proof of Theorem sstskm
StepHypRef Expression
1 tskmval 10606 . . . 4 (𝐴𝑉 → (tarskiMap‘𝐴) = {𝑥 ∈ Tarski ∣ 𝐴𝑥})
2 df-rab 3075 . . . . 5 {𝑥 ∈ Tarski ∣ 𝐴𝑥} = {𝑥 ∣ (𝑥 ∈ Tarski ∧ 𝐴𝑥)}
32inteqi 4889 . . . 4 {𝑥 ∈ Tarski ∣ 𝐴𝑥} = {𝑥 ∣ (𝑥 ∈ Tarski ∧ 𝐴𝑥)}
41, 3eqtrdi 2796 . . 3 (𝐴𝑉 → (tarskiMap‘𝐴) = {𝑥 ∣ (𝑥 ∈ Tarski ∧ 𝐴𝑥)})
54sseq2d 3958 . 2 (𝐴𝑉 → (𝐵 ⊆ (tarskiMap‘𝐴) ↔ 𝐵 {𝑥 ∣ (𝑥 ∈ Tarski ∧ 𝐴𝑥)}))
6 impexp 451 . . . 4 (((𝑥 ∈ Tarski ∧ 𝐴𝑥) → 𝐵𝑥) ↔ (𝑥 ∈ Tarski → (𝐴𝑥𝐵𝑥)))
76albii 1826 . . 3 (∀𝑥((𝑥 ∈ Tarski ∧ 𝐴𝑥) → 𝐵𝑥) ↔ ∀𝑥(𝑥 ∈ Tarski → (𝐴𝑥𝐵𝑥)))
8 ssintab 4902 . . 3 (𝐵 {𝑥 ∣ (𝑥 ∈ Tarski ∧ 𝐴𝑥)} ↔ ∀𝑥((𝑥 ∈ Tarski ∧ 𝐴𝑥) → 𝐵𝑥))
9 df-ral 3071 . . 3 (∀𝑥 ∈ Tarski (𝐴𝑥𝐵𝑥) ↔ ∀𝑥(𝑥 ∈ Tarski → (𝐴𝑥𝐵𝑥)))
107, 8, 93bitr4i 303 . 2 (𝐵 {𝑥 ∣ (𝑥 ∈ Tarski ∧ 𝐴𝑥)} ↔ ∀𝑥 ∈ Tarski (𝐴𝑥𝐵𝑥))
115, 10bitrdi 287 1 (𝐴𝑉 → (𝐵 ⊆ (tarskiMap‘𝐴) ↔ ∀𝑥 ∈ Tarski (𝐴𝑥𝐵𝑥)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 205  wa 396  wal 1540  wcel 2110  {cab 2717  wral 3066  {crab 3070  wss 3892   cint 4885  cfv 6432  Tarskictsk 10515  tarskiMapctskm 10604
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 2015  ax-8 2112  ax-9 2120  ax-10 2141  ax-11 2158  ax-12 2175  ax-ext 2711  ax-sep 5227  ax-nul 5234  ax-pr 5356  ax-groth 10590
This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-3an 1088  df-tru 1545  df-fal 1555  df-ex 1787  df-nf 1791  df-sb 2072  df-mo 2542  df-eu 2571  df-clab 2718  df-cleq 2732  df-clel 2818  df-nfc 2891  df-ne 2946  df-ral 3071  df-rex 3072  df-rab 3075  df-v 3433  df-dif 3895  df-un 3897  df-in 3899  df-ss 3909  df-nul 4263  df-if 4466  df-pw 4541  df-sn 4568  df-pr 4570  df-op 4574  df-uni 4846  df-int 4886  df-br 5080  df-opab 5142  df-mpt 5163  df-id 5490  df-xp 5596  df-rel 5597  df-cnv 5598  df-co 5599  df-dm 5600  df-iota 6390  df-fun 6434  df-fv 6440  df-tsk 10516  df-tskm 10605
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator