| 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 2532 | . 2 ⊢ (𝜑 → (∀𝑦 ∈ 𝐵 𝜓 ↔ ∀𝑦 ∈ 𝐵 𝜒)) |
| 3 | 2 | rexbidv 2533 | 1 ⊢ (𝜑 → (∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 𝜓 ↔ ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 𝜒)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ↔ wb 105 ∀wral 2510 ∃wrex 2511 |
| 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 2515 df-rex 2516 |
| This theorem is referenced by: caucvgpr 7901 caucvgprpr 7931 caucvgsrlemgt1 8014 caucvgsrlemoffres 8019 axcaucvglemres 8118 cvg1nlemres 11545 rexfiuz 11549 resqrexlemgt0 11580 resqrexlemoverl 11581 resqrexlemglsq 11582 resqrexlemsqa 11584 resqrexlemex 11585 cau3lem 11674 caubnd2 11677 climi 11847 2clim 11861 ennnfonelemim 13044 mplelbascoe 14705 lmcvg 14940 lmss 14969 txlm 15002 metcnpi 15238 metcnpi2 15239 elcncf 15296 cncfi 15301 limcimo 15388 cnplimclemr 15392 limccoap 15401 |
| Copyright terms: Public domain | W3C validator |