Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > dmopabss | Structured version Visualization version GIF version |
Description: Upper bound for the domain of a restricted class of ordered pairs. (Contributed by NM, 31-Jan-2004.) |
Ref | Expression |
---|---|
dmopabss | ⊢ dom {〈𝑥, 𝑦〉 ∣ (𝑥 ∈ 𝐴 ∧ 𝜑)} ⊆ 𝐴 |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | dmopab 5787 | . 2 ⊢ dom {〈𝑥, 𝑦〉 ∣ (𝑥 ∈ 𝐴 ∧ 𝜑)} = {𝑥 ∣ ∃𝑦(𝑥 ∈ 𝐴 ∧ 𝜑)} | |
2 | 19.42v 1953 | . . . 4 ⊢ (∃𝑦(𝑥 ∈ 𝐴 ∧ 𝜑) ↔ (𝑥 ∈ 𝐴 ∧ ∃𝑦𝜑)) | |
3 | 2 | abbii 2889 | . . 3 ⊢ {𝑥 ∣ ∃𝑦(𝑥 ∈ 𝐴 ∧ 𝜑)} = {𝑥 ∣ (𝑥 ∈ 𝐴 ∧ ∃𝑦𝜑)} |
4 | ssab2 4058 | . . 3 ⊢ {𝑥 ∣ (𝑥 ∈ 𝐴 ∧ ∃𝑦𝜑)} ⊆ 𝐴 | |
5 | 3, 4 | eqsstri 4004 | . 2 ⊢ {𝑥 ∣ ∃𝑦(𝑥 ∈ 𝐴 ∧ 𝜑)} ⊆ 𝐴 |
6 | 1, 5 | eqsstri 4004 | 1 ⊢ dom {〈𝑥, 𝑦〉 ∣ (𝑥 ∈ 𝐴 ∧ 𝜑)} ⊆ 𝐴 |
Colors of variables: wff setvar class |
Syntax hints: ∧ wa 398 ∃wex 1779 ∈ wcel 2113 {cab 2802 ⊆ wss 3939 {copab 5131 dom cdm 5558 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1969 ax-7 2014 ax-8 2115 ax-9 2123 ax-10 2144 ax-11 2160 ax-12 2176 ax-ext 2796 ax-sep 5206 ax-nul 5213 ax-pr 5333 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3an 1085 df-tru 1539 df-ex 1780 df-nf 1784 df-sb 2069 df-mo 2621 df-eu 2653 df-clab 2803 df-cleq 2817 df-clel 2896 df-nfc 2966 df-rab 3150 df-v 3499 df-dif 3942 df-un 3944 df-in 3946 df-ss 3955 df-nul 4295 df-if 4471 df-sn 4571 df-pr 4573 df-op 4577 df-br 5070 df-opab 5132 df-dm 5568 |
This theorem is referenced by: fvopab4ndm 6800 opabex 6986 perpln1 26499 dmadjss 29667 abrexdomjm 30270 abrexdom 35009 |
Copyright terms: Public domain | W3C validator |