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

Theorem sstskm 10763
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 10760 . . . 4 (𝐴𝑉 → (tarskiMap‘𝐴) = {𝑥 ∈ Tarski ∣ 𝐴𝑥})
2 df-rab 3393 . . . . 5 {𝑥 ∈ Tarski ∣ 𝐴𝑥} = {𝑥 ∣ (𝑥 ∈ Tarski ∧ 𝐴𝑥)}
32inteqi 4888 . . . 4 {𝑥 ∈ Tarski ∣ 𝐴𝑥} = {𝑥 ∣ (𝑥 ∈ Tarski ∧ 𝐴𝑥)}
41, 3eqtrdi 2791 . . 3 (𝐴𝑉 → (tarskiMap‘𝐴) = {𝑥 ∣ (𝑥 ∈ Tarski ∧ 𝐴𝑥)})
54sseq2d 3954 . 2 (𝐴𝑉 → (𝐵 ⊆ (tarskiMap‘𝐴) ↔ 𝐵 {𝑥 ∣ (𝑥 ∈ Tarski ∧ 𝐴𝑥)}))
6 impexp 451 . . . 4 (((𝑥 ∈ Tarski ∧ 𝐴𝑥) → 𝐵𝑥) ↔ (𝑥 ∈ Tarski → (𝐴𝑥𝐵𝑥)))
76albii 1826 . . 3 (∀𝑥((𝑥 ∈ Tarski ∧ 𝐴𝑥) → 𝐵𝑥) ↔ ∀𝑥(𝑥 ∈ Tarski → (𝐴𝑥𝐵𝑥)))
8 ssintab 4902 . . 3 (𝐵 {𝑥 ∣ (𝑥 ∈ Tarski ∧ 𝐴𝑥)} ↔ ∀𝑥((𝑥 ∈ Tarski ∧ 𝐴𝑥) → 𝐵𝑥))
9 df-ral 3055 . . 3 (∀𝑥 ∈ Tarski (𝐴𝑥𝐵𝑥) ↔ ∀𝑥(𝑥 ∈ Tarski → (𝐴𝑥𝐵𝑥)))
107, 8, 93bitr4i 304 . 2 (𝐵 {𝑥 ∣ (𝑥 ∈ Tarski ∧ 𝐴𝑥)} ↔ ∀𝑥 ∈ Tarski (𝐴𝑥𝐵𝑥))
115, 10bitrdi 288 1 (𝐴𝑉 → (𝐵 ⊆ (tarskiMap‘𝐴) ↔ ∀𝑥 ∈ Tarski (𝐴𝑥𝐵𝑥)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 207  wa 396  wal 1545  wcel 2119  {cab 2718  wral 3054  {crab 3392  wss 3890   cint 4884  cfv 6492  Tarskictsk 10669  tarskiMapctskm 10758
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 1974  ax-7 2015  ax-8 2121  ax-9 2129  ax-10 2152  ax-11 2168  ax-12 2189  ax-ext 2712  ax-sep 5225  ax-pr 5369  ax-groth 10744
This theorem depends on definitions:  df-bi 208  df-an 397  df-or 854  df-3an 1094  df-tru 1550  df-fal 1560  df-ex 1787  df-nf 1791  df-sb 2074  df-mo 2543  df-eu 2573  df-clab 2719  df-cleq 2732  df-clel 2815  df-nfc 2889  df-ne 2936  df-ral 3055  df-rex 3065  df-rab 3393  df-v 3434  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-nul 4269  df-if 4462  df-pw 4538  df-sn 4563  df-pr 4565  df-op 4569  df-uni 4846  df-int 4885  df-br 5080  df-opab 5142  df-mpt 5161  df-id 5520  df-xp 5631  df-rel 5632  df-cnv 5633  df-co 5634  df-dm 5635  df-iota 6448  df-fun 6494  df-fv 6500  df-tsk 10670  df-tskm 10759
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator