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

Theorem eltskm 10834
Description: Belonging to (tarskiMap‘𝐴). (Contributed by FL, 17-Apr-2011.) (Proof shortened by Mario Carneiro, 21-Sep-2014.)
Assertion
Ref Expression
eltskm (𝐴𝑉 → (𝐵 ∈ (tarskiMap‘𝐴) ↔ ∀𝑥 ∈ Tarski (𝐴𝑥𝐵𝑥)))
Distinct variable groups:   𝑥,𝐴   𝑥,𝐵
Allowed substitution hint:   𝑉(𝑥)

Proof of Theorem eltskm
StepHypRef Expression
1 tskmval 10830 . . 3 (𝐴𝑉 → (tarskiMap‘𝐴) = {𝑥 ∈ Tarski ∣ 𝐴𝑥})
21eleq2d 2848 . 2 (𝐴𝑉 → (𝐵 ∈ (tarskiMap‘𝐴) ↔ 𝐵 {𝑥 ∈ Tarski ∣ 𝐴𝑥}))
3 elex 3475 . . . 4 (𝐵 {𝑥 ∈ Tarski ∣ 𝐴𝑥} → 𝐵 ∈ V)
43a1i 11 . . 3 (𝐴𝑉 → (𝐵 {𝑥 ∈ Tarski ∣ 𝐴𝑥} → 𝐵 ∈ V))
5 tskmid 10831 . . . . 5 (𝐴𝑉𝐴 ∈ (tarskiMap‘𝐴))
6 tskmcl 10832 . . . . . 6 (tarskiMap‘𝐴) ∈ Tarski
7 eleq2 2851 . . . . . . . 8 (𝑥 = (tarskiMap‘𝐴) → (𝐴𝑥𝐴 ∈ (tarskiMap‘𝐴)))
8 eleq2 2851 . . . . . . . 8 (𝑥 = (tarskiMap‘𝐴) → (𝐵𝑥𝐵 ∈ (tarskiMap‘𝐴)))
97, 8imbi12d 347 . . . . . . 7 (𝑥 = (tarskiMap‘𝐴) → ((𝐴𝑥𝐵𝑥) ↔ (𝐴 ∈ (tarskiMap‘𝐴) → 𝐵 ∈ (tarskiMap‘𝐴))))
109rspcv 3576 . . . . . 6 ((tarskiMap‘𝐴) ∈ Tarski → (∀𝑥 ∈ Tarski (𝐴𝑥𝐵𝑥) → (𝐴 ∈ (tarskiMap‘𝐴) → 𝐵 ∈ (tarskiMap‘𝐴))))
116, 10ax-mp 5 . . . . 5 (∀𝑥 ∈ Tarski (𝐴𝑥𝐵𝑥) → (𝐴 ∈ (tarskiMap‘𝐴) → 𝐵 ∈ (tarskiMap‘𝐴)))
125, 11syl5com 32 . . . 4 (𝐴𝑉 → (∀𝑥 ∈ Tarski (𝐴𝑥𝐵𝑥) → 𝐵 ∈ (tarskiMap‘𝐴)))
13 elex 3475 . . . 4 (𝐵 ∈ (tarskiMap‘𝐴) → 𝐵 ∈ V)
1412, 13syl6 36 . . 3 (𝐴𝑉 → (∀𝑥 ∈ Tarski (𝐴𝑥𝐵𝑥) → 𝐵 ∈ V))
15 elintrabg 4925 . . . 4 (𝐵 ∈ V → (𝐵 {𝑥 ∈ Tarski ∣ 𝐴𝑥} ↔ ∀𝑥 ∈ Tarski (𝐴𝑥𝐵𝑥)))
1615a1i 11 . . 3 (𝐴𝑉 → (𝐵 ∈ V → (𝐵 {𝑥 ∈ Tarski ∣ 𝐴𝑥} ↔ ∀𝑥 ∈ Tarski (𝐴𝑥𝐵𝑥))))
174, 14, 16pm5.21ndd 382 . 2 (𝐴𝑉 → (𝐵 {𝑥 ∈ Tarski ∣ 𝐴𝑥} ↔ ∀𝑥 ∈ Tarski (𝐴𝑥𝐵𝑥)))
182, 17bitrd 282 1 (𝐴𝑉 → (𝐵 ∈ (tarskiMap‘𝐴) ↔ ∀𝑥 ∈ Tarski (𝐴𝑥𝐵𝑥)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4  wb 209   = wceq 1569  wcel 2142  wral 3078  {crab 3415  Vcvv 3454   cint 4911  cfv 6536  Tarskictsk 10739  tarskiMapctskm 10828
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1824  ax-4 1838  ax-5 1939  ax-6 1996  ax-7 2037  ax-8 2144  ax-9 2152  ax-10 2175  ax-11 2191  ax-12 2212  ax-ext 2734  ax-sep 5256  ax-nul 5268  ax-pow 5335  ax-pr 5403  ax-un 7734  ax-groth 10814
This proof depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1104  df-tru 1572  df-fal 1582  df-ex 1809  df-nf 1813  df-sb 2096  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-ral 3079  df-rex 3089  df-rab 3416  df-v 3456  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-nul 4286  df-if 4487  df-pw 4563  df-sn 4589  df-pr 4591  df-op 4595  df-uni 4872  df-int 4912  df-br 5109  df-opab 5173  df-mpt 5192  df-id 5555  df-xp 5666  df-rel 5667  df-cnv 5668  df-co 5669  df-dm 5670  df-rn 5671  df-res 5672  df-ima 5673  df-iota 6492  df-fun 6538  df-fn 6539  df-f 6540  df-f1 6541  df-fo 6542  df-f1o 6543  df-fv 6544  df-er 8692  df-en 8942  df-dom 8943  df-tsk 10740  df-tskm 10829
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator