| 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 2497 | . 2 ⊢ (𝜑 → (∀𝑦 ∈ 𝐵 𝜓 ↔ ∀𝑦 ∈ 𝐵 𝜒)) |
| 3 | 2 | rexbidv 2498 | 1 ⊢ (𝜑 → (∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 𝜓 ↔ ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 𝜒)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ↔ wb 105 ∀wral 2475 ∃wrex 2476 |
| 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 1461 ax-gen 1463 ax-ie1 1507 ax-ie2 1508 ax-4 1524 ax-17 1540 ax-ial 1548 |
| This theorem depends on definitions: df-bi 117 df-nf 1475 df-ral 2480 df-rex 2481 |
| This theorem is referenced by: caucvgpr 7768 caucvgprpr 7798 caucvgsrlemgt1 7881 caucvgsrlemoffres 7886 axcaucvglemres 7985 cvg1nlemres 11169 rexfiuz 11173 resqrexlemgt0 11204 resqrexlemoverl 11205 resqrexlemglsq 11206 resqrexlemsqa 11208 resqrexlemex 11209 cau3lem 11298 caubnd2 11301 climi 11471 2clim 11485 ennnfonelemim 12668 mplelbascoe 14326 lmcvg 14561 lmss 14590 txlm 14623 metcnpi 14859 metcnpi2 14860 elcncf 14917 cncfi 14922 limcimo 15009 cnplimclemr 15013 limccoap 15022 |
| Copyright terms: Public domain | W3C validator |