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 2318 | . 2 ⊢ (𝜑 → Ⅎ𝑥𝐵) | |
2 | riota5.1 | . 2 ⊢ (𝜑 → 𝐵 ∈ 𝐴) | |
3 | riota5.2 | . 2 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝜓 ↔ 𝑥 = 𝐵)) | |
4 | 1, 2, 3 | riota5f 5845 | 1 ⊢ (𝜑 → (℩𝑥 ∈ 𝐴 𝜓) = 𝐵) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 104 ↔ wb 105 = wceq 1353 ∈ wcel 2146 ℩crio 5820 |
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 709 ax-5 1445 ax-7 1446 ax-gen 1447 ax-ie1 1491 ax-ie2 1492 ax-8 1502 ax-10 1503 ax-11 1504 ax-i12 1505 ax-bndl 1507 ax-4 1508 ax-17 1524 ax-i9 1528 ax-ial 1532 ax-i5r 1533 ax-ext 2157 |
This theorem depends on definitions: df-bi 117 df-3an 980 df-tru 1356 df-nf 1459 df-sb 1761 df-eu 2027 df-clab 2162 df-cleq 2168 df-clel 2171 df-nfc 2306 df-ral 2458 df-rex 2459 df-reu 2460 df-v 2737 df-sbc 2961 df-un 3131 df-sn 3595 df-pr 3596 df-uni 3806 df-iota 5170 df-riota 5821 |
This theorem is referenced by: f1ocnvfv3 5854 caucvgrelemrec 10954 sqrt0 10979 sqrtsq 11019 dfgcd3 11976 |
Copyright terms: Public domain | W3C validator |