| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > riota5 | GIF version | ||
| Description: A method for computing restricted iota. (Contributed by NM, 20-Oct-2011.) (Revised by Mario Carneiro, 6-Dec-2016.) |
| Ref | Expression |
|---|---|
| riota5.1 | ⊢ (𝜑 → 𝐵 ∈ 𝐴) |
| riota5.2 | ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝜓 ↔ 𝑥 = 𝐵)) |
| Ref | Expression |
|---|---|
| riota5 | ⊢ (𝜑 → (℩𝑥 ∈ 𝐴 𝜓) = 𝐵) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | nfcvd 2351 | . 2 ⊢ (𝜑 → Ⅎ𝑥𝐵) | |
| 2 | riota5.1 | . 2 ⊢ (𝜑 → 𝐵 ∈ 𝐴) | |
| 3 | riota5.2 | . 2 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝜓 ↔ 𝑥 = 𝐵)) | |
| 4 | 1, 2, 3 | riota5f 5947 | 1 ⊢ (𝜑 → (℩𝑥 ∈ 𝐴 𝜓) = 𝐵) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ↔ wb 105 = wceq 1373 ∈ wcel 2178 ℩crio 5921 |
| 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 711 ax-5 1471 ax-7 1472 ax-gen 1473 ax-ie1 1517 ax-ie2 1518 ax-8 1528 ax-10 1529 ax-11 1530 ax-i12 1531 ax-bndl 1533 ax-4 1534 ax-17 1550 ax-i9 1554 ax-ial 1558 ax-i5r 1559 ax-ext 2189 |
| This theorem depends on definitions: df-bi 117 df-3an 983 df-tru 1376 df-nf 1485 df-sb 1787 df-eu 2058 df-clab 2194 df-cleq 2200 df-clel 2203 df-nfc 2339 df-ral 2491 df-rex 2492 df-reu 2493 df-v 2778 df-sbc 3006 df-un 3178 df-sn 3649 df-pr 3650 df-uni 3865 df-iota 5251 df-riota 5922 |
| This theorem is referenced by: f1ocnvfv3 5956 caucvgrelemrec 11405 sqrt0 11430 sqrtsq 11470 dfgcd3 12446 |
| Copyright terms: Public domain | W3C validator |