![]() |
Mathbox for Emmett Weisz |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > Mathboxes > elpglem1 | Structured version Visualization version GIF version |
Description: Lemma for elpg 47053. (Contributed by Emmett Weisz, 28-Aug-2021.) |
Ref | Expression |
---|---|
elpglem1 | ⊢ (∃𝑥(𝑥 ⊆ Pg ∧ ((1st ‘𝐴) ∈ 𝒫 𝑥 ∧ (2nd ‘𝐴) ∈ 𝒫 𝑥)) → ((1st ‘𝐴) ⊆ Pg ∧ (2nd ‘𝐴) ⊆ Pg)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | elpwi 4565 | . . . . 5 ⊢ ((1st ‘𝐴) ∈ 𝒫 𝑥 → (1st ‘𝐴) ⊆ 𝑥) | |
2 | 1 | adantl 482 | . . . 4 ⊢ ((𝑥 ⊆ Pg ∧ (1st ‘𝐴) ∈ 𝒫 𝑥) → (1st ‘𝐴) ⊆ 𝑥) |
3 | simpl 483 | . . . 4 ⊢ ((𝑥 ⊆ Pg ∧ (1st ‘𝐴) ∈ 𝒫 𝑥) → 𝑥 ⊆ Pg) | |
4 | 2, 3 | sstrd 3952 | . . 3 ⊢ ((𝑥 ⊆ Pg ∧ (1st ‘𝐴) ∈ 𝒫 𝑥) → (1st ‘𝐴) ⊆ Pg) |
5 | elpwi 4565 | . . . . 5 ⊢ ((2nd ‘𝐴) ∈ 𝒫 𝑥 → (2nd ‘𝐴) ⊆ 𝑥) | |
6 | 5 | adantl 482 | . . . 4 ⊢ ((𝑥 ⊆ Pg ∧ (2nd ‘𝐴) ∈ 𝒫 𝑥) → (2nd ‘𝐴) ⊆ 𝑥) |
7 | simpl 483 | . . . 4 ⊢ ((𝑥 ⊆ Pg ∧ (2nd ‘𝐴) ∈ 𝒫 𝑥) → 𝑥 ⊆ Pg) | |
8 | 6, 7 | sstrd 3952 | . . 3 ⊢ ((𝑥 ⊆ Pg ∧ (2nd ‘𝐴) ∈ 𝒫 𝑥) → (2nd ‘𝐴) ⊆ Pg) |
9 | 4, 8 | anim12dan 619 | . 2 ⊢ ((𝑥 ⊆ Pg ∧ ((1st ‘𝐴) ∈ 𝒫 𝑥 ∧ (2nd ‘𝐴) ∈ 𝒫 𝑥)) → ((1st ‘𝐴) ⊆ Pg ∧ (2nd ‘𝐴) ⊆ Pg)) |
10 | 9 | exlimiv 1933 | 1 ⊢ (∃𝑥(𝑥 ⊆ Pg ∧ ((1st ‘𝐴) ∈ 𝒫 𝑥 ∧ (2nd ‘𝐴) ∈ 𝒫 𝑥)) → ((1st ‘𝐴) ⊆ Pg ∧ (2nd ‘𝐴) ⊆ Pg)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 396 ∃wex 1781 ∈ wcel 2106 ⊆ wss 3908 𝒫 cpw 4558 ‘cfv 6493 1st c1st 7911 2nd c2nd 7912 Pgcpg 47048 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-ext 2708 |
This theorem depends on definitions: df-bi 206 df-an 397 df-tru 1544 df-ex 1782 df-sb 2068 df-clab 2715 df-cleq 2729 df-clel 2815 df-v 3445 df-in 3915 df-ss 3925 df-pw 4560 |
This theorem is referenced by: elpg 47053 |
Copyright terms: Public domain | W3C validator |