| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > ssoprab2i | GIF version | ||
| Description: Inference of operation class abstraction subclass from implication. (Contributed by NM, 11-Nov-1995.) (Revised by David Abernethy, 19-Jun-2012.) |
| Ref | Expression |
|---|---|
| ssoprab2i.1 | ⊢ (𝜑 → 𝜓) |
| Ref | Expression |
|---|---|
| ssoprab2i | ⊢ {〈〈𝑥, 𝑦〉, 𝑧〉 ∣ 𝜑} ⊆ {〈〈𝑥, 𝑦〉, 𝑧〉 ∣ 𝜓} |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ssoprab2i.1 | . . . . 5 ⊢ (𝜑 → 𝜓) | |
| 2 | 1 | anim2i 342 | . . . 4 ⊢ ((𝑤 = 〈𝑥, 𝑦〉 ∧ 𝜑) → (𝑤 = 〈𝑥, 𝑦〉 ∧ 𝜓)) |
| 3 | 2 | 2eximi 1649 | . . 3 ⊢ (∃𝑥∃𝑦(𝑤 = 〈𝑥, 𝑦〉 ∧ 𝜑) → ∃𝑥∃𝑦(𝑤 = 〈𝑥, 𝑦〉 ∧ 𝜓)) |
| 4 | 3 | ssopab2i 4372 | . 2 ⊢ {〈𝑤, 𝑧〉 ∣ ∃𝑥∃𝑦(𝑤 = 〈𝑥, 𝑦〉 ∧ 𝜑)} ⊆ {〈𝑤, 𝑧〉 ∣ ∃𝑥∃𝑦(𝑤 = 〈𝑥, 𝑦〉 ∧ 𝜓)} |
| 5 | dfoprab2 6067 | . 2 ⊢ {〈〈𝑥, 𝑦〉, 𝑧〉 ∣ 𝜑} = {〈𝑤, 𝑧〉 ∣ ∃𝑥∃𝑦(𝑤 = 〈𝑥, 𝑦〉 ∧ 𝜑)} | |
| 6 | dfoprab2 6067 | . 2 ⊢ {〈〈𝑥, 𝑦〉, 𝑧〉 ∣ 𝜓} = {〈𝑤, 𝑧〉 ∣ ∃𝑥∃𝑦(𝑤 = 〈𝑥, 𝑦〉 ∧ 𝜓)} | |
| 7 | 4, 5, 6 | 3sstr4i 3268 | 1 ⊢ {〈〈𝑥, 𝑦〉, 𝑧〉 ∣ 𝜑} ⊆ {〈〈𝑥, 𝑦〉, 𝑧〉 ∣ 𝜓} |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 = wceq 1397 ∃wex 1540 ⊆ wss 3200 〈cop 3672 {copab 4149 {coprab 6018 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-io 716 ax-5 1495 ax-7 1496 ax-gen 1497 ax-ie1 1541 ax-ie2 1542 ax-8 1552 ax-10 1553 ax-11 1554 ax-i12 1555 ax-bndl 1557 ax-4 1558 ax-17 1574 ax-i9 1578 ax-ial 1582 ax-i5r 1583 ax-14 2205 ax-ext 2213 ax-sep 4207 ax-pow 4264 ax-pr 4299 |
| This theorem depends on definitions: df-bi 117 df-3an 1006 df-tru 1400 df-nf 1509 df-sb 1811 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2363 df-v 2804 df-un 3204 df-in 3206 df-ss 3213 df-pw 3654 df-sn 3675 df-pr 3676 df-op 3678 df-opab 4151 df-oprab 6021 |
| This theorem is referenced by: mpomulf 8168 |
| Copyright terms: Public domain | W3C validator |