![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > ssrmof | GIF version |
Description: "At most one" existential quantification restricted to a subclass. (Contributed by Thierry Arnoux, 8-Oct-2017.) |
Ref | Expression |
---|---|
ssrexf.1 | ⊢ Ⅎ𝑥𝐴 |
ssrexf.2 | ⊢ Ⅎ𝑥𝐵 |
Ref | Expression |
---|---|
ssrmof | ⊢ (𝐴 ⊆ 𝐵 → (∃*𝑥 ∈ 𝐵 𝜑 → ∃*𝑥 ∈ 𝐴 𝜑)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | ssrexf.1 | . . . . 5 ⊢ Ⅎ𝑥𝐴 | |
2 | ssrexf.2 | . . . . 5 ⊢ Ⅎ𝑥𝐵 | |
3 | 1, 2 | dfss2f 3093 | . . . 4 ⊢ (𝐴 ⊆ 𝐵 ↔ ∀𝑥(𝑥 ∈ 𝐴 → 𝑥 ∈ 𝐵)) |
4 | 3 | biimpi 119 | . . 3 ⊢ (𝐴 ⊆ 𝐵 → ∀𝑥(𝑥 ∈ 𝐴 → 𝑥 ∈ 𝐵)) |
5 | pm3.45 587 | . . . 4 ⊢ ((𝑥 ∈ 𝐴 → 𝑥 ∈ 𝐵) → ((𝑥 ∈ 𝐴 ∧ 𝜑) → (𝑥 ∈ 𝐵 ∧ 𝜑))) | |
6 | 5 | alimi 1432 | . . 3 ⊢ (∀𝑥(𝑥 ∈ 𝐴 → 𝑥 ∈ 𝐵) → ∀𝑥((𝑥 ∈ 𝐴 ∧ 𝜑) → (𝑥 ∈ 𝐵 ∧ 𝜑))) |
7 | moim 2064 | . . 3 ⊢ (∀𝑥((𝑥 ∈ 𝐴 ∧ 𝜑) → (𝑥 ∈ 𝐵 ∧ 𝜑)) → (∃*𝑥(𝑥 ∈ 𝐵 ∧ 𝜑) → ∃*𝑥(𝑥 ∈ 𝐴 ∧ 𝜑))) | |
8 | 4, 6, 7 | 3syl 17 | . 2 ⊢ (𝐴 ⊆ 𝐵 → (∃*𝑥(𝑥 ∈ 𝐵 ∧ 𝜑) → ∃*𝑥(𝑥 ∈ 𝐴 ∧ 𝜑))) |
9 | df-rmo 2425 | . 2 ⊢ (∃*𝑥 ∈ 𝐵 𝜑 ↔ ∃*𝑥(𝑥 ∈ 𝐵 ∧ 𝜑)) | |
10 | df-rmo 2425 | . 2 ⊢ (∃*𝑥 ∈ 𝐴 𝜑 ↔ ∃*𝑥(𝑥 ∈ 𝐴 ∧ 𝜑)) | |
11 | 8, 9, 10 | 3imtr4g 204 | 1 ⊢ (𝐴 ⊆ 𝐵 → (∃*𝑥 ∈ 𝐵 𝜑 → ∃*𝑥 ∈ 𝐴 𝜑)) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 103 ∀wal 1330 ∈ wcel 1481 ∃*wmo 2001 Ⅎwnfc 2269 ∃*wrmo 2420 ⊆ wss 3076 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-io 699 ax-5 1424 ax-7 1425 ax-gen 1426 ax-ie1 1470 ax-ie2 1471 ax-8 1483 ax-10 1484 ax-11 1485 ax-i12 1486 ax-bndl 1487 ax-4 1488 ax-17 1507 ax-i9 1511 ax-ial 1515 ax-i5r 1516 ax-ext 2122 |
This theorem depends on definitions: df-bi 116 df-nf 1438 df-sb 1737 df-eu 2003 df-mo 2004 df-clab 2127 df-cleq 2133 df-clel 2136 df-nfc 2271 df-rmo 2425 df-in 3082 df-ss 3089 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |