| 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 2530 | . 2 ⊢ (𝜑 → (∀𝑦 ∈ 𝐵 𝜓 ↔ ∀𝑦 ∈ 𝐵 𝜒)) |
| 3 | 2 | rexbidv 2531 | 1 ⊢ (𝜑 → (∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 𝜓 ↔ ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 𝜒)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ↔ wb 105 ∀wral 2508 ∃wrex 2509 |
| 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 1493 ax-gen 1495 ax-ie1 1539 ax-ie2 1540 ax-4 1556 ax-17 1572 ax-ial 1580 |
| This theorem depends on definitions: df-bi 117 df-nf 1507 df-ral 2513 df-rex 2514 |
| This theorem is referenced by: caucvgpr 7892 caucvgprpr 7922 caucvgsrlemgt1 8005 caucvgsrlemoffres 8010 axcaucvglemres 8109 cvg1nlemres 11536 rexfiuz 11540 resqrexlemgt0 11571 resqrexlemoverl 11572 resqrexlemglsq 11573 resqrexlemsqa 11575 resqrexlemex 11576 cau3lem 11665 caubnd2 11668 climi 11838 2clim 11852 ennnfonelemim 13035 mplelbascoe 14696 lmcvg 14931 lmss 14960 txlm 14993 metcnpi 15229 metcnpi2 15230 elcncf 15287 cncfi 15292 limcimo 15379 cnplimclemr 15383 limccoap 15392 |
| Copyright terms: Public domain | W3C validator |