Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > ssopab2bw | Structured version Visualization version GIF version |
Description: Equivalence of ordered pair abstraction subclass and implication. Version of ssopab2b 5455 with a disjoint variable condition, which does not require ax-13 2372. (Contributed by NM, 27-Dec-1996.) (Revised by Gino Giotto, 26-Jan-2024.) |
Ref | Expression |
---|---|
ssopab2bw | ⊢ ({〈𝑥, 𝑦〉 ∣ 𝜑} ⊆ {〈𝑥, 𝑦〉 ∣ 𝜓} ↔ ∀𝑥∀𝑦(𝜑 → 𝜓)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | nfopab1 5140 | . . . 4 ⊢ Ⅎ𝑥{〈𝑥, 𝑦〉 ∣ 𝜑} | |
2 | nfopab1 5140 | . . . 4 ⊢ Ⅎ𝑥{〈𝑥, 𝑦〉 ∣ 𝜓} | |
3 | 1, 2 | nfss 3909 | . . 3 ⊢ Ⅎ𝑥{〈𝑥, 𝑦〉 ∣ 𝜑} ⊆ {〈𝑥, 𝑦〉 ∣ 𝜓} |
4 | nfopab2 5141 | . . . . 5 ⊢ Ⅎ𝑦{〈𝑥, 𝑦〉 ∣ 𝜑} | |
5 | nfopab2 5141 | . . . . 5 ⊢ Ⅎ𝑦{〈𝑥, 𝑦〉 ∣ 𝜓} | |
6 | 4, 5 | nfss 3909 | . . . 4 ⊢ Ⅎ𝑦{〈𝑥, 𝑦〉 ∣ 𝜑} ⊆ {〈𝑥, 𝑦〉 ∣ 𝜓} |
7 | ssel 3910 | . . . . 5 ⊢ ({〈𝑥, 𝑦〉 ∣ 𝜑} ⊆ {〈𝑥, 𝑦〉 ∣ 𝜓} → (〈𝑥, 𝑦〉 ∈ {〈𝑥, 𝑦〉 ∣ 𝜑} → 〈𝑥, 𝑦〉 ∈ {〈𝑥, 𝑦〉 ∣ 𝜓})) | |
8 | opabidw 5431 | . . . . 5 ⊢ (〈𝑥, 𝑦〉 ∈ {〈𝑥, 𝑦〉 ∣ 𝜑} ↔ 𝜑) | |
9 | opabidw 5431 | . . . . 5 ⊢ (〈𝑥, 𝑦〉 ∈ {〈𝑥, 𝑦〉 ∣ 𝜓} ↔ 𝜓) | |
10 | 7, 8, 9 | 3imtr3g 294 | . . . 4 ⊢ ({〈𝑥, 𝑦〉 ∣ 𝜑} ⊆ {〈𝑥, 𝑦〉 ∣ 𝜓} → (𝜑 → 𝜓)) |
11 | 6, 10 | alrimi 2209 | . . 3 ⊢ ({〈𝑥, 𝑦〉 ∣ 𝜑} ⊆ {〈𝑥, 𝑦〉 ∣ 𝜓} → ∀𝑦(𝜑 → 𝜓)) |
12 | 3, 11 | alrimi 2209 | . 2 ⊢ ({〈𝑥, 𝑦〉 ∣ 𝜑} ⊆ {〈𝑥, 𝑦〉 ∣ 𝜓} → ∀𝑥∀𝑦(𝜑 → 𝜓)) |
13 | ssopab2 5452 | . 2 ⊢ (∀𝑥∀𝑦(𝜑 → 𝜓) → {〈𝑥, 𝑦〉 ∣ 𝜑} ⊆ {〈𝑥, 𝑦〉 ∣ 𝜓}) | |
14 | 12, 13 | impbii 208 | 1 ⊢ ({〈𝑥, 𝑦〉 ∣ 𝜑} ⊆ {〈𝑥, 𝑦〉 ∣ 𝜓} ↔ ∀𝑥∀𝑦(𝜑 → 𝜓)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 205 ∀wal 1537 ∈ wcel 2108 ⊆ wss 3883 〈cop 4564 {copab 5132 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1799 ax-4 1813 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2110 ax-9 2118 ax-10 2139 ax-11 2156 ax-12 2173 ax-ext 2709 ax-sep 5218 ax-nul 5225 ax-pr 5347 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 844 df-3an 1087 df-tru 1542 df-fal 1552 df-ex 1784 df-nf 1788 df-sb 2069 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2817 df-nfc 2888 df-ral 3068 df-rab 3072 df-v 3424 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-nul 4254 df-if 4457 df-sn 4559 df-pr 4561 df-op 4565 df-opab 5133 |
This theorem is referenced by: eqopab2bw 5454 dffun2 6428 marypha2lem3 9126 cvmlift2lem12 33176 cossssid2 36513 |
Copyright terms: Public domain | W3C validator |