| 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 2507 | . 2 ⊢ (𝜑 → (∀𝑦 ∈ 𝐵 𝜓 ↔ ∀𝑦 ∈ 𝐵 𝜒)) |
| 3 | 2 | rexbidv 2508 | 1 ⊢ (𝜑 → (∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 𝜓 ↔ ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 𝜒)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ↔ wb 105 ∀wral 2485 ∃wrex 2486 |
| 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 1471 ax-gen 1473 ax-ie1 1517 ax-ie2 1518 ax-4 1534 ax-17 1550 ax-ial 1558 |
| This theorem depends on definitions: df-bi 117 df-nf 1485 df-ral 2490 df-rex 2491 |
| This theorem is referenced by: caucvgpr 7825 caucvgprpr 7855 caucvgsrlemgt1 7938 caucvgsrlemoffres 7943 axcaucvglemres 8042 cvg1nlemres 11381 rexfiuz 11385 resqrexlemgt0 11416 resqrexlemoverl 11417 resqrexlemglsq 11418 resqrexlemsqa 11420 resqrexlemex 11421 cau3lem 11510 caubnd2 11513 climi 11683 2clim 11697 ennnfonelemim 12880 mplelbascoe 14539 lmcvg 14774 lmss 14803 txlm 14836 metcnpi 15072 metcnpi2 15073 elcncf 15130 cncfi 15135 limcimo 15222 cnplimclemr 15226 limccoap 15235 |
| Copyright terms: Public domain | W3C validator |