![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > tskmid | Structured version Visualization version GIF version |
Description: The set 𝐴 is an element of the smallest Tarski class that contains 𝐴. CLASSES1 th. 5. (Contributed by FL, 30-Dec-2010.) (Proof shortened by Mario Carneiro, 21-Sep-2014.) |
Ref | Expression |
---|---|
tskmid | ⊢ (𝐴 ∈ 𝑉 → 𝐴 ∈ (tarskiMap‘𝐴)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | id 22 | . . . 4 ⊢ (𝐴 ∈ 𝑥 → 𝐴 ∈ 𝑥) | |
2 | 1 | rgenw 3063 | . . 3 ⊢ ∀𝑥 ∈ Tarski (𝐴 ∈ 𝑥 → 𝐴 ∈ 𝑥) |
3 | elintrabg 4966 | . . 3 ⊢ (𝐴 ∈ 𝑉 → (𝐴 ∈ ∩ {𝑥 ∈ Tarski ∣ 𝐴 ∈ 𝑥} ↔ ∀𝑥 ∈ Tarski (𝐴 ∈ 𝑥 → 𝐴 ∈ 𝑥))) | |
4 | 2, 3 | mpbiri 258 | . 2 ⊢ (𝐴 ∈ 𝑉 → 𝐴 ∈ ∩ {𝑥 ∈ Tarski ∣ 𝐴 ∈ 𝑥}) |
5 | tskmval 10877 | . 2 ⊢ (𝐴 ∈ 𝑉 → (tarskiMap‘𝐴) = ∩ {𝑥 ∈ Tarski ∣ 𝐴 ∈ 𝑥}) | |
6 | 4, 5 | eleqtrrd 2842 | 1 ⊢ (𝐴 ∈ 𝑉 → 𝐴 ∈ (tarskiMap‘𝐴)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∈ wcel 2106 ∀wral 3059 {crab 3433 ∩ cint 4951 ‘cfv 6563 Tarskictsk 10786 tarskiMapctskm 10875 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1908 ax-6 1965 ax-7 2005 ax-8 2108 ax-9 2116 ax-10 2139 ax-11 2155 ax-12 2175 ax-ext 2706 ax-sep 5302 ax-nul 5312 ax-pr 5438 ax-groth 10861 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1540 df-fal 1550 df-ex 1777 df-nf 1781 df-sb 2063 df-mo 2538 df-eu 2567 df-clab 2713 df-cleq 2727 df-clel 2814 df-nfc 2890 df-ne 2939 df-ral 3060 df-rex 3069 df-rab 3434 df-v 3480 df-dif 3966 df-un 3968 df-in 3970 df-ss 3980 df-nul 4340 df-if 4532 df-pw 4607 df-sn 4632 df-pr 4634 df-op 4638 df-uni 4913 df-int 4952 df-br 5149 df-opab 5211 df-mpt 5232 df-id 5583 df-xp 5695 df-rel 5696 df-cnv 5697 df-co 5698 df-dm 5699 df-iota 6516 df-fun 6565 df-fv 6571 df-tsk 10787 df-tskm 10876 |
This theorem is referenced by: eltskm 10881 |
Copyright terms: Public domain | W3C validator |