Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > ssoprab2 | Structured version Visualization version GIF version |
Description: Equivalence of ordered pair abstraction subclass and implication. Compare ssopab2 4926. (Contributed by FL, 6-Nov-2013.) (Proof shortened by Mario Carneiro, 11-Dec-2016.) |
Ref | Expression |
---|---|
ssoprab2 | ⊢ (∀𝑥∀𝑦∀𝑧(𝜑 → 𝜓) → {〈〈𝑥, 𝑦〉, 𝑧〉 ∣ 𝜑} ⊆ {〈〈𝑥, 𝑦〉, 𝑧〉 ∣ 𝜓}) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | id 22 | . . . . . . 7 ⊢ ((𝜑 → 𝜓) → (𝜑 → 𝜓)) | |
2 | 1 | anim2d 587 | . . . . . 6 ⊢ ((𝜑 → 𝜓) → ((𝑤 = 〈〈𝑥, 𝑦〉, 𝑧〉 ∧ 𝜑) → (𝑤 = 〈〈𝑥, 𝑦〉, 𝑧〉 ∧ 𝜓))) |
3 | 2 | aleximi 1749 | . . . . 5 ⊢ (∀𝑧(𝜑 → 𝜓) → (∃𝑧(𝑤 = 〈〈𝑥, 𝑦〉, 𝑧〉 ∧ 𝜑) → ∃𝑧(𝑤 = 〈〈𝑥, 𝑦〉, 𝑧〉 ∧ 𝜓))) |
4 | 3 | aleximi 1749 | . . . 4 ⊢ (∀𝑦∀𝑧(𝜑 → 𝜓) → (∃𝑦∃𝑧(𝑤 = 〈〈𝑥, 𝑦〉, 𝑧〉 ∧ 𝜑) → ∃𝑦∃𝑧(𝑤 = 〈〈𝑥, 𝑦〉, 𝑧〉 ∧ 𝜓))) |
5 | 4 | aleximi 1749 | . . 3 ⊢ (∀𝑥∀𝑦∀𝑧(𝜑 → 𝜓) → (∃𝑥∃𝑦∃𝑧(𝑤 = 〈〈𝑥, 𝑦〉, 𝑧〉 ∧ 𝜑) → ∃𝑥∃𝑦∃𝑧(𝑤 = 〈〈𝑥, 𝑦〉, 𝑧〉 ∧ 𝜓))) |
6 | 5 | ss2abdv 3638 | . 2 ⊢ (∀𝑥∀𝑦∀𝑧(𝜑 → 𝜓) → {𝑤 ∣ ∃𝑥∃𝑦∃𝑧(𝑤 = 〈〈𝑥, 𝑦〉, 𝑧〉 ∧ 𝜑)} ⊆ {𝑤 ∣ ∃𝑥∃𝑦∃𝑧(𝑤 = 〈〈𝑥, 𝑦〉, 𝑧〉 ∧ 𝜓)}) |
7 | df-oprab 6553 | . 2 ⊢ {〈〈𝑥, 𝑦〉, 𝑧〉 ∣ 𝜑} = {𝑤 ∣ ∃𝑥∃𝑦∃𝑧(𝑤 = 〈〈𝑥, 𝑦〉, 𝑧〉 ∧ 𝜑)} | |
8 | df-oprab 6553 | . 2 ⊢ {〈〈𝑥, 𝑦〉, 𝑧〉 ∣ 𝜓} = {𝑤 ∣ ∃𝑥∃𝑦∃𝑧(𝑤 = 〈〈𝑥, 𝑦〉, 𝑧〉 ∧ 𝜓)} | |
9 | 6, 7, 8 | 3sstr4g 3609 | 1 ⊢ (∀𝑥∀𝑦∀𝑧(𝜑 → 𝜓) → {〈〈𝑥, 𝑦〉, 𝑧〉 ∣ 𝜑} ⊆ {〈〈𝑥, 𝑦〉, 𝑧〉 ∣ 𝜓}) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 383 ∀wal 1473 = wceq 1475 ∃wex 1695 {cab 2596 ⊆ wss 3540 〈cop 4131 {coprab 6550 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1713 ax-4 1728 ax-5 1827 ax-6 1875 ax-7 1922 ax-10 2006 ax-11 2021 ax-12 2034 ax-13 2234 ax-ext 2590 |
This theorem depends on definitions: df-bi 196 df-or 384 df-an 385 df-tru 1478 df-ex 1696 df-nf 1701 df-sb 1868 df-clab 2597 df-cleq 2603 df-clel 2606 df-nfc 2740 df-in 3547 df-ss 3554 df-oprab 6553 |
This theorem is referenced by: ssoprab2b 6610 joinfval 16824 meetfval 16838 |
Copyright terms: Public domain | W3C validator |