| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > rexralbidv | GIF version | ||
| Description: Formula-building rule for restricted quantifiers (deduction form). (Contributed by NM, 28-Jan-2006.) |
| Ref | Expression |
|---|---|
| 2ralbidv.1 | ⊢ (𝜑 → (𝜓 ↔ 𝜒)) |
| Ref | Expression |
|---|---|
| rexralbidv | ⊢ (𝜑 → (∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 𝜓 ↔ ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 𝜒)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | 2ralbidv.1 | . . 3 ⊢ (𝜑 → (𝜓 ↔ 𝜒)) | |
| 2 | 1 | ralbidv 2533 | . 2 ⊢ (𝜑 → (∀𝑦 ∈ 𝐵 𝜓 ↔ ∀𝑦 ∈ 𝐵 𝜒)) |
| 3 | 2 | rexbidv 2534 | 1 ⊢ (𝜑 → (∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 𝜓 ↔ ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 𝜒)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ↔ wb 105 ∀wral 2511 ∃wrex 2512 |
| 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-5 1496 ax-gen 1498 ax-ie1 1542 ax-ie2 1543 ax-4 1559 ax-17 1575 ax-ial 1583 |
| This theorem depends on definitions: df-bi 117 df-nf 1510 df-ral 2516 df-rex 2517 |
| This theorem is referenced by: caucvgpr 7945 caucvgprpr 7975 caucvgsrlemgt1 8058 caucvgsrlemoffres 8063 axcaucvglemres 8162 cvg1nlemres 11608 rexfiuz 11612 resqrexlemgt0 11643 resqrexlemoverl 11644 resqrexlemglsq 11645 resqrexlemsqa 11647 resqrexlemex 11648 cau3lem 11737 caubnd2 11740 climi 11910 2clim 11924 ennnfonelemim 13108 mplelbascoe 14776 lmcvg 15011 lmss 15040 txlm 15073 metcnpi 15309 metcnpi2 15310 elcncf 15367 cncfi 15372 limcimo 15459 cnplimclemr 15463 limccoap 15472 |
| Copyright terms: Public domain | W3C validator |