| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > eltskm | Structured version Visualization version GIF version | ||
| Description: Belonging to (tarskiMap‘𝐴). (Contributed by FL, 17-Apr-2011.) (Proof shortened by Mario Carneiro, 21-Sep-2014.) |
| Ref | Expression |
|---|---|
| eltskm | ⊢ (𝐴 ∈ 𝑉 → (𝐵 ∈ (tarskiMap‘𝐴) ↔ ∀𝑥 ∈ Tarski (𝐴 ∈ 𝑥 → 𝐵 ∈ 𝑥))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | tskmval 10823 | . . 3 ⊢ (𝐴 ∈ 𝑉 → (tarskiMap‘𝐴) = ∩ {𝑥 ∈ Tarski ∣ 𝐴 ∈ 𝑥}) | |
| 2 | 1 | eleq2d 2847 | . 2 ⊢ (𝐴 ∈ 𝑉 → (𝐵 ∈ (tarskiMap‘𝐴) ↔ 𝐵 ∈ ∩ {𝑥 ∈ Tarski ∣ 𝐴 ∈ 𝑥})) |
| 3 | elex 3474 | . . . 4 ⊢ (𝐵 ∈ ∩ {𝑥 ∈ Tarski ∣ 𝐴 ∈ 𝑥} → 𝐵 ∈ V) | |
| 4 | 3 | a1i 11 | . . 3 ⊢ (𝐴 ∈ 𝑉 → (𝐵 ∈ ∩ {𝑥 ∈ Tarski ∣ 𝐴 ∈ 𝑥} → 𝐵 ∈ V)) |
| 5 | tskmid 10824 | . . . . 5 ⊢ (𝐴 ∈ 𝑉 → 𝐴 ∈ (tarskiMap‘𝐴)) | |
| 6 | tskmcl 10825 | . . . . . 6 ⊢ (tarskiMap‘𝐴) ∈ Tarski | |
| 7 | eleq2 2850 | . . . . . . . 8 ⊢ (𝑥 = (tarskiMap‘𝐴) → (𝐴 ∈ 𝑥 ↔ 𝐴 ∈ (tarskiMap‘𝐴))) | |
| 8 | eleq2 2850 | . . . . . . . 8 ⊢ (𝑥 = (tarskiMap‘𝐴) → (𝐵 ∈ 𝑥 ↔ 𝐵 ∈ (tarskiMap‘𝐴))) | |
| 9 | 7, 8 | imbi12d 347 | . . . . . . 7 ⊢ (𝑥 = (tarskiMap‘𝐴) → ((𝐴 ∈ 𝑥 → 𝐵 ∈ 𝑥) ↔ (𝐴 ∈ (tarskiMap‘𝐴) → 𝐵 ∈ (tarskiMap‘𝐴)))) |
| 10 | 9 | rspcv 3576 | . . . . . 6 ⊢ ((tarskiMap‘𝐴) ∈ Tarski → (∀𝑥 ∈ Tarski (𝐴 ∈ 𝑥 → 𝐵 ∈ 𝑥) → (𝐴 ∈ (tarskiMap‘𝐴) → 𝐵 ∈ (tarskiMap‘𝐴)))) |
| 11 | 6, 10 | ax-mp 5 | . . . . 5 ⊢ (∀𝑥 ∈ Tarski (𝐴 ∈ 𝑥 → 𝐵 ∈ 𝑥) → (𝐴 ∈ (tarskiMap‘𝐴) → 𝐵 ∈ (tarskiMap‘𝐴))) |
| 12 | 5, 11 | syl5com 32 | . . . 4 ⊢ (𝐴 ∈ 𝑉 → (∀𝑥 ∈ Tarski (𝐴 ∈ 𝑥 → 𝐵 ∈ 𝑥) → 𝐵 ∈ (tarskiMap‘𝐴))) |
| 13 | elex 3474 | . . . 4 ⊢ (𝐵 ∈ (tarskiMap‘𝐴) → 𝐵 ∈ V) | |
| 14 | 12, 13 | syl6 36 | . . 3 ⊢ (𝐴 ∈ 𝑉 → (∀𝑥 ∈ Tarski (𝐴 ∈ 𝑥 → 𝐵 ∈ 𝑥) → 𝐵 ∈ V)) |
| 15 | elintrabg 4925 | . . . 4 ⊢ (𝐵 ∈ V → (𝐵 ∈ ∩ {𝑥 ∈ Tarski ∣ 𝐴 ∈ 𝑥} ↔ ∀𝑥 ∈ Tarski (𝐴 ∈ 𝑥 → 𝐵 ∈ 𝑥))) | |
| 16 | 15 | a1i 11 | . . 3 ⊢ (𝐴 ∈ 𝑉 → (𝐵 ∈ V → (𝐵 ∈ ∩ {𝑥 ∈ Tarski ∣ 𝐴 ∈ 𝑥} ↔ ∀𝑥 ∈ Tarski (𝐴 ∈ 𝑥 → 𝐵 ∈ 𝑥)))) |
| 17 | 4, 14, 16 | pm5.21ndd 382 | . 2 ⊢ (𝐴 ∈ 𝑉 → (𝐵 ∈ ∩ {𝑥 ∈ Tarski ∣ 𝐴 ∈ 𝑥} ↔ ∀𝑥 ∈ Tarski (𝐴 ∈ 𝑥 → 𝐵 ∈ 𝑥))) |
| 18 | 2, 17 | bitrd 282 | 1 ⊢ (𝐴 ∈ 𝑉 → (𝐵 ∈ (tarskiMap‘𝐴) ↔ ∀𝑥 ∈ Tarski (𝐴 ∈ 𝑥 → 𝐵 ∈ 𝑥))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 209 = wceq 1568 ∈ wcel 2141 ∀wral 3077 {crab 3414 Vcvv 3453 ∩ cint 4911 ‘cfv 6536 Tarskictsk 10732 tarskiMapctskm 10821 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1823 ax-4 1837 ax-5 1938 ax-6 1995 ax-7 2036 ax-8 2143 ax-9 2151 ax-10 2174 ax-11 2190 ax-12 2211 ax-ext 2733 ax-sep 5256 ax-nul 5268 ax-pow 5336 ax-pr 5404 ax-un 7732 ax-groth 10807 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1103 df-tru 1571 df-fal 1581 df-ex 1808 df-nf 1812 df-sb 2095 df-mo 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-ral 3078 df-rex 3088 df-rab 3415 df-v 3455 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 5556 df-xp 5667 df-rel 5668 df-cnv 5669 df-co 5670 df-dm 5671 df-rn 5672 df-res 5673 df-ima 5674 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 8693 df-en 8943 df-dom 8944 df-tsk 10733 df-tskm 10822 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |