![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > raldifb | GIF version |
Description: Restricted universal quantification on a class difference in terms of an implication. (Contributed by Alexander van der Vekens, 3-Jan-2018.) |
Ref | Expression |
---|---|
raldifb | ⊢ (∀𝑥 ∈ 𝐴 (𝑥 ∉ 𝐵 → 𝜑) ↔ ∀𝑥 ∈ (𝐴 ∖ 𝐵)𝜑) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | impexp 263 | . . . 4 ⊢ (((𝑥 ∈ 𝐴 ∧ 𝑥 ∉ 𝐵) → 𝜑) ↔ (𝑥 ∈ 𝐴 → (𝑥 ∉ 𝐵 → 𝜑))) | |
2 | 1 | bicomi 132 | . . 3 ⊢ ((𝑥 ∈ 𝐴 → (𝑥 ∉ 𝐵 → 𝜑)) ↔ ((𝑥 ∈ 𝐴 ∧ 𝑥 ∉ 𝐵) → 𝜑)) |
3 | df-nel 2456 | . . . . . 6 ⊢ (𝑥 ∉ 𝐵 ↔ ¬ 𝑥 ∈ 𝐵) | |
4 | 3 | anbi2i 457 | . . . . 5 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝑥 ∉ 𝐵) ↔ (𝑥 ∈ 𝐴 ∧ ¬ 𝑥 ∈ 𝐵)) |
5 | eldif 3153 | . . . . . 6 ⊢ (𝑥 ∈ (𝐴 ∖ 𝐵) ↔ (𝑥 ∈ 𝐴 ∧ ¬ 𝑥 ∈ 𝐵)) | |
6 | 5 | bicomi 132 | . . . . 5 ⊢ ((𝑥 ∈ 𝐴 ∧ ¬ 𝑥 ∈ 𝐵) ↔ 𝑥 ∈ (𝐴 ∖ 𝐵)) |
7 | 4, 6 | bitri 184 | . . . 4 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝑥 ∉ 𝐵) ↔ 𝑥 ∈ (𝐴 ∖ 𝐵)) |
8 | 7 | imbi1i 238 | . . 3 ⊢ (((𝑥 ∈ 𝐴 ∧ 𝑥 ∉ 𝐵) → 𝜑) ↔ (𝑥 ∈ (𝐴 ∖ 𝐵) → 𝜑)) |
9 | 2, 8 | bitri 184 | . 2 ⊢ ((𝑥 ∈ 𝐴 → (𝑥 ∉ 𝐵 → 𝜑)) ↔ (𝑥 ∈ (𝐴 ∖ 𝐵) → 𝜑)) |
10 | 9 | ralbii2 2500 | 1 ⊢ (∀𝑥 ∈ 𝐴 (𝑥 ∉ 𝐵 → 𝜑) ↔ ∀𝑥 ∈ (𝐴 ∖ 𝐵)𝜑) |
Colors of variables: wff set class |
Syntax hints: ¬ wn 3 → wi 4 ∧ wa 104 ↔ wb 105 ∈ wcel 2160 ∉ wnel 2455 ∀wral 2468 ∖ cdif 3141 |
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-in1 615 ax-in2 616 ax-io 710 ax-5 1458 ax-7 1459 ax-gen 1460 ax-ie1 1504 ax-ie2 1505 ax-8 1515 ax-10 1516 ax-11 1517 ax-i12 1518 ax-bndl 1520 ax-4 1521 ax-17 1537 ax-i9 1541 ax-ial 1545 ax-i5r 1546 ax-ext 2171 |
This theorem depends on definitions: df-bi 117 df-tru 1367 df-nf 1472 df-sb 1774 df-clab 2176 df-cleq 2182 df-clel 2185 df-nfc 2321 df-nel 2456 df-ral 2473 df-v 2754 df-dif 3146 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |