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

Theorem sstskm 10815
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 10812 . . . 4 (𝐴𝑉 → (tarskiMap‘𝐴) = {𝑥 ∈ Tarski ∣ 𝐴𝑥})
2 df-rab 3418 . . . . 5 {𝑥 ∈ Tarski ∣ 𝐴𝑥} = {𝑥 ∣ (𝑥 ∈ Tarski ∧ 𝐴𝑥)}
32inteqi 4912 . . . 4 {𝑥 ∈ Tarski ∣ 𝐴𝑥} = {𝑥 ∣ (𝑥 ∈ Tarski ∧ 𝐴𝑥)}
41, 3eqtrdi 2816 . . 3 (𝐴𝑉 → (tarskiMap‘𝐴) = {𝑥 ∣ (𝑥 ∈ Tarski ∧ 𝐴𝑥)})
54sseq2d 3971 . 2 (𝐴𝑉 → (𝐵 ⊆ (tarskiMap‘𝐴) ↔ 𝐵 {𝑥 ∣ (𝑥 ∈ Tarski ∧ 𝐴𝑥)}))
6 impexp 455 . . . 4 (((𝑥 ∈ Tarski ∧ 𝐴𝑥) → 𝐵𝑥) ↔ (𝑥 ∈ Tarski → (𝐴𝑥𝐵𝑥)))
76albii 1842 . . 3 (∀𝑥((𝑥 ∈ Tarski ∧ 𝐴𝑥) → 𝐵𝑥) ↔ ∀𝑥(𝑥 ∈ Tarski → (𝐴𝑥𝐵𝑥)))
8 ssintab 4926 . . 3 (𝐵 {𝑥 ∣ (𝑥 ∈ Tarski ∧ 𝐴𝑥)} ↔ ∀𝑥((𝑥 ∈ Tarski ∧ 𝐴𝑥) → 𝐵𝑥))
9 df-ral 3080 . . 3 (∀𝑥 ∈ Tarski (𝐴𝑥𝐵𝑥) ↔ ∀𝑥(𝑥 ∈ Tarski → (𝐴𝑥𝐵𝑥)))
107, 8, 93bitr4i 306 . 2 (𝐵 {𝑥 ∣ (𝑥 ∈ Tarski ∧ 𝐴𝑥)} ↔ ∀𝑥 ∈ Tarski (𝐴𝑥𝐵𝑥))
115, 10bitrdi 290 1 (𝐴𝑉 → (𝐵 ⊆ (tarskiMap‘𝐴) ↔ ∀𝑥 ∈ Tarski (𝐴𝑥𝐵𝑥)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 209  wa 400  wal 1561  wcel 2145  {cab 2743  wral 3079  {crab 3417  wss 3907   cint 4908  cfv 6525  Tarskictsk 10721  tarskiMapctskm 10810
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1818  ax-4 1832  ax-5 1933  ax-6 1990  ax-7 2031  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2215  ax-ext 2737  ax-sep 5251  ax-pr 5395  ax-groth 10796
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1103  df-tru 1566  df-fal 1576  df-ex 1803  df-nf 1807  df-sb 2094  df-mo 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ne 2961  df-ral 3080  df-rex 3090  df-rab 3418  df-v 3459  df-dif 3910  df-un 3912  df-in 3914  df-ss 3924  df-nul 4289  df-if 4484  df-pw 4560  df-sn 4586  df-pr 4588  df-op 4592  df-uni 4869  df-int 4909  df-br 5106  df-opab 5168  df-mpt 5187  df-id 5547  df-xp 5658  df-rel 5659  df-cnv 5660  df-co 5661  df-dm 5662  df-iota 6481  df-fun 6527  df-fv 6533  df-tsk 10722  df-tskm 10811
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator