| 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 2531 | . 2 ⊢ (𝜑 → (∀𝑦 ∈ 𝐵 𝜓 ↔ ∀𝑦 ∈ 𝐵 𝜒)) |
| 3 | 2 | rexbidv 2532 | 1 ⊢ (𝜑 → (∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 𝜓 ↔ ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 𝜒)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ↔ wb 105 ∀wral 2509 ∃wrex 2510 |
| 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 1495 ax-gen 1497 ax-ie1 1541 ax-ie2 1542 ax-4 1558 ax-17 1574 ax-ial 1582 |
| This theorem depends on definitions: df-bi 117 df-nf 1509 df-ral 2514 df-rex 2515 |
| This theorem is referenced by: caucvgpr 7904 caucvgprpr 7934 caucvgsrlemgt1 8017 caucvgsrlemoffres 8022 axcaucvglemres 8121 cvg1nlemres 11565 rexfiuz 11569 resqrexlemgt0 11600 resqrexlemoverl 11601 resqrexlemglsq 11602 resqrexlemsqa 11604 resqrexlemex 11605 cau3lem 11694 caubnd2 11697 climi 11867 2clim 11881 ennnfonelemim 13065 mplelbascoe 14732 lmcvg 14967 lmss 14996 txlm 15029 metcnpi 15265 metcnpi2 15266 elcncf 15323 cncfi 15328 limcimo 15415 cnplimclemr 15419 limccoap 15428 |
| Copyright terms: Public domain | W3C validator |